Nuprl - Proof: cons sublist cons 2 1 2 2

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

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

||L1||

||L2||
8. increasing(f;||L1||)
9.

||L1||. L1[j] = L2[(f(j))]
10. j :

(||L1||+1)

[x1 / L1][j] = [x2 / L2][if j=

0 else f(j-1)+1 fi]

By:	SplitOnConclITE

Generated subgoals:

1 11. j = 0
[x1 / L1][j] = [x2 / L2][0]
1 step

2 11. j = 0
[x1 / L1][j] = [x2 / L2][(f(j-1)+1)]
3 steps

About:

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

1	11. j = 0 [x1 / L1][j] = [x2 / L2][0]	1 step
2	11. j = 0 [x1 / L1][j] = [x2 / L2][(f(j-1)+1)]	3 steps