(6steps total) PrintForm Definitions Lemmas hol arithmetic 2 Sections HOLlib Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: hdivision 2
1. n : 
2. 0<n
3. k : 
  nmod(k;n)<n
By: Unab [`nmod`] THEN BifCase THEN Simp THEN StrongAuto

Generated subgoal:

1 4. n = 0
  (k rem n)<n
1 step

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

(6steps total) PrintForm Definitions Lemmas hol arithmetic 2 Sections HOLlib Doc