Let $E, F \in \mathsf{Max}$ such that $E \subseteq F$. Denote $n : = \max(E)$ and $m : = \max(F)$. Now $x \preceq n$ for every $x \in E$ and $y \preceq m$ for every $y \in F$. Since $E$ is contained in $F$, then particularly $x \preceq m$ for every $x \in E$. Since $n \in E$, this implies that $n \preceq m$. $\square$