# Transfinite Induction/Principle 1

## Theorem

Let $\On$ denote the class of all ordinals.

Let $A$ denote a class.

Suppose that:

Then $\On \subseteq A$.

## Proof

*This page is beyond the scope of ZFC, and should not be used in anything other than the theory in which it resides.*

*If you see any proofs that link to this page, please insert this template at the top.*

*If you believe that the contents of this page can be reworked to allow ZFC, then you can discuss it at the talk page.*

Aiming for a contradiction, suppose that $\neg \On \subseteq A$.

Then:

- $\paren {\On \setminus A} \ne \O$

From Set Difference is Subset, $\On \setminus A$ is a subclass of the ordinals.

By Epsilon Relation is Strongly Well-Founded on Ordinal Class, $\On \setminus A$ must have a strictly minimal element $y$ under $\in$.

By Element of Ordinal is Ordinal, $y$ must be a subset of $\On$, the class of all ordinals.

However, from the fact that $y$ is a strictly minimal element under $\in$ of $\On \setminus A$:

- $\paren {\On \setminus A} \cap y = \O$

So by its subsethood of $\On$:

- $\paren {\On \cap y} \setminus A = \paren {y \setminus A} = \O$

Therefore $y \subseteq A$.

However, by the hypothesis, $y$ must also be an element of $A$.

This contradicts the fact that $y$ is an element of $\On \setminus A$.

Therefore $\On \subseteq A$.

$\blacksquare$

#### Law of the Excluded Middle

This proof depends on the Law of the Excluded Middle, by way of Reductio ad Absurdum.

This is one of the axioms of logic that was determined by Aristotle, and forms part of the backbone of classical (Aristotelian) logic.

However, the intuitionist school rejects the Law of the Excluded Middle as a valid logical axiom.

This in turn invalidates this proof from an intuitionistic perspective.

## Sources

- 1960: Paul R. Halmos:
*Naive Set Theory*... (previous) ... (next): $\S 17$: Well Ordering - 1971: Gaisi Takeuti and Wilson M. Zaring:
*Introduction to Axiomatic Set Theory*: $7.17$