Power Set is Lattice

Theorem
Let $S$ be a set.

Let $\left({\mathcal P \left({S}\right), \subseteq}\right)$ be the relational structure defined on $\mathcal P \left({S}\right)$ by the relation $\subseteq$.

Then $\left({\mathcal P \left({S}\right), \subseteq}\right)$ is a lattice.

Proof
From Subset Relation on Power Set is Partial Ordering, we have that $\subseteq$ is a partial ordering.

Let $X, Y \in \mathcal P \left({S}\right)$.

Then:
 * From Union Smallest:
 * $X \subseteq T, Y \subseteq T \iff X \cup Y \subseteq T$


 * From Intersection Largest:
 * $X \subseteq T, Y \subseteq T \iff T \subseteq X \cap Y$

So $X \cap Y$ is the infimum and $X \cup Y$ is the supremum of $\left\{{X, Y}\right\}$.

Hence by definition $\mathcal P \left({S}\right)$ is a lattice.

Also see

 * Power Set is Complete Lattice