l) == 
i:
. i < ||l|| & x = l[i] T
T:Type, x:T, l:T List. (x l) Prop
L2 == f:(||L1||
||L2||). increasing(f;||L1||) & (j:||L1||. L1[j] = L2[(f(j))] T)T:Type, L1,L2:T List. L1 L2 Prop| Some definitions of interest. | |
| l_member | Def (x l) == i:. i < ||l|| & x = l[i] T |
| Thm* T:Type, x:T, l:T List. (x l) Prop | |
| sublist | Def L1 L2 == f:(||L1||||L2||). increasing(f;||L1||) & (j:||L1||. L1[j] = L2[(f(j))] T) |
| Thm* T:Type, L1,L2:T List. L1 L2 Prop |
About:
 |  |  |  |  |  |  |
 |  |  |  |  |  |