exponent Sections AutomataTheory Doc

Def A ~ B == f:(AB), g:(BA). InvFuns(A; B; f; g)

Thm* q:. (q*) ~ list_1_1_nat

Thm* P,Q:(TProp). (t:T. P(t) Q(t)) ({t:T| P(t) } ~ {t:T| Q(t) }) auto2_lemma_1

In prior sections: fun 1 finite sets