PrintForm Definitions myhill nerode Sections AutomataTheory Doc

At: back listify 1 1 2 1 2 2 1
1. Alph: Type
2. S: ActionSet(Alph)
3. s: S.car
4. Fin(Alph)
5. Fin(S.car)
6. LL: (S.carS.car*)*
7. u1: S.car
8. u2: S.car*
9. v: (S.carS.car*)*
10. BL: S.car*
11. t:S.car. mem_f(S.car;t;BL) (i:||v||. 1of(v[i]) = t & mem_f(S.car;s;2of(v[i])))
12. mem_f(S.car;s;u2)
13. t: S.car
14. i: || < u1,u2 > .v||
15. 0 < i
16. 1of(hd(nth_tl(i-1;v))) = t
17. mem_f(S.car;s;2of(hd(nth_tl(i-1;v))))

mem_f(S.car;t;BL)
By:
Fold `select` -1
THEN
Fold `select` -2
THEN
BackThru 11
Generated subgoal:

116. 1of(v[(i-1)]) = t
17. mem_f(S.car;s;2of(v[(i-1)]))
i:||v||. 1of(v[i]) = t & mem_f(S.car;s;2of(v[i]))

About:
universelistproductallexistsnatural_number
andequalconspairless_thansubtract