 Applying the Lindenbaum Lemma (Theorem 13), let \(\Gamma''\) be a maximally consistent set of sentences (of the expanded language) that contains \(\Gamma'\). So, of course, \(\Gamma''\) contains \(\Gamma\). We can now define an interpretation \(M\) such that \(M\) satisfies every member of \(\Gamma''\).