PrintForm Definitions Lemmas hol arithmetic 5 Sections HOLlib Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: odd exists
  n:. odd(n)  (m:. n = 2m+1  )
By: RewriteOfThm
Thm* all(n:hnum. equal(odd(n),exists(m:hnum. equal(n,suc(mult(2,m))))))
(SimpsetC [`hol_to_nuprl`;`bequal`])

Generated subgoals:

None

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

PrintForm Definitions Lemmas hol arithmetic 5 Sections HOLlib Doc