(11steps)
PrintForm
Definitions
Lemmas
int
2
Sections
StandardLIB
Doc
At:
div
floor
mod
sum
1
1.
a:
2.
n:
a = (a
n)
n+(a mod n)
By:
Unfolds [`div_floor`;`modulus`] 0
Generated subgoal:
1
a = if 0
a
a
n ;((-a) rem n)=
0
-((-a)
n) else -((-a)
n)+-1 fi
n+if 0
a
a rem n ;((-a) rem n)=
0
0 else n-((-a) rem n) fi
About:
(11steps)
PrintForm
Definitions
Lemmas
int
2
Sections
StandardLIB
Doc