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

At: apply alist property 1 1

1. T: Type
2. as: (LabelT) List
3. d: T
4. x: Label
5. i:
6. i < ||as|| & (first a as s.t. (p.1of(p) = x)(a) else < x,d > ) = as[i]

i < ||2of(unzip(as))|| & 2of((first p as s.t. 1of(p) = x else < x,d > )) = 2of(unzip(as))[i]

By:
Unfold `unzip` 0
THEN
Reduce 0
THEN
ExRepD


Generated subgoals:

16. i < ||as||
7. (first a as s.t. (p.1of(p) = x)(a) else < x,d > ) = as[i]
i < ||map(p.2of(p);as)||
26. i < ||as||
7. (first a as s.t. (p.1of(p) = x)(a) else < x,d > ) = as[i]
2of((first p as s.t. 1of(p) = x else < x,d > )) = map(p.2of(p);as)[i]


About:
pairproductlistless_thanlambdauniverseequal

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