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

At: rem invariant 1 2 2

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

((a+bn) rem n) = (a rem n)

By: RWAddr [2] (LemmaC Thm* a:, n:. an (a rem n) = ((a-n) rem n)) 0

Generated subgoal:

1 ((a+bn-n) rem n) = (a rem n)


About:
intnatural_numberaddsubtractmultiplyremainderless_thanequal

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