mb automata 1 Sections GenAutomata Doc

Def P Q == PQ

is mentioned by

Thm* as:(LabelT) List, d:T, x:Label. (x 1of(unzip(as))) apply_alist(as;x;d) = d[apply_alist_non_member]
Thm* as:(LabelT) List, d1,d2:T, x:Label. (x 1of(unzip(as))) apply_alist(as;x;d1) = apply_alist(as;x;d2)[apply_alist_member2]
Thm* as:(LabelT) List, d:T, x:Label. (x 1of(unzip(as))) ( < x,apply_alist(as;x;d) > as)[apply_alist_member]
Thm* (P1 P2) (Q1 Q2) ((P1 Q1) (P2 Q2))[implies_functionality_2]

In prior sections: core well fnd int 1 bool 1 sqequal 1 fun 1 int 2 list 1 prog 1 rel 1 mb basic mb nat union num thy 1 mb list 1 mb label mb collection mb tree mb list 2

Try larger context: GenAutomata

mb automata 1 Sections GenAutomata Doc