Go backward to Example (Continued) Go up to Top Go forward to Complete Induction

Example

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.

forall z in N: x+(y+z) = (x+y)+z

x+(y+0) = (x+y)+0.

See lecture notes.