TheoremBase

Induction on omega is applied to the class of elements of omega that are zero or lie in A, showing every nonzero element of omega lies in A; since A is contained in the natural numbers, extensionality gives equality.

Proof

Throughout, every element of a class is a set by Class Theory NBG: the Axioms, Standing Conventions and Basic Notation §objects. Membership in a class formed by class abstraction is unfolded by Class Abstraction: the Class of All Sets Satisfying a Predicative Formula §abstraction; class abstractions are unfolded without further mention. Let ω\omega and 00 be as in The Class Omega of Natural Numbers with Zero §omega and The Class Omega of Natural Numbers with Zero §zero, and let AA be as in the clause induction above.

Induction on ω\omega. Let

B={n∈ω:n=0∨n∈A},B=\{n\in\omega:n=0\vee n\in A\},

formed by class abstraction with the parameters ω\omega and AA; its formula has no quantifier, 00 being a defined set symbol by The Empty Set, the Unordered Pair and the Singleton §empty, so it is predicative as Class Theory NBG: the Axioms, Standing Conventions and Basic Notation §comprehension requires. Since 0∈ω0\in\omega by Omega Is the Least Inductive Class: It Is a Set, Induction from Zero, the Peano Properties, and Transitivity §inductive and 0=00=0, 0∈B0\in B. Let n∈ωn\in\omega with n∈Bn\in B. Then S(n)∈ωS(n)\in\omega by Omega Is the Least Inductive Class: It Is a Set, Induction from Zero, the Peano Properties, and Transitivity §inductive. If n=0n=0, then S(n)=S(0)=1S(n)=S(0)=1 by The Set of Natural Numbers and the Number One §one, and 1∈A1\in A by hypothesis; if n∈An\in A, then S(n)∈AS(n)\in A by hypothesis. In either case S(n)∈AS(n)\in A, so S(n)∈BS(n)\in B. By Omega Is the Least Inductive Class: It Is a Set, Induction from Zero, the Peano Properties, and Transitivity §induction, ω⊆B\omega\subseteq B.

Equality. Let n∈Nn\in\mathbb{N}. By The Set of Natural Numbers and the Number One §naturals and The Boolean Operations on Classes, Disjointness, and the Universal Class §operations, n∈ωn\in\omega and n∉{0}n\notin\{0\}, so n≠0n\neq0 by The Empty Set, the Unordered Pair and the Singleton §singleton. Since ω⊆B\omega\subseteq B, n∈Bn\in B, so n=0n=0 or n∈An\in A; hence n∈An\in A. Conversely, every element of AA lies in N\mathbb{N} because A⊆NA\subseteq\mathbb{N}, by Subclasses and Subsets §subclass. Thus for every set nn, n∈An\in A if and only if n∈Nn\in\mathbb{N}, and A=NA=\mathbb{N} by Class Theory NBG: the Axioms, Standing Conventions and Basic Notation §extensionality.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…