PrintForm Definitions det automata Sections AutomataTheory Doc

At: reach lemma 1 1 2 2 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)

0nn (RLa:S.car*. (i:{1..1}, a:Alph. si = S.act(a,[si][i]) False mem_f(S.car;S.act(a,[si][i]);RLa)) & (a:Alph. g(a) < 0 si = S.act(a,si) False mem_f(S.car;S.act(a,si);RLa)) & (s:S.car. mem_f(S.car;s;RLa) (w:Alph*. (S:wsi) = s)))
By:
Analyze 0
THEN
InstConcl [nil]
Generated subgoal:

19. 0nn
10. s: S.car
11. mem_f(S.car;s;nil)
w:Alph*. (S:wsi) = s

About:
impliesnatural_numberexistslistandallorequal
applyconsnilfalseless_thanuniversefunction