(2steps total) PrintForm Definitions graph 1 1 Sections Graphs Doc

At: no repeats inj

T:Type, s:T List. no_repeats(T;s) (f:(||s||T). Inj(||s||; T; f))

By:
Unfolds [`inject`;`no_repeats`] 0
THEN
InstConcl [i.s[i]]
THEN
Reduce 0
THEN
SupposeNot


Generated subgoal:

11. T: Type
2. s: T List
3. i,j:. i < ||s|| j < ||s|| i = j s[i] = s[j]
4. a1: ||s||
5. a2: ||s||
6. s[a1] = s[a2]
7. a1 = a2
a1 = a2
1 step

About:
listnatural_numberlambdafunctionuniverseequalimpliesallexists

(2steps total) PrintForm Definitions graph 1 1 Sections Graphs Doc