PrintForm Definitions det automata Sections AutomataTheory Doc

At: reach lemma 1 1 2 2 2 1 2
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. k:
10. 0 < k
11. knn
12. RLa: S.car*
13. i:{1..1}, a:Alph. si = S.act(a,[si][i]) False mem_f(S.car;S.act(a,[si][i]);RLa)
14. a:Alph. g(a) < k-1 si = S.act(a,si) False mem_f(S.car;S.act(a,si);RLa)
15. s:S.car. mem_f(S.car;s;RLa) (w:Alph*. (S:wsi) = s)
16. s: S.car
17. mem_f(S.car;s;S.act(f(k-1),si).RLa)

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

117. S.act(f(k-1),si) = s
w:Alph*. (S:wsi) = s
217. mem_f(S.car;s;RLa)
w:Alph*. (S:wsi) = s

About:
existslistequaluniversefunctionnatural_numberintless_than
allorapplyconsnilfalseimpliessubtract