TheoremBase

Axiom of Dependent Choice

If R is a relation on a set b in which every element is related to some element, then from any starting point s in b there is a sequence indexed by N starting at s whose consecutive terms are related by R.

Statement

In the setting of Class Theory NBG: the Axioms, Standing Conventions and Basic Notation, let ω\omega be as in The Class Omega of Natural Numbers with Zero §omega, let N\mathbb{N} and 11 be as in The Set of Natural Numbers and the Number One §naturals and The Set of Natural Numbers and the Number One §one, and let ++ be the addition on ω\omega. Then 1∈N1\in\mathbb{N} by Natural Numbers Are the Successors in Omega: One Is Least and Not a Successor of a Natural Number, the Successor Is Injective, and N Is Closed under Addition and Multiplication §one, and m+1∈Nm+1\in\mathbb{N} for every m∈Nm\in\mathbb{N} by Natural Numbers Are the Successors in Omega: One Is Least and Not a Successor of a Natural Number, the Successor Is Injective, and N Is Closed under Addition and Multiplication §closed.

Let bb be a set, let RR be a relation on bb such that for every u∈bu\in b there is v∈bv\in b with (u,v)∈R(u,v)\in R, and let s∈bs\in b. Then there is a map f:N→bf:\mathbb{N}\to b, written as the family (fm)m∈N(f_{m})_{m\in\mathbb{N}}, such that f1=sf_{1}=s and (fm,fm+1)∈R(f_{m},f_{m+1})\in R for every m∈Nm\in\mathbb{N}.

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…