Sandwich Principle for Slowly Progressing Mapping/Corollary

Theorem

Let $M$ be a class.

Let $g: M \to M$ be a slowly progressing mapping on $M$.

Let $M$ be a minimally inductive class under $g$.

Let $N$ be a nest which is closed under $g$.

Then:

$\forall x, y \in N: \map g x \subseteq y \lor y \subseteq x$

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 $3$: The Natural Numbers: $\S 9$ Supplement -- optional: Lemma $S_3 \ (2)$