Non-Empty Set of Type M has Maximal Element

Theorem
Let $S$ be a non-empty set of setswhich is of type M.

Then $S$ has a maximal element under the subset relation.

Proof
Let $S$ be a non-empty set type M set.

Let $x \in S$ be arbitrary.

Then by definition $x$ is a subset of a maximal element of $S$ under the subset relation.

Hence there has to actually be such a maximal element of $S$ for $x$ to be a subset of.