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

1. n : 
2. 0<n
3. k : 
  k = if n=0 then 0 else k  n fi n+if n=0 then 0 else k rem n fi   


By: BifCase THEN Simp THEN StrongAuto


Generated subgoal:

1 4. n = 0
  k = (k  n)n+(k rem n 

1 step

About:
natural_numberaddmultiplydivideremainderless_thanequal
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