helphome pageduck scriptspecificationfirst proof pagepage 1 1

A Lemma About Mod2


We want to prove
( M  : Nat  ) mod2(2 * M) = 0 .
We use induction on M to prove this goal. For this, we use the induction scheme based on the signature { 0, s } for Nat. Induction requires that we do the following:
  1. Base case: prove the assertion for M = 0 .
  2. Induction case: assume the assertion for M = N0 , and then prove it for M = s N0 .

And thus the main goal is proved.

BOBJ proof scoreLeft    Up    Down    Right   
 

       This page was generated by Kumo on Tue Feb 13 19:36:04 PST 2001.