(5steps) PrintForm Definitions Lemmas mb automata 1 Sections GenAutomata Doc

At: apply alist member2 2 1

1. T: Type
2. as: (LabelT) List
3. u: LabelT
4. v: (LabelT) List
5. d1,d2:T, x:Label. (x 1of(unzip(v))) apply_alist(v;x;d1) = apply_alist(v;x;d2)
6. d1: T
7. d2: T
8. x: Label
9. (x 1of(unzip([u / v])))
10. 1of(u) = x

apply_alist(v;x;d1) = apply_alist(v;x;d2)

By:
BackThruSomeHyp
THEN
All (Unfold `unzip`)
THEN
All Reduce
THEN
RWW "cons_member" -2
THEN
Analyze -2


Generated subgoal:

15. d1,d2:T, x:Label. (x map(p.1of(p);v)) apply_alist(v;x;d1) = apply_alist(v;x;d2)
6. d1: T
7. d2: T
8. x: Label
9. x = 1of(u)
10. 1of(u) = x
(x map(p.1of(p);v))


About:
productlistconsassertlambdauniverseequalimpliesall

(5steps) PrintForm Definitions Lemmas mb automata 1 Sections GenAutomata Doc