User:Prime.mover/Proof Structures/Proof by Superinduction

Proof by Superinduction
The proof proceeds by superinduction.

For all $x \in M$, let $\map P x$ be the proposition:
 * $\text {proposition}_x$

Basis for the Induction
$\map P \O$ is the case:
 * $\text {proposition}_\O$

Thus $\map P \O$ is seen to hold.

This is the basis for the induction.

Induction Hypothesis
Now it needs to be shown that if $\map P x$ is true, where $x \in M$, then it logically follows that $\map P {\map g x}$ is true.

So this is the induction hypothesis:
 * $\text {proposition}_x$

from which it is to be shown that:
 * $\text {proposition}_{\map g x}$

Induction Step
This is the induction step:

So $\map P x \implies \map P {\map g x}$.

Closure under Chain Unions
It remains to demonstrate closure under chain unions.

Let $\map P x$ be true for all $x \in C$, where $C$ is an arbitrary chain of elements of $M$.

That is:
 * $\forall x \in C: \text {proposition}_x$

and so:
 * $\text {proposition}_{\ds \bigcup C}$

That is:
 * $\forall C: \forall x \in C: \map P x \implies \map P {\ds \bigcup C}$

The result follows by the Principle of Superinduction.

Therefore:
 * $\forall x \in M: \text {proposition}_x$