(43steps total) PrintForm Definitions Lemmas mb list 1 Sections MarkB generic Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: cons sublist cons 1 1 1 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. j:(||L1||+1). [x1 / L1][j] = [x2 / L2][(f(j))]
9. [x1 / L1][0] = [x2 / L2][(f(0))]
10. f(0) = 0
  f:(||L1||||L2||). 
  increasing(f;||L1||) & (j:||L1||. L1[j] = L2[(f(j))])


By: InstConcl [i.f(i+1)-1] THEN Reduce 0


Generated subgoals:

1 11. i : ||L1||
  f(i+1)-1  ||L2||

1 step
2   increasing(i.f(i+1)-1;||L1||)
1 step
3 11. j : ||L1||
  L1[j] = L2[(f(j+1)-1)]

4 steps

About:
listconsintnatural_numberaddsubtractlambdaapply
functionuniverseequalmemberandall
exists
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html

(43steps total) PrintForm Definitions Lemmas mb list 1 Sections MarkB generic Doc