PrintForm Definitions myhill nerode Sections AutomataTheory Doc

At: back listify 1 2 1 1 1 2 1 1
1. Alph: Type
2. S: ActionSet(Alph)
3. s: S.car
4. n:
5. f: nAlph
6. Bij(n; Alph; f)
7. n1:
8. f1: n1S.car
9. b:S.car. a:n1. f1(a) = b
10. BL: S.car*
11. t: S.car
12. a: Alph
13. S.act(a,t) = s
14. a1: n1
15. f1(a1) = t

i:||(x. < f1(x),(y.S.act(f(y),f1(x)))[n] > )[n1]||. f1(i) = t & mem_f(S.car;s;(y.S.act(f(y),f1(i)))[n])
By:
InstConcl [a1]
THEN
RWH (HypC -1) 0
Generated subgoal:

1 mem_f(S.car;s;(y.S.act(f(y),t))[n])

About:
existsnatural_numberlambdapairapplyand
equaluniversefunctionalllist