Nuprl - Proof: inv pre eq

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

m,n:

. 0<m & 0<n

(pre(m) = pre(n)

m = n)

By:	RewriteOfThm Thm* all Thm* (m:hnum. all Thm* (m:hnum. (n:hnum. implies Thm* (m:hnum. (n:hnum. (and(lt(0,m),lt(0,n)) Thm* (m:hnum. (n:hnum. ,equal(equal(pre(m),pre(n)),equal(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