(k-1) List)| ||s|| = k 
& (
x,y:||s||. x < y 
s[x] < s[y]) }
||L||
List
n:.
k-1
n
(G:({s:(n List)| ||s|| = k & (x,y:||s||. x < y s[x] < s[y]) }
||L||).
c:||L||, f:(L[c]n).
increasing(f;L[c])
& (s:L[c] List. ||s|| = k (x,y:||s||. x < y s[x] < s[y]) G(map(f;s)) = c))
(
s.) {s:((k-1) List)| ||s|| = k & (x,y:||s||. x < y s[x] < s[y]) }||L||
| 1 | 4. s: {s:((k-1) List)| ||s|| = k & (x,y:||s||. x < y s[x] < s[y]) } ||L|| | 4 steps |
About:
 |  |  |  |  |  |  |  |
 |  |  |  |  |  |
 |