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

At: length less 1 2 1 1
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. i:
8. i < ||B||
9. x = B[i]
10. k: ||A||
11. i1:
12. i1 < ||B||
13. A[k] = B[i1]
14. i1 = i
x = A[k]
By: Obvious
Generated subgoals:

None

About:
listintnatural_numberless_thanuniverseequalimpliesall

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