Let be a set of formulae in a language and be a formula in If then Proof (NONEXAMINABLE) WLOG is a Theory and is a Sentence Since we have i.e. has no Model. By Model Existence Lemma, is Inconsistent: By the Deduction Theorem Add the lines