Nuprl - Pf discrete list 1 1 2 2 2 1 1 2 1 1 1 1

(44steps) PrintForm Definitions Lemmas list 3 jlc Sections Support(jlc) Doc

At: discrete list 1 1 2 2 2 1 1 2 1 1 1 1

1. T: Type
2. Discrete{T}
3. x: T List
4. u: T
5. v: T List
6. y: T List
7. u1: T
8. v1: T List
9. u.v = v1
10. v = v1
11. f: TT
12. f(u,u1) u = u1
13. f(u,u1)
14. u.v = u1.v1

False

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

Generated subgoal:

1 15. (Case of u.v; nil nil ; h.t t) = (Case of u1.v1; nil nil ; h.t t) T List
False

About:

(44steps) PrintForm Definitions Lemmas list 3 jlc Sections Support(jlc) Doc