Logical Consequence with Union
From ProofWiki
Theorem
Let $U$ be a set of logical formulas.
Let $P$ be a logical formula.
Let $U \models P$ denote that $U$ is a logical consequence $P$.
Then:
- $U \models P$
iff:
- $U \cup P \models P$
Proof
First we note that, from the Law of Identity:
- $P \models P$
Suppose $U \models P$.
So we have:
- $U \models P$
- $P \models P$
So by definition of model:
- $U \cup P \models P$
It also follows that if $U \cup P \models P$, then:
- $U \models P$
- $P \models P$
Thus we have shown that $U \models P$ iff $U \cup P \models P$.
$\blacksquare$