In every JEE paper there is at least one question of the form "the negation of 'all prime numbers are odd' is ..." and a student, under pressure, writes "all prime numbers are not odd." That answer is wrong. It is also diagnostic — it means the student is trying to negate the inside of the sentence without touching the quantifier.
The rule that makes these questions trivial is a single line:
To negate a quantified statement, flip the quantifier and negate the inside.
\lnot(\forall x,\, P(x)) \;\equiv\; \exists x,\, \lnot P(x)
\lnot(\exists x,\, P(x)) \;\equiv\; \forall x,\, \lnot P(x)
Read the two equivalences out loud: "not all" becomes "some... not"; "not some" becomes "all... not" (i.e. none). The quantifier flips, and the predicate inside picks up a negation.
Why the rule works
A universal statement \forall x,\, P(x) asserts that every x satisfies P. To say it is false is to assert that at least one x does not satisfy P — which is the existential claim \exists x,\, \lnot P(x). You do not need to know that every x fails; you only need a single witness of failure.
Symmetrically, an existential statement \exists x,\, P(x) asserts that at least one x satisfies P. To say it is false is to assert that no x satisfies P — which is the universal claim \forall x,\, \lnot P(x). A failed existence claim forbids all witnesses, not just some.
Why this mirrors De Morgan: if the domain of x were finite — say \{x_1, x_2, x_3\} — then \forall x,\, P(x) would be P(x_1) \land P(x_2) \land P(x_3), and its negation by De Morgan would be \lnot P(x_1) \lor \lnot P(x_2) \lor \lnot P(x_3), which is \exists x,\, \lnot P(x). The quantifier rule is De Morgan's law generalised from a finite conjunction to a possibly infinite one.
Worked applications
Statement. "All prime numbers are odd."
- \forall quantifier (hidden inside "all").
- Inside predicate: "is odd."
- Flip \forall to \exists; negate "is odd" to "is not odd" (i.e. even).
- Negation: "There exists a prime that is not odd" — equivalently, "some prime is even." And indeed, 2 is such a witness. The negation is true, so the original is false.
Statement. "There exists an integer n with n^2 < 0."
- \exists quantifier.
- Inside predicate: "n^2 < 0."
- Flip \exists to \forall; negate "n^2 < 0" to "n^2 \ge 0."
- Negation: "For every integer n, n^2 \ge 0." The negation is true, so the original is false.
Statement. "Every student in the class passed."
- \forall quantifier.
- Inside predicate: "passed."
- Negation: "There exists a student in the class who did not pass." One unlucky student is enough to kill the universal claim.
Notice what the negation is not. It is not "every student failed" (which would be \forall x,\, \lnot P(x) — the contrary, a much stronger claim). The negation of a universal is existential, not a stronger universal.
The trap: negating "all" by just saying "not all"
The single most common error is to write the negation of "all X are Y" as "all X are not Y." This is the contrary, not the negation.
- "All swans are white." Contrary: "All swans are black (not white)." Negation: "Some swan is not white."
- "All even numbers are divisible by 4." Contrary: "No even numbers are divisible by 4" — also false, but a different sentence. Negation: "Some even number is not divisible by 4" — e.g. 2, 6, 10, \ldots, true, so the original is false.
The contrary is a much stronger claim. Saying "all swans are black" is not just denying "all swans are white" — it is denying the existence of any white swan, which is a different statement. The negation only needs one counterexample.
An interactive quantifier flipper
Drag the dot through four quantified statements. The readout shows the original, its negation by the flip rule, and the contrary (the common wrong answer) — so you can see the difference.
Nested quantifiers: flip one at a time
Real proofs often use multiple quantifiers: "for every \varepsilon > 0, there exists a \delta > 0 such that |x - a| < \delta \Rightarrow |f(x) - f(a)| < \varepsilon." The negation flips every quantifier from outside in.
\forall \varepsilon\, \exists \delta\, P(\varepsilon, \delta) negates to \exists \varepsilon\, \forall \delta\, \lnot P(\varepsilon, \delta).
For the continuity example, the negation reads: "there exists \varepsilon > 0 such that for every \delta > 0, there exists x with |x - a| < \delta and |f(x) - f(a)| \ge \varepsilon." That is the precise definition of f being discontinuous at a, and every step from the positive definition to this negation uses the flip rule once per quantifier.
Why going outside-in matters: quantifiers do not commute freely. \forall \varepsilon\, \exists \delta and \exists \delta\, \forall \varepsilon say different things — one lets \delta depend on \varepsilon; the other demands a single \delta that works for all \varepsilon. When you negate, each quantifier must be flipped in place, preserving the order.
The exam reflex
- Spot the quantifier. Words that signal it: "for all," "every," "each," "any," "some," "there exists," "at least one," "none," "no."
- Symbolise the statement as \forall \ldots or \exists \ldots if that helps.
- Flip the quantifier (\forall \leftrightarrow \exists) and negate the predicate.
- If the statement is an implication inside the quantifier — "for every x, if P(x) then Q(x)" — remember that the negation of an implication is P \land \lnot Q (see Negation of If A Then B Is A and Not B). So the full negation is "there exists x such that P(x) and \lnot Q(x)."
- Sanity check: your negation should be a weaker claim than the contrary. Negations only ask for one counterexample; they do not flip every instance.
Three seconds per question once the reflex is installed. Every JEE negation problem collapses to the same drill.
Related: Logic and Propositions · Quantifier Flipper — ∀x P(x) Negates to ∃x ¬P(x) · How Do You Negate 'Some X Are Y'? The Exact Rule · Negation of If A Then B Is A and Not B