PrintForm Definitions myhill nerode Sections AutomataTheory Doc

At: total back listify 1 1 2 2 2 1 2 2

1. Alph: Type
2. S: ActionSet(Alph)
3. sL: S.car*
4. Fin(Alph)
5. Fin(S.car)
6. n:
7. 0 < n
8. TBL: S.car*
9. ||TBL|| = n-1
10. i:||TBL||, j:i. TBL[i] = TBL[j]
11. s:S.car. mem_f(S.car;s;TBL) (w:Alph*. mem_f(S.car;(S:ws);sL))
12. AL: S.car*
13. u: S.car
14. v: S.car*
15. s:S.car. u = s mem_f(S.car;s;v) (w:Alph*. mem_f(S.car;(S:ws);sL))
16. s:S.car. mem_f(S.car;s;sL) mem_f(S.car;s;TBL) u = s mem_f(S.car;s;v)
17. s:S.car, a:Alph. mem_f(S.car;S.act(a,s);TBL) mem_f(S.car;s;TBL) u = s mem_f(S.car;s;v)
18. mem_f(S.car;u;TBL)
19. s: S.car
20. a: Alph
21. mem_f(S.car;S.act(a,s);TBL)

mem_f(S.car;s;TBL) mem_f(S.car;s;v)

By:
FwdThru 17 [-1]
THEN
GenExRepD
THEN
Try ProveProp


Generated subgoal:

122. u = s
mem_f(S.car;s;TBL) mem_f(S.car;s;v)


About:
oruniverselistintless_thannatural_number
equalsubtractallimpliesexistsapply