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

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

1. k :

k List
3. u :

k
4. v :

k List
5. y :

(k+1)
6. y greater-bounds v
7. u<y
8. i :

||u.v||
9. 0<i

v[(i-1)]<y

By:	BackThru: Hyp:6

Generated subgoal:

1 i-1 ||v||
1 step

About:

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