Union of Slowly Well-Ordered Class under Subset Relation is Well-Orderable/Corollary 2

Corollary to Union of Slowly Well-Ordered Class under Subset Relation is Well-Orderable

Let $N$ be a class.

Let $N$ be slowly well-ordered under the subset relation.

For $a \in \bigcup N$, let $\map F a$ denote the smallest element of $N$ that contains $a$.

For $a, b \in \bigcup N$, we define $a \preccurlyeq b \iff \map F a \subseteq \map F b$.

We have that:

$\forall x \in N, a \in \bigcup N: x \in \map F a \implies x \preccurlyeq a$

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

• 2010: Raymond M. Smullyan and Melvin Fitting: Set Theory and the Continuum Problem (revised ed.) ... (previous) ... (next): Chapter $4$: Superinduction, Well Ordering and Choice: Part $\text I$ -- Superinduction and Well Ordering: $\S 4$ Well ordering and choice: Exercise $4.1 \ \text{(b)}$