Set of Natural Numbers is Smallest Ordinal Greater than All Natural Numbers
Jump to navigation
Jump to search
Theorem
The set of natural numbers $\N$ is the smallest ordinal which is greater than all natural numbers.
Proof
From Set of Natural Numbers is Ordinal, $\N$ is an ordinal.
![]() | This needs considerable tedious hard slog to complete it. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Finish}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |
Sources
- 2010: Raymond M. Smullyan and Melvin Fitting: Set Theory and the Continuum Problem (revised ed.) ... (previous) ... (next): Chapter $5$: Ordinal Numbers: $\S 3$ Some ordinals