PrintForm Definitions myhill nerode Sections AutomataTheory Doc

At: back listify 1 1 2 1 1 2 2

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: (||v||+1)
15. 1of(( < u1,u2 > .v)[i]) = t & mem_f(S.car;s;2of(( < u1,u2 > .v)[i]))
16. i = 0

u1 = t mem_f(S.car;t;BL)

By:
Unfold `select` -2
THEN
RecUnfold `nth_tl` -2
THEN
MoveToConcl -2
THEN
SplitOnConclITE
THEN
Reduce 0
THEN
Try (Fold `select` 0)


Generated subgoal:

115. i = 0
16. 0 < i
17. 1of(v[(i-1)]) = t
18. mem_f(S.car;s;2of(v[(i-1)]))
u1 = t mem_f(S.car;t;BL)


About:
orequaluniverselistproductallexists
natural_numberandaddconspairint