Finitely Satisfiable Theory has Maximal Finitely Satisfiable Extension/Proof 1

Proof
The set of all finitely satisfiable $\LL$-theories containing $T$ forms an ordered set using subset inclusion as the ordering.

Let $C$ be a nonempty chain in this ordered set.

Let $\ds T_C = \bigcup_{\Sigma \mathop \in C} \Sigma$.

Let $\Delta$ be a finite subset of $T_C$.

Then there exists a single $\Sigma$ in $C$ which contains $\Delta$.

Since this $\Sigma$ is finitely satisfiable by definition, this means that $\Delta$ is satisfiable.

Hence $T_C$ is finitely satisfiable.

Since each $\Sigma \in C$ is contained in $T_C$, this means that $T_C$ is an upper bound for $C$ in the ordered set.

Thus, by Zorn's Lemma, there is a finitely satisfiable $\LL$-theory $T'$ containing $T$ such that $T'$ contains all other such theories.

Let $\phi$ be an $\LL$-sentence.

Let $\phi \nsubseteq T'$.

$T' \cup \set \phi$ were finitely satisfiable.

Then by definition of $T'$, $T'$ would contain $T' \cup \set \phi$ as a subset.

This would mean that $T'$ contains $\phi$, which contradicts the assumption.

Thus $T' \cup \set \phi$ is not finitely satisfiable.

By the lemma, $T' \cup \set {\neg \phi}$ is finitely satisfiable.

Thus, by definition of $T'$, $T'$ contains $T' \cup \set {\neg \phi}$ as a subset.

Hence $T'$ contains $\neg \phi$.