Finite Infima Set and Upper Closure is Smallest Filter

Theorem
Let $L = \left({S, \wedge, \preceq}\right)$ be a meet semilattice.

Let $X$ be a non-empty subset of $S$.

Then
 * $X \subseteq {\operatorname{fininfs}\left({X}\right)}^\succeq$ and
 * for every a filter $F$ in $L$: $\left({X \subseteq F \implies {\operatorname{fininfs}\left({X}\right)}^\succeq \subseteq F}\right)$

where
 * $\operatorname{fininfs}\left({X}\right)$ denotes the finite infima set of $X$,
 * $X^\succeq$ denotes the upper closure of $X$.

Proof
By Set is Subset of Finite Infima Set:
 * $X \subseteq \operatorname{fininfs}\left({X}\right)$

By Upper Closure of Subset is Subset of Upper Closure:
 * $X^\succeq \subseteq {\operatorname{fininfs}\left({X}\right)}^\succeq$

By Set is Subset of Upper Closure:
 * $X \subseteq X^\succeq$

Thus by Subset Relation is Transitive:
 * $X \subseteq {\operatorname{fininfs}\left({X}\right)}^\succeq$

Let $F$ be a filter in $L$ such that
 * $X \subseteq F$