(4steps total)
PrintForm
Definitions
Lemmas
graph
1
2
Sections
Graphs
Doc
At:
elim
divides
x:
, n:
. (n | x)
(x mod n) = 0
By:
UnivCD
THEN
Inst
Thm*
a:
, n:
. a = (a
n)
n+(a mod n) [x;n]
THEN
Unfold `divides` 0
Generated subgoals:
1
1.
x:
2.
n:
3.
x = (x
n)
n+(x mod n)
4.
c:
. x = n
c
(x mod n) = 0
2
steps
 
2
1.
x:
2.
n:
3.
x = (x
n)
n+(x mod n)
4.
(x mod n) = 0
c:
. x = n
c
1
step
About:
(4steps total)
PrintForm
Definitions
Lemmas
graph
1
2
Sections
Graphs
Doc