I am reading proof of compactness theorem for sentential logic in Enderton's book, A mathematical introduction to logic.
(Compactness theorem) A set of wffs is satisfiable iff every finite subset is satisfiable.
He wrote a strategy before the proof:
we take our given finitely satisfiable set $\Sigma$ and extend it to a maximal such set $\Delta$,
we utilize $\Delta$ to make a truth assignment that satisfies $\Delta$.
I am struggling to prove that the set $\Delta$ is finitely satisfiable. In this vein, the textbook says:
Furthermore, (3) $\Delta$ is finitely satisfiable. For any finite subset is already a finite subset of some $\Delta$n and hence is satisfiable.
And why did we pick maximal $\Delta$ ? would it be valid in the sense that if some wff Ω has the same two properties that ∆ has and ∆ ⊆ Ω, then Ω = ∆?