(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.
n
:
2. 0<
n
3.
k
:
k
= ndiv(
k
;
n
)
n
+nmod(
k
;
n
)
By:
Unab [`ndiv`;`nmod`] THEN StrongAuto THEN Try (Complete (Unfold `label` 0))
Generated subgoal:
1
k
= if
n
=
0 then 0 else
k
n
fi
n
+if
n
=
0 then 0 else
k
rem
n
fi
2
steps
About:
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
k = ndiv(k;n)
n+nmod(k;n) 
k = ndiv(k;n)n+nmod(k;n) k = if n=
0 then 0 else k 
n fi n+if n=0 then 0 else k rem n fi 
