exponent Sections AutomataTheory Doc

Def A == A False

Thm* R:(Alph*Alph*Prop), n:, L:(Alph*), m:. (x:Alph*. R(x,x)) & (x,y:Alph*. R(x,y) R(y,x)) & (x,y,z:Alph*. R(x,y) & R(y,z) R(x,z)) & (x,y,z:Alph*. R(x,y) R((z @ x),z @ y)) & (w:(nAlph*). l:Alph*. i:n. R(l,w(i))) & (v:(mAlph*). l:Alph*. L(l) (i:m. R(l,v(i)))) & Fin(Alph) (x,y:Alph*. Dec(l:Alph*. L(l @ x) = L(l @ y))) auto2_lemma_7

Thm* P:(TProp). (x:T. Dec(P(x))) & Dec(x:T. P(x)) Dec(x:T. P(x)) auto2_lemma_0

In prior sections: core bool 1 int 2 list 1 finite sets list 3 autom