PrintForm Definitions nfa 1 Sections AutomataTheory Doc

At: nd auto eq auto 1 1 2 1 1 1
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). t:St. (y.I(NDA) = y)(t) g(t)

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

17. g:(St). t:St. I(NDA) = t g(t)
DA:Automata(Alph;St). L(NDA) = LangOf(DA)

About:
existsfunctionbooluniverseall
applyequallambdaassert