At:
append is member lemma12211121
1.
T: Type
2.
eq: {T=}
3.
eq TT
4.
x,y:T. eq(x,y) x = y
5.
L: T List
6.
x: T
7.
u: T
8.
v: T List
9.
(M,N:T List. v = (M @ (x.N))) x(eq) v
10.
eq(x,u) = false
11.
M: T List
12.
N: T List
13.
u1: T
14.
v1: T List
15.
u.v = (v1 @ (x.N)) (M,N:T List. v = (M @ (x.N)))
16.
u.v = u1.(v1 @ (x.N))
17.
(Case of u.v; nil nil ; h.t t) = (Case of u1.(v1 @ (x.N)); nil nil ; h.t t) T List
M,N:T List. v = (M @ (x.N))
By:
Analyze -1
THEN
Reduce 0
Generated subgoal: