PrintForm Definitions nfa 1 Sections AutomataTheory Doc

At: nd auto eq auto 1 1 2 1 1 1 1 1 2 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. g:((St)). t:(St). (f.s:St. f(s) & F(NDA)(s))(t) g(t)

DA:Automata(Alph;St). L(NDA) = LangOf(DA)
By: Analyze 10
Generated subgoal:

110. g1: (St)
11. t:(St). (f.s:St. f(s) & F(NDA)(s))(t) g1(t)
DA:Automata(Alph;St). L(NDA) = LangOf(DA)

About:
existsfunctionbooluniverseall
applyequalassertandlambda