Unions and intersections of downward-closed sets make the order ideals of a poset into a distributive lattice. I will separate the object being defined from the consequence being claimed.
Statement
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.
Worked algebra
A worked instance is useful here because it exposes every index that the compressed statement hides.
Conceptual compression
The abstraction earns its keep by explaining why the same computation reappears. The notation compresses repeated reasoning without erasing the hypothesis that licenses it.
Caveat
Width and height refer to antichains and chains in the poset, not to geometric dimensions of a drawing.
The notation is dense, but it is doing honest work: every delimiter records scope and every index records dependence. Removing one should require a mathematical reason.