Thms nfa 1 Sections AutomataTheory Doc

NDA_init Def I(n) == 1of(2of(n))

Thm* Alph,States:Type, n:NDA(Alph;States). I(n) States

pi2 Def 2of(t) == t.2

Thm* A:Type, B:(AType), p:a:AB(a). 2of(p) B(1of(p))

pi1 Def 1of(t) == t.1

Thm* A:Type, B:(AType), p:a:AB(a). 1of(p) A

About:
!abstractionspreadalluniversefunctionproductmember