Nuprl - Proof: cons sublist cons 2 2 2 1 3 1

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: cons sublist cons 2 2 2 1 3 1

1. T : Type
2. x1 : T
3. T
4. L1 : T List
5. L2 : T List
6. f :

(||L1||+1)

||L2||
7. increasing(f;||L1||+1)
8.

(||L1||+1). [x1 / L1][j] = L2[(f(j))]
9. j :

(||L1||+1)
10. T

j<||[x1 / L1]||

By:

Reduce 0

Generated subgoals:

None

About:

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