Consistent Set of Formulas can be Extended to Maximal Consistent Set

Theorem
Let $\FF$ be a collection of consistent logical formulas.

Then $\FF$ can be extended to (that is, is a subset of) a maximal consistent set of formulas.