Nuprl Basics - Proof: sfa doc cand example 1

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: sfa doc cand example 1

1. k :

2. 0<k
3. (2

k)<1

2<k

By:	Decide: 2<k THEN PointCases [1 \| 2] k

Generated subgoals:

1 4. 2<k
5. k = 1
  2<k
1 step

2 4. 2<k
5. k = 2
  2<k
1 step

About:

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