Nuprl - Proof: compose flips append 1

(5steps total) PrintForm Definitions Lemmas mb list 2 Sections MarkB generic Doc

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: compose flips append 1

1. k :

2. L1 :

(k-1) List
3. L2 :

(k-1) List

compose_list(map(

i.(i, i+1);L1)) o compose_list(map(

i.(i, i+1);L2))

compose_list(map(

i.(i, i+1);L1 @ L2))

By:	Subst (map(i.(i, i+1);L1 @ L2) ~ (map(i.(i, i+1);L1) @ map(i.(i, i+1);L2))) 0

Generated subgoals:

1   map(i.(i, i+1);L1 @ L2) ~ (map(i.(i, i+1);L1) @ map(i.(i, i+1);L2))
1 step

2   compose_list(map(i.(i, i+1);L1)) o compose_list(map(i.(i, i+1);L2))
  =
  compose_list(map(i.(i, i+1);L1) @ map(i.(i, i+1);L2))
   kk
2 steps

About:

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

(5steps total) PrintForm Definitions Lemmas mb list 2 Sections MarkB generic Doc

1	map(i.(i, i+1);L1 @ L2) ~ (map(i.(i, i+1);L1) @ map(i.(i, i+1);L2))	1 step
2	compose_list(map(i.(i, i+1);L1)) o compose_list(map(i.(i, i+1);L2)) = compose_list(map(i.(i, i+1);L1) @ map(i.(i, i+1);L2)) kk	2 steps