Transfinite Induction/Principle 1/Proof 2

From ProofWiki
Jump to navigation Jump to search


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

Let $A$ denote a class.

Suppose that:

For each element $x$ of $\On$, if $\forall y \in \On: \paren {y < x \implies y \in A}$ then $x$ is an element of $A$.

Then $\On \subseteq A$.


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


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

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

By Class of All Ordinals is Well-Ordered by Subset Relation, $\On \setminus A$ must have a smallest element $y$.

Then every strict predecessor of $y$ must lie in $A$, so by the premise, $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$.


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.