PrintForm Definitions myhill nerode Sections AutomataTheory Doc

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

u1 = t mem_f(S.car;t;BL)
By:
Analyze -1
THEN
Decide (i = 0)
Generated subgoals:

114. 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)
214. 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)

About:
orequalintnatural_numberuniverselistproduct
allexistsandaddconspair