Property of Increasing Mapping on Ordinals
Jump to navigation
Jump to search
Theorem
Let $\On$ denote the class of all ordinals.
Let $K_{II}$ denote the class of all limit ordinals.
Let $F$ be a mapping defined on $\On$ satisfying the following conditions:
\(\text {(1)}: \quad\) | \(\ds \forall \alpha \in \On: \, \) | \(\ds \map F \alpha\) | \(\subseteq\) | \(\ds \map F {\alpha^+}\) | ||||||||||
\(\text {(2)}: \quad\) | \(\ds \forall \lambda \in K_{II}: \forall \alpha \in \On: \, \) | \(\ds \alpha\) | \(<\) | \(\ds \lambda\) | ||||||||||
\(\, \ds \implies \, \) | \(\ds \map F \alpha\) | \(\le\) | \(\ds \map F \lambda\) |
Then:
\(\ds \forall \alpha, \beta \in \On: \, \) | \(\ds \alpha\) | \(\le\) | \(\ds \beta\) | |||||||||||
\(\, \ds \implies \, \) | \(\ds \map F \alpha\) | \(\le\) | \(\ds \map F \beta\) |
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 $6$: Order Isomorphism and Transfinite Recursion: $\S 5$ Transfinite recursion theorems: Exercise $5.4$