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

At: rem invariant 1 2 1

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

a+bnn

By: RW (LemmaC Thm* i,j:. i < j i+1j) 4

Generated subgoal:

14. 0+1b
5. ((a+(b-1)n) rem n) = (a rem n)
a+bnn


About:
intnatural_numberaddsubtractmultiplyremainderless_thanequal

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