Nuprl Basics - Proof: sfa doc find intlist great bound 1 1 2 1 2 1 a

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

List
2. u :

3. v :

List
4. w :

||v||. v[i]<w
6.

u<w
7. i :

||u.v||

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

By:	Decide: 0<i

Generated subgoals:

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

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

About:

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