Rank | Theorem | Name |
2 | Thm* L1,L2,L:T List, x:T.
Thm* no_repeats(T;L)  L1 @ [x] L  [x / L2] L  L1 @ [x / L2] L | [append_overlapping_sublists] |
cites the following: |
0 | Thm* k: , f:( k  ). increasing(f;k)  ( x,y: k. x<y  f(x)<f(y)) | [increasing_implies] |
0 | Thm* as,bs:T List. ||as @ bs|| = ||as||+||bs||  | [length_append] |
1 | Thm* as,bs:T List, i: ||as||. (as @ bs)[i] = as[i] | [select_append_front] |
1 | Thm* as,bs:T List, i:{||as||..(||as||+||bs||) }. (as @ bs)[i] = bs[(i-||as||)] | [select_append_back] |