PrintForm Definitions list 3 autom Sections AutomataTheory Doc

At: shorten list 2 2
1. T: Type
2. L: T*
3. La: T*
4. Fin(T)
5. u: T
6. v: T*
7. La':T*. (t:T. mem_f(T;t;v) mem_f(T;t;L) mem_f(T;t;La')) & (t:T. mem_f(T;t;La') mem_f(T;t;v)) & (||La'||1 mem_f(T;hd(La');L))
8. mem_f(T;u;L)

La':T*. (t:T. u = t mem_f(T;t;v) mem_f(T;t;L) mem_f(T;t;La')) & (t:T. mem_f(T;t;La') u = t mem_f(T;t;v)) & (||La'||1 mem_f(T;hd(La');L))
By:
Thin 7
THEN
InstConcl [u.v]
THEN
Reduce 0
Generated subgoal:

17. mem_f(T;u;L)
8. t: T
9. u = t mem_f(T;t;v)
mem_f(T;t;L) u = t mem_f(T;t;v)

About:
existslistandallimplies
orequalnatural_numberconsuniverse