PrintForm Definitions Lemmas hol arithmetic 5 Sections HOLlib Search Doc
IF YOU CAN SEE THIS go to http://www.cs.cornell.edu/Info/People/sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: sub left sub

  m,n,x:. nnsub(m;nnsub(n;x)) = if nx then m else nnsub(m+x;n) fi 

By: RewriteOfThm
Thm* all
Thm* (m:hnum. all
Thm* (m:hnum. (n:hnum. all
Thm* (m:hnum. (n:hnum. (p:hnum. equal
Thm* (m:hnum. (n:hnum. (p:hnum. (sub(m,sub(n,p))
Thm* (m:hnum. (n:hnum. (p:hnum. ,cond(le(n,p),m,sub(add(m,p),n))))))
(SimpsetC [`hol_to_nuprl`;`bequal`])


Generated subgoals:

None

About:
assertaddapplyequalall
IF YOU CAN SEE THIS go to http://www.cs.cornell.edu/Info/People/sfa/Nuprl/Shared/Xindentation_hack_doc.html

PrintForm Definitions Lemmas hol arithmetic 5 Sections HOLlib Search Doc