Go backward to Mathematical Induction Go up to Top Go forward to Example

Typical Format

We want to prove

forall x in N: F.

1. Induction Base: We show F[x <- 0].
2. Induction Hypothesis: We take arbitrary x in N and assume F.
3. Induction Step: We show F[x <- x+1].

Proof strategy for formulas that are universally quantified over N.