Q == (P 
Q) & (P Q)
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_8
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,Q:(TProp). (t:T. P(t) Q(t)) ({t:T| P(t) } ~ {t:T| Q(t) })
auto2_lemma_1
In prior sections: core fun 1 well fnd int 1 bool 1 int 2 list 1 finite sets list 3 autom