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

At: apply alist member 2 1

1. T: Type
2. as: (LabelT) List
3. u: LabelT
4. v: (LabelT) List
5. d:T, x:Label. (x map(p.1of(p);v)) ( < x,apply_alist(v;x;d) > v)
6. d: T
7. x: Label
8. x = 1of(u) (x map(p.1of(p);v))

< x,apply_alist([u / v];x;d) > = u ( < x,apply_alist([u / v];x;d) > v)

By:
Inst Thm* as:(LabelT) List, p:(LabelT), l:Label, d:T. apply_alist([p / as];l;d) ~ if 1of(p) = l 2of(p) else apply_alist(as;l;d) fi [T;v;u;x;d]
THEN
HypSubst -1 0


Generated subgoal:

19. apply_alist([u / v];x;d) ~ if 1of(u) = x 2of(u) else apply_alist(v;x;d) fi
< x,if 1of(u) = x 2of(u) else apply_alist(v;x;d) fi > = u ( < x,if 1of(u) = x 2of(u) else apply_alist(v;x;d) fi > v)


About:
pairproductlistconsifthenelse
lambdauniverseequalimpliesorall

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