Logic Negating Statements These tie back to DeMorgan’s Laws Example ∼(∀x∈X,P(x))=∃x∈X,∼P(x) ∼(∃x∈X,P(x))=∀x∈X,∼P(x) In words this would be: It is not the case that P(x) is true for all Natural Numbers x.