Nuprl - Proof: hless or eq 1 1

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: hless or eq 1 1

1. m :

2. n :

3. m

m<n

m = n

By:	Decide (m<n) THEN StrongAuto THEN Try (Complete (Unfold `label` 0))

Generated subgoal:

1 4. m<n
m<n m = n
1 step

About:

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