How to Negate a Quantified Statement

Start with a bird#

Someone says: every bird flies. You want to tell them they are wrong. What do you say? Answer it in your head before you read the next line.

Most people reach for no bird flies. It is the natural-sounding opposite, and it is wrong. It is a far bigger claim, and you would have to check every bird on earth to back it up.

The right answer is smaller: some bird does not fly. One penguin settles it.

That swap is the whole topic: “every” becomes “some”, and what follows gets flipped. Everything below is that one move, written down carefully. Written down, it keeps working even when the sentences get too long to hold in your head.

The symbols, and what to call them#

Mathematicians write those two words as symbols, because these sentences get long fast. There are only four you need here.

A quantifier is just one of those first two words: “every” or “some”. That is all the word means. A sentence that contains one is a quantified statement, which is where this guide gets its name.

P(x) is shorthand for “x has property P”. Here, P is “flies”, so P(x) reads “x flies”. The letter x is a placeholder for whatever we are talking about.

So every bird flies is written ∀x P(x), and the penguin argument, written out, is this:

¬∀x P(x)  ≡  ∃x ¬P(x)

Read it left to right: “it is not true that everything flies” is the same statement as “something does not fly”. Which is what the penguin proved.

The mirror image works the same way:

¬∃x P(x)  ≡  ∀x ¬P(x)

“It is not true that anything flies” is the same as “everything fails to fly”. Those two lines are called De Morgan’s laws for quantifiers, and they are the only two facts in this guide. Everything else is bookkeeping.

The rule, in four steps#

When a sentence has several quantifiers stacked up, you apply that same swap over and over, working from the outside in.

1. Push the “not” inward, left to right.
2. Flip every quantifier it passes. ∀ becomes ∃, ∃ becomes ∀.
3. Leave the letters in the order they were. You are moving the “not” past them, not rearranging them.
4. Negate the last bit last, once the “not” has nowhere further to go.

“Not all” is not “all not”#

This is the distinction the rule exists to protect, and it is worth seeing slowly.

Take “Every bird flies”. Written out: ∀x(Bird(x) → Flies(x)) — “for every thing x, if x is a bird then x flies”.

Its opposite is ∃x(Bird(x) ∧ ¬Flies(x)) — some bird does not fly. One penguin is enough. (∧ is the symbol for “and”.)

Now compare that to “Every bird does not fly”: ∀x(Bird(x) → ¬Flies(x)) — no bird flies at all. That is a far stronger claim, and it is not the opposite of anything on this page.

Now the uneven part, and it is the part to remember. Proving an “every” claim wrong takes exactly one counterexample. Proving a “some” claim wrong takes a statement about everything. That is why one penguin defeats “all birds fly”, and why checking a handful of cases can never defeat “some bird flies”.

The if–then hiding inside#

Almost every “every” statement in a real course is secretly an if–then. “All P are Q” is written ∀x(P(x) → Q(x)), where → means “if … then”. So negating one needs a second fact about if–then statements:

¬(P → Q)  ≡  P ∧ ¬Q

In words: the only way to break a promise of the form “if P then Q” is for P to happen and Q to fail anyway. Nothing else counts as breaking it.

Chain that with the quantifier rule and you get:

¬∀x(P(x) → Q(x))  ≡  ∃x ¬(P(x) → Q(x))  ≡  ∃x(P(x) ∧ ¬Q(x))

Read the result out loud: there is something that satisfies P and fails Q. That is the definition of a counterexample. Notice what happened to the arrow — it became an “and”. The arrow does not survive a negation, and leaving it in place is the single most common error in this topic.

The mirror case is worth having too. “Some P is Q” is ∃x(P(x) ∧ Q(x)), and its opposite is ∀x(P(x) → ¬Q(x)) — the “and” turns into an arrow going the other way.

A worked example, one line at a time#

Here is the kind of definition that turns up on an exam. A function f is called periodic if it repeats itself — a wave that looks the same every time you shift it along by some fixed amount. Written out:

∃T > 0 (∀x ∈ ℝ, f(x + T) = f(x))

Read it out loud: “there is some shift T, bigger than zero, such that for every x, shifting by T leaves the value unchanged.” T is the size of the shift — the period. Here T is an ordinary number, not a truth value.

Now negate it. Work outside in, one step per line, and change exactly one thing per line.

In plain English: f is not periodic if, for every shift you might try, there is some x where shifting by that amount changes the value. No shift works. That is exactly what “it never repeats” ought to mean — and reading your answer back in English is the sanity check. A negation you cannot say out loud is usually a negation you got wrong.

Two details are worth noticing. First, the “T > 0” part says which shifts we are talking about. It is not a claim of its own, so it rides along untouched — you do not turn it into “T ≤ 0”. Second, the letters stayed in the order T then x. Swapping them to ∃x ∀T would say something different, and stronger.

The order of the words matters#

∀x ∃y and ∃y ∀x are not interchangeable, and that is the other half of the topic.

Take the positive whole numbers, and the statement “x divides y” — meaning y is a whole number of x’s, so 3 divides 12.

• ∀x ∃y (x divides y) — “every number divides something.” True. Pick y = x; every number divides itself.
• ∃y ∀x (x divides y) — “there is one single number that every number divides.” False. Whatever y you name, y + 1 is bigger than y, so it cannot divide it.

Same words, same letters, opposite answers. The only difference is which quantifier is on the outside. In ∃y ∀x, the y is chosen first and has to work for every x. In ∀x ∃y, the y is chosen after x, so it is allowed to depend on it.

So when you negate, move the “not” through and flip each quantifier where it stands. Never sort them, never group them, and never move an ∃ to the front because it looks tidier.

Where these go wrong#

• Stopping halfway. An answer still containing ¬∀ or ¬∃ is not finished. Push the “not” all the way in.
• Keeping the arrow. ¬∀x(P(x) → Q(x)) is not ∃x(P(x) → ¬Q(x)). The if–then becomes an “and”: ∃x(P(x) ∧ ¬Q(x)).
• Negating the part that says which things you mean. In ∀x > 0, the “> 0” tells you which x are under discussion. It stays put. Changing it to x ≤ 0 changes the subject, not the claim.
• Reordering the quantifiers. ∀x∃y and ∃y∀x mean different things. Negation flips each one where it stands and keeps the sequence.
• Pairing the wrong connective. “All P are Q” is ∀x(P(x) → Q(x)), never ∀x(P(x) ∧ Q(x)). “Some P is Q” is ∃x(P(x) ∧ Q(x)), never ∃x(P(x) → Q(x)) — that last one is satisfied by anything that simply is not a P at all.
• Negating only the innermost part. The “not” applies to the whole sentence, quantifiers included. Changing just the final equation and leaving ∃T and ∀x alone is the most common half-answer.

Frequently asked questions#

Something here not clear? A topic you wish we covered? Tell us. We read every message, and a request is the fastest way to get a guide written — several of these exist because somebody asked.