PrintForm Definitions automata 7 Sections AutomataTheory Doc

At: empty lang dec 1 1 1 1 1

1. Alph: Type
2. St: Type
3. Auto: Automata(Alph;St)
4. Fin(Alph)
5. n:
6. f:(nSt). Bij(n; St; f)

(l:Alph*. LangOf(Auto)(l)) (k:(n+1), l:{l:(Alph*)| ||l|| = k }. LangOf(Auto)(l))

By:
Unfold `auto_lang` 0
THEN
Reduce 0


Generated subgoal:

1 (l:Alph*. Auto(l)) (k:(n+1), l:{l:(Alph*)| ||l|| = k }. Auto(l))


About:
impliesexistslistapplynatural_numberadd
setequalintuniversefunctionassert