Lemma A.5. A partially ordered set \(P\) is \(\kappa \)-filtered if and only if every subset \(S \subseteq P\) of cardinality \(< \kappa \) admits an upper bound in \(P\). In particular, \(P\) is filtered if and only if it is non-empty and every two elements admit a common upper bound.
Proof.
Suppose \(P\) is \(\kappa \)-filtered and let \(S \subseteq P\) have cardinality \(< \kappa \). Regarding \(S\) as a discrete category, the inclusion \(S \to P\) is a \(\kappa \)-small diagram, and a cocone on it is precisely an upper bound of \(S\).
Conversely, let \(F\colon K \to P\) be a functor with \(K\) \(\kappa \)-small. Then \(K\) has fewer than \(\kappa \) objects up to equivalence, so the image \(S\) of \(F\) on objects has cardinality \(< \kappa \). Choose an upper bound \(u\) of \(S\). Since \(\Fun (K,P)\) is again a partially ordered set, in which \(F \leq G\) if and only if \(F(k) \leq G(k)\) for all \(k\), there is a (unique) natural transformation from \(F\) to the constant functor with value \(u\), i.e. a cocone on \(F\).
For the last statement, note that every finite subset of \(P\) has an upper bound if and only if \(P\) is non-empty and every two elements have an upper bound, by induction on the size of the subset. □