Nuprl Basics - Proof: sfa doc find small greater bound 1 2 1 2 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 2 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||

(u.v)[i]<u+1

By:	Reduce Hyp:8 THEN Decide: 0<i

Generated subgoals:

1 8. i : (||v||+1)
9. 0<i
(u.v)[i]<u+1
2 steps

2 8. i : (||v||+1)
9. 0<i
(u.v)[i]<u+1
1 step

About:

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

1	8. i : (\|\|v\|\|+1) 9. 0<i (u.v)[i]<u+1	2 steps
2	8. i : (\|\|v\|\|+1) 9. 0<i (u.v)[i]<u+1	1 step