A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.
To negate a quantified statement, swap the quantifier and negate the predicate: the negation of 'For all x, P(x)' is 'There exists x such that not P(x)', and vice versa. This transformation is essential for proof by contradiction and contrapositive, making it one of the most practically useful logical rules.
From your study of predicates and quantifiers, you know that "for all x, P(x)" claims P(x) is true for every element x in the domain, while "there exists x such that P(x)" claims P(x) holds for at least one x. Now ask: when are these statements false? "For all x, P(x)" fails the moment a single x makes P(x) false — and finding that one counterexample is precisely what the existential quantifier asserts. So the negation of ∀x P(x) is ∃x ¬P(x). By the same reasoning, ∃x P(x) is false when P(x) fails for every x — so its negation is ∀x ¬P(x). Each quantifier flips, and the predicate negates.
The rule extends mechanically to nested quantifiers, which is where it becomes most powerful. Work from the outermost quantifier inward, flipping each one, and place ¬ in front of the innermost predicate. The negation of "for all ε > 0, there exists δ > 0 such that |x − a| < δ implies |f(x) − L| < ε" is "there exists ε > 0 such that for all δ > 0, there exists x with |x − a| < δ and |f(x) − L| ≥ ε." Every quantifier flips; the predicate negates; nothing else changes. This is not interpretation — it is a syntactic rule that can be applied without understanding the mathematical content.
Concrete examples anchor the rule. "Every student passed" (∀x, Passed(x)) has negation "some student did not pass" (∃x, ¬Passed(x)) — not "no student passed," which would be an overcorrection. "There exists a prime greater than 100" (∃x, Prime(x) ∧ x > 100) has negation "for all x, x is not prime or x ≤ 100" (∀x, ¬Prime(x) ∨ x ≤ 100). These examples show why swapping the quantifier is correct: to disprove universality you need only one failure; to disprove existence you must defeat every candidate.
The practical payoff appears immediately in proof by contradiction and proof by contrapositive. In a contradiction proof, you assume the negation of your goal and derive a contradiction. If your goal is a universally quantified statement, its negation gives you an existential — a specific witness with a specific property to work with. If your goal is existential, the negation gives you a universal — a property you can apply freely to any object. Negation of quantifiers is what converts the statement you are trying to prove into the kind of hypothesis you can actually use. Without this transformation, setting up contradiction and contrapositive proofs would require guesswork; with it, the setup is a mechanical step.