PrintForm Definitions nfa 1 Sections AutomataTheory Doc

At: nd auto eq auto 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))

DA:Automata(Alph;St). L(NDA) = LangOf(DA)
By: Inst Thm* Fin(T) (x,y:T. Dec(x = y)) [St]
Generated subgoal:

16. x,y:St. Dec(x = y)
DA:Automata(Alph;St). L(NDA) = LangOf(DA)

About:
existsfunctionbooluniverseallapply