Elements of Minimally Inductive Set are Well-Ordered
Jump to navigation
Jump to search
Theorem
Let $\omega$ be the minimally inductive set.
Let $a \in \omega$.
Then $a$ is well-ordered by $\subseteq$.
Proof
This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. 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 {{ProofWanted}} 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
- 1960: Paul R. Halmos: Naive Set Theory ... (previous) ... (next): $\S 17$: Well Ordering