Negating Quantified Statements
What You'll Learn
You'll learn how negation flips universal statements into existential ones and vice versa, following the logical equivalences ¬∀x P(x) ≡ ∃x ¬P(x) and ¬∃x P(x) ≡ ∀x ¬P(x).
The Core Idea
When you negate a quantified statement, the quantifier switches and the predicate gets negated.
Negating a Universal Statement:
- Original: "All students passed the exam" → ∀x P(x)
- Negation: "Not all students passed" means "At least one student did not pass" → ∃x ¬P(x)
- Formally: ¬∀x P(x) ≡ ∃x ¬P(x)
Negating an Existential Statement:
- Original: "There exists a prime number that is even" → ∃x E(x)
- Negation: "There does not exist an even prime" means "All primes are not even" → ∀x ¬E(x)
- Formally: ¬∃x E(x) ≡ ∀x ¬E(x)
Why This Makes Sense
Think of it this way: to disprove "everyone likes pizza" (∀x P(x)), you only need one counterexample—one person who doesn't like it (∃x ¬P(x)). Conversely, to disprove "someone can fly unaided" (∃x F(x)), you must show that every single person cannot fly (∀x ¬F(x)).
Examples
- ¬∀x (x > 0) becomes ∃x (x ≤ 0) — "Not all numbers are positive" = "Some number is non-positive"
- ¬∃x (x² < 0) becomes ∀x (x² ≥ 0) — "No number has a negative square" = "All numbers have non-negative squares"
Why It Matters
This rule is fundamental in writing precise mathematical proofs, especially proof by contradiction and disproving conjectures. It lets you correctly state what it means for a quantified claim to be false.
Key Takeaway: Negating a quantified statement switches the quantifier (∀ ↔ ∃) and negates the predicate: ¬∀x P(x) ≡ ∃x ¬P(x) and ¬∃x P(x) ≡ ∀x ¬P(x).