(4steps total)
PrintForm
Definitions
Lemmas
graph
1
2
Sections
Graphs
Doc
At:
elim
divides
1
1.
x:
2.
n:
3.
x = (x
n)
n+(x mod n)
4.
c:
. x = n
c
(x mod n) = 0
By:
ExRepD
THEN
Assert (n
c = (x
n)
n+(x mod n))
Generated subgoal:
1
4.
c:
5.
x = n
c
6.
n
c = (x
n)
n+(x mod n)
(x mod n) = 0
1
step
About:
(4steps total)
PrintForm
Definitions
Lemmas
graph
1
2
Sections
Graphs
Doc
cc = (x 
n)n+(x mod n)
(x mod n) = 0
n)n+(x mod n)
c:. x = nc
(x mod n) = 0
c = (x n)n+(x mod n))
cc = (x n)n+(x mod n) (x mod n) = 0
