Step * 1 of Lemma eager_product_map_cons_lemma


1. Top@i
2. as Top@i
3. Top@i
4. Top@i
⊢ eager-product-map(f;[a as];L) eager-map-append(f a;L;eager-product-map(f;as;L))
BY
Try (RW (AddrC [1] (UnfoldC `eager-product-map` ANDTHENC ReduceC)) 0)⋅ }

1
1. Top@i
2. as Top@i
3. Top@i
4. Top@i
⊢ eager-map-append(f a;L;rec-case(as) of
                         [] => []
                         h::t =>
                          r.eager-map-append(f h;L;r)) eager-map-append(f a;L;eager-product-map(f;as;L))


Latex:


Latex:

1.  L  :  Top@i
2.  as  :  Top@i
3.  a  :  Top@i
4.  f  :  Top@i
\mvdash{}  eager-product-map(f;[a  /  as];L)  \msim{}  eager-map-append(f  a;L;eager-product-map(f;as;L))


By


Latex:
Try  (RW  (AddrC  [1]  (UnfoldC  `eager-product-map`  ANDTHENC  ReduceC))  0)\mcdot{}




Home Index