(24steps total) PrintForm Definitions Lemmas num thy 1 Sections StandardLIB Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: divides iff rem zero 1
1. a : 
2. b : 
3. b | a
  (a rem b) = 0
By: Assert (i:, j:. j | i  (i rem j) = 0)

Generated subgoals:

1   i:, j:. j | i  (i rem j) = 0
8 steps
2 4. i:, j:. j | i  (i rem j) = 0
  (a rem b) = 0
11 steps

About:
intnatural_numberremainderequalimpliesall
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html

(24steps total) PrintForm Definitions Lemmas num thy 1 Sections StandardLIB Doc