PrintForm Definitions Lemmas hol arithmetic 4 Sections HOLlib Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: gen induction

  P:(). P(0) & (n:. (m:m<n  P(m))  P(n))  (n:P(n))

By: RewriteOfThm
Thm* all
Thm* (P:hnum  hbool. implies
Thm* (P:hnum  hbool. (and
Thm* (P:hnum  hbool. ((P(0)
Thm* (P:hnum  hbool. (,all
Thm* (P:hnum  hbool. (,(n:hnum. implies
Thm* (P:hnum  hbool. (,(n:hnum. (all(m:hnum. implies(lt(m,n),P(m)))
Thm* (P:hnum  hbool. (,(n:hnum. ,P(n))))
Thm* (P:hnum  hbool. ,all(n:hnum. P(n))))
(SimpsetC [`hol_to_nuprl`;`bequal`])


Generated subgoals:

None

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

PrintForm Definitions Lemmas hol arithmetic 4 Sections HOLlib Doc