Nuprl - Proof: pre suc eq

IF YOU CAN SEE THIS go to http://www.cs.cornell.edu/Info/People/sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: pre suc eq

m,n:

. 0<n

(m = pre(n)

m+1 = n

)

By:	RewriteOfThm Thm* all Thm* (m:hnum. all Thm* (m:hnum. (n:hnum. implies Thm* (m:hnum. (n:hnum. (lt(0,n) Thm* (m:hnum. (n:hnum. ,equal(equal(m,pre(n)),equal(suc(m),n))))) (SimpsetC [`hol_to_nuprl`;`bequal`])

Generated subgoals:

None

About:

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