Colexicographic order

For equal-size finite subsets $A$ and $B$, $A$ precedes $B$ in colexicographic order when the largest element of their symmetric difference belongs to $B$.

The first $a$ sets of a fixed size in colexicographic order form a colexicographic initial segment. Its lower shadow is again a colexicographic initial segment at the next smaller size.