Set of Finite Character with Countable Union is Type M

Theorem
Let $S$ be a set of sets of finite character.

Let its union $\bigcup S$ be countable.

Then $S$ is of type $M$.

That is:
 * every element of $S$ is a subset of a maximal element of $S$ under the subset relation.