Example 17.2.5. The family of finite posets is elementary.

Proof

The pushout category \(\pushout\) is a finite poset. Opposites preserve finite posets. For a finite poset \(P\), the objects of \(\Tw(P)\) form a decidable subobject of \(P^\simeq\times P^\simeq\), and the order on \(\Tw(P)\) is decidable. Filtering the product of two finite enumerations therefore shows that \(\Tw(P)\) is a finite poset. Finally, each \(P(x,y)\) is a decidable proposition, hence is either empty or terminal and so is a finite poset.

From Section 17.2, Small subuniverses.