Transfinite Induction/Schema 2

Theorem
Let $\map \phi x$ be a property satisfying the following conditions:


 * $(1): \quad \map \phi \O$ is true
 * $(2): \quad$ If $x$ is an ordinal, then $\map \phi x \implies \map \phi {x^+}$
 * $(3): \quad$ If $y$ is a limit ordinal, then $\paren {\forall x < y: \map \phi x} \implies \map \phi y$

where $x^+$ denotes the successor of $x$.

Then, $\map \phi x$ is true for all ordinals $x$.

Proof 2
In proofs by transfinite induction using this particular schema, the following terms are used.

Basis for the Induction
The proposition $\map \phi \O$ is called the basis for the induction.

Induction Step
The proposition $\map \phi x = \T \implies \map \phi {x^+} = \T$ is called the inductive step.

It says that the propositional function will pass from an ordinal number to its successor.

Limit Case
$\paren {\forall x < y: \map \phi x = \T} \implies \map \phi y = \T$ is called the limit case.

It states that if $\phi$ is true for every ordinal strictly less than $y$, then $\phi$ is true for $y$.

It is essentially proving that the proposition will hold for limit ordinals.

Then, this formulation of transfinite induction says that if the basis for the induction, inductive step, and limit case are all satisfied, then the statement holds for all ordinals.