Left-compressed set family

A set family is left-compressed when replacing a member $j$ by a missing smaller element $i<j$ always produces another member. Equivalently, it is fixed by every $\{i\},\{j\}$-compression with $i<j$.