i,j:
. i < ||l|| 
j < ||l|| 
i = j l[i] = l[j] 
TT:Type, l:T List. no_repeats(T;l) Prop == {i:
| 0
i } Type
j
[i / upto(i+1;j)] else nil fi (recursive)i,j:. upto(i;j) {i..j
} List| Some definitions of interest. | |
| no_repeats | Def no_repeats(T;l) == i,j:. i < ||l|| j < ||l|| i = j l[i] = l[j] T |
| Thm* T:Type, l:T List. no_repeats(T;l) Prop | |
| nat | Def == {i:| 0i } |
| Thm* Type | |
| upto | Def upto(i;j) == if i < j [i / upto(i+1;j)] else nil fi (recursive) |
| Thm* i,j:. upto(i;j) {i..j} List |
About:
 |  |  |  |  |  |  |  |  |
 |  |  |  |  |  |  |  |