(13steps)
PrintForm
Definitions
Lemmas
int
2
Sections
StandardLIB
Doc
At:
mod
bounds
2
1.
a:
2.
n:
(a mod n) < n
By:
Unfold `modulus` 0
Generated subgoal:
1
if 0
a
a rem n ;((-a) rem n)=
0
0 else n-((-a) rem n) fi < n
About:
(13steps)
PrintForm
Definitions
Lemmas
int
2
Sections
StandardLIB
Doc
if 0
a
a rem n ;((-a) rem n)=00 else n-((-a) rem n) fi < n
(a mod n) < n if 0aa rem n ;((-a) rem n)=00 else n-((-a) rem n) fi < n
