Nuprl Basics - Proof: sfa doc find small greater bound 1 2 1 2

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: sfa doc find small greater bound 1 2 1 2

1. k :

[not for witness]
2.

k List
3. u :

k
4. v :

k List
5. y :

(k+1)
6. y greater-bounds v [not for witness]
7.

u<y

{y:

(k+1)| y greater-bounds u.v }

By:	Witness: u+1

Generated subgoal:

1 1. k :
2. k List
3. u : k
4. v : k List
5. y : (k+1)
6. y greater-bounds v
7. u<y
u+1 greater-bounds u.v
6 steps

About:

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