increasing(
x.x;L[i])x.x;L[i]) 
s:
L[i] List. ||s|| = k 
(x,y:||s||. x < y s[x] < s[y]) G(map(x.x;s)) = i
List
||L||
n
n List)| ||s|| = k & (x,y:||s||. x < y s[x] < s[y]) }
||L||
increasing(x.x;L[i]) & (s:L[i] List. ||s|| = k (x,y:||s||. x < y s[x] < s[y]) G(map(x.x;s)) = i)
| 1 | increasing(x.x;L[i]) | 1 step |
| 2 | 8. increasing(x.x;L[i]) s:L[i] List. ||s|| = k (x,y:||s||. x < y s[x] < s[y]) G(map(x.x;s)) = i | 3 steps |
About:
 |  |  |  |  |  |
 |  |  |  |  |
 |