Nuprl - Proof: length less 2

(13steps total) PrintForm Definitions Lemmas graph 1 1 Sections Graphs Doc

At: length less 2

1. T: Type
2. A: T List
3. B: T List
4. no_repeats(T;A)
5. x:T. (x A) (x B)
6. x: T
7. (x A)
8. i:
9. i < ||B||
10. x = B[i]
11. k:||A||. j:||B||. A[k] = B[j] & j = i

||A|| < ||B||

By: Assert (||A||||B||-1) THEN BackThru Thm* k,m:. (f:(km). Inj(k; m; f)) km

Generated subgoal:

1 f:(||A||(||B||-1)). Inj(||A||; (||B||-1); f) 6 steps

About:

(13steps total) PrintForm Definitions Lemmas graph 1 1 Sections Graphs Doc