 Notice that \(\Gamma \vDash \theta\) if and only if the set \(\Gamma,\neg \theta\) is not satisfiable. It follows that if a set \(\Gamma\) is not satisfiable, then if \(\theta\) is any sentence, \(\Gamma \vDash \theta\). This is a model-theoretic counterpart to ex falso quodlibet (see Theorem 10). We have the following, as an analogue to Theorem 12: