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

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

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

(||L1||+1)

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

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

||L1||
12. L1[(j+1-1)] = L2[(f(j+1)-1)]

L1[j] = L2[(f(j+1)-1)]

By:	RevHypSubst -1 0 THEN ArithSimp 0

Generated subgoals:

None

About:

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