 Theorem 13. The Lindenbaum Lemma. Let \(\Gamma\) be any consistent set of sentences of \(\LKe .\) Then there is a set \(\Gamma'\) of sentences of \(\LKe\) such that \(\Gamma \subseteq \Gamma'\) and \(\Gamma'\) is maximally consistent.