Nuprl - Pf append is member lemma 1 2 2 1 1 1 2

(24steps) PrintForm Definitions list 3 jlc Sections Support(jlc) Doc

At: append is member lemma 1 2 2 1 1 1 2

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))

M,N:T List. v = (M @ (x.N))

By: ApFunToHypEquands `X' (Case of X; nil nil ; h.t t) (T List) 16

Generated subgoal:

1 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))

About:

(24steps) PrintForm Definitions list 3 jlc Sections Support(jlc) Doc