(12steps)
PrintForm
Definitions
Lemmas
int
2
Sections
StandardLIB
Doc
At:
rem
invariant
1
2
1.
a:
2.
n:
3.
b:
4.
0 < b
5.
((a+(b-1)
n) rem n) = (a rem n)
((a+b
n) rem n) = (a rem n)
By:
Assert (a+b
n
n)
Generated subgoals:
1
a+b
n
n
2
6.
a+b
n
n
((a+b
n) rem n) = (a rem n)
About:
(12steps)
PrintForm
Definitions
Lemmas
int
2
Sections
StandardLIB
Doc
a+b
n
nnn ((a+bn) rem n) = (a rem n)
n) rem n) = (a rem n) ((a+bn) rem n) = (a rem n)nn) a+bnnnn ((a+bn) rem n) = (a rem n)
