PrintForm Definitions myhill nerode Sections AutomataTheory Doc

At: bool listify 1 1 1 2
1. T: Type
2. f: T
3. n:
4. f1: nT
5. Bij(n; T; f1)
6. k:
7. 0 < k
8. k-1n (fL:T*. (t:T. mem_f(T;t;fL) f(t)) & (i:(k-1). f(f1(i)) mem_f(T;f1(i);fL)))

kn (fL:T*. (t:T. mem_f(T;t;fL) f(t)) & (i:k. f(f1(i)) mem_f(T;f1(i);fL)))
By:
Analyze 0
THEN
Analyze -2
THEN
Analyze -1
THEN
Analyze -1
Generated subgoal:

18. kn
9. fL: T*
10. t:T. mem_f(T;t;fL) f(t)
11. i:(k-1). f(f1(i)) mem_f(T;f1(i);fL)
fL:T*. (t:T. mem_f(T;t;fL) f(t)) & (i:k. f(f1(i)) mem_f(T;f1(i);fL))

About:
impliesexistslistandallassertapply
natural_numberuniversefunctionboolintless_thansubtract