(12steps) PrintForm Definitions Lemmas int 2 Sections StandardLIB Doc

At: rem invariant 1 2 1 1

1. a:
2. n:
3. b:
4. 0+1b
5. ((a+(b-1)n) rem n) = (a rem n)

a+bnn

By: Using [`n',n] (FwdThru Thm* a,b:, n:. ab nanb [4])

Generated subgoal:

16. n(0+1)nb
a+bnn


About:
intnatural_numberaddsubtractmultiplyremainderequal

(12steps) PrintForm Definitions Lemmas int 2 Sections StandardLIB Doc