Go backward to Example (Continued)Go up to TopGo forward to Complete Induction |

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

We prove

We take arbitraryforallxinN,yinN,zinN:x+(y+z) = (x+y)+z.

We have to showforallzinN:x+(y+z) = (x+y)+z

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

*See lecture notes.*

Author: Wolfgang Schreiner

Last Modification: November 24, 1999