A family has distinct representatives exactly when every subfamily collectively contains enough possible representatives. A small computation will anchor the general statement before the abstraction takes over.
Definitions first
A finite poset \((P,\le)\) has intervals \([x,y]\) and an incidence algebra. Chains, antichains, and order ideals reveal different slices of its comparability structure.
The first display fixes the mathematical data. I label it \(\mathsf{data}\) mentally, while the next is the \(\mathsf{claim}\); the bridge between them is the displayed \(\Longrightarrow\), not an automatic implication.
A small case in full
The following line is the smallest calculation that still exercises the mechanism. It keeps nested delimiters and the order of operations explicit.
The reusable statement
A good test for understanding is to change the presentation while keeping the invariant fixed. The aligned form makes that comparison unusually easy.
A nearby false statement
Width and height refer to antichains and chains in the poset, not to geometric dimensions of a drawing.
This is enough machinery for one note: an exact object, a worked case, a structural law, and a clearly marked boundary. Each layer can now be tested independently.