(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:

11. x:
2. n:
3. x = (x n)n+(x mod n)
4. c:. x = nc
(x mod n) = 0
2 steps
 
21. x:
2. n:
3. x = (x n)n+(x mod n)
4. (x mod n) = 0
c:. x = nc
1 step

About:
intnatural_numberaddmultiplyequalallexists

(4steps total) PrintForm Definitions Lemmas graph 1 2 Sections Graphs Doc