PrintForm Definitions det automata Sections AutomataTheory Doc

At: reach lemma 1 1 2 2 1 1
1. Alph: Type
2. S: ActionSet(Alph)
3. si: S.car
4. nn:
5. f: nnAlph
6. g: Alphnn
7. Fin(S.car)
8. InvFuns(nn; Alph; f; g)
9. 0nn
10. s: S.car
11. mem_f(S.car;s;nil)

w:Alph*. (S:wsi) = s
By: Reduce -1
Generated subgoals:

None

About:
existslistequaluniversefunctionnatural_numbernil