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

At: length less 1 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||
12. (A[k] B)
j:||B||. A[k] = B[j] & j = i

By:
Analyze -1
THEN
ExRepD
THEN
InstConcl [i1]


Generated subgoal:

112. i1:
13. i1 < ||B||
14. A[k] = B[i1]
i1 = i
2 steps

About:
listintnatural_numberless_thanuniverseequalimpliesandallexists

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