PrintForm Definitions nfa 1 Sections AutomataTheory Doc

At: nd auto eq auto 1 1 2 1 1 1 1 1 2 2 1 1 2
1. Alph: Type
2. St: Type
3. NDA: NDA(Alph;St)
4. Fin(St)
5. x,y:St, a:Alph. Dec(NDA(x,a,y))
6. y:St. Dec(I(NDA) = y)
7. g: St
8. t:St. I(NDA) = t g(t)
9. f:(St). Dec(s:St. f(s) & F(NDA)(s))
10. g1: (St)
11. t:(St). (s:St. t(s) & F(NDA)(s)) g1(t)
12. f:(St), a:Alph, y:St. Dec(s:St. f(s) & NDA(s,a,y))

DA:Automata(Alph;St). L(NDA) = LangOf(DA)
By: Inst Thm* f:(TProp). (t:T. Dec(f(t))) (g:(T). t:T. f(t) g(t)) [(St)AlphSt;t.s:St. 1of(t)(s) & NDA(s,1of(2of(t)),2of(2of(t)))]
Generated subgoals:

1 t:((St)AlphSt). Dec((t.s:St. 1of(t)(s) & NDA(s,1of(2of(t)),2of(2of(t))))(t))
213. g:((St)AlphSt). t:((St)AlphSt). (t.s:St. 1of(t)(s) & NDA(s,1of(2of(t)),2of(2of(t))))(t) g(t)
DA:Automata(Alph;St). L(NDA) = LangOf(DA)

About:
existsfunctionboolproductlambdaand
assertapplyuniverseallequal