previous up next
Go backward to Example (Continued)
Go up to Top
Go forward to Complete Induction
RISC-Linz logo


We can prove by induction the "computing laws" in N:

We prove

forall x in N, y in N, z in N: x+(y+z) = (x+y)+z.
We take arbitrary x in N and y in N and prove by induction on z.
forall z in N: x+(y+z) = (x+y)+z
We have to show
x+(y+0) = (x+y)+0.

See lecture notes.

Author: Wolfgang Schreiner
Last Modification: November 24, 1999

previous up next