Ackermann-Péter Function is Greater than Second Argument

Theorem
For all $x, y \in \N$:
 * $\map A {x, y} > y$

where $A$ is the Ackermann-Péter function.

Proof
First, perform induction on $x$.

Basis for the Induction
Suppose $x = 0$.

Then:

This is the basis for the induction.

Induction Hypothesis $\paren 1$
This is the induction hypothesis

Suppose that, for every $y \in \N$:
 * $\map A {x, y} > y$

We want to show that, for every $y \in \N$:
 * $\map A {x + 1, y} > y$

Induction Step
This is the induction step:

We will now perform another induction on $y$.

Basis for the Induction
Suppose $y = 0$.

Then:

This is the basis for the induction.

Induction Hypothesis $\paren 2$
This is the induction hypothesis:

Suppose that:
 * $\map A {x + 1, y} > y$

We want to show that:
 * $\map A {x + 1, y + 1} > y + 1$

Induction Step
This is the induction step:

By the Principle of Mathematical Induction, the Induction Step $\paren 1$ holds.

By the Principle of Mathematical Induction, the result holds.