Finitely Satisfiable Theory has Maximal Finitely Satisfiable Extension/Lemma

Theorem
Let $T$ be a finitely satisfiable $\LL$-theory.

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

Then either $T \cup \set \phi$ or $T \cup \set {\neg \phi}$ is finitely satisfiable.

Proof
, suppose that $\phi \notin T$.

that $T \cup \set \phi$ is not finitely satisfiable.

Then by definition there must be a finite subset $K$ of $T \cup \set \phi$ which is not satisfiable.

Since $T$ is finitely satisfiable, $\phi \in K$.

Therefore $\Delta = K \setminus \set \phi$ is a finite subset of $T$ such that $\Delta \models \neg \phi$.

Let $\Sigma$ be a finite subset of $T$.

Since $\Delta \cup \Sigma$ is a finite subset of $T$, it is satisfiable.

But $\Delta \models \neg \phi$.

Hence $\set {\neg \phi} \cup \Sigma$ is satisfiable.

But any finite subset of $T \cup \set {\neg \phi}$ is either in $T$ or of the form $\Sigma \cup \set {\neg \phi}$.

This demonstrates that $T \cup \set {\neg \phi}$ is finitely satisfiable.