Nuprl - Proof: assert of lt int 1 2

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: assert of lt int 1 2

1. x :

2. y :

3. x<

y
4.

x<y

By:	Unfold `lt_int` 3 THEN RWH (ReduceThenC Auto) 3

Generated subgoal:

1 3. false
4. x<y
x<y
1 step

About:

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