On this concept: Formula

Not sure which lesson to do first? Find your level and get a plan →

Math · Sets & Logic · Grade 9-12

Quantifiers

Quantifiers state how widely a property holds: ∀ ('for all') claims it for every element, ∃ ('there exists') claims it for at least one.

¬(∀x P(x))⇔∃x ¬P(x); ¬(∃x P(x))⇔∀x ¬P(x)

Quick Answer

Quantifiers state how widely a property holds: ∀ ('for all') claims it for every element, ∃ ('there exists') claims it for at least one. Use them to turn a sentence with a variable into a definite claim: 'x2≥0 for every real x' is true, and 'some real x has x2=2' is true. A ∀ claim needs every case to work, so one counterexample disproves it. An ∃ claim needs only one example, so one example proves it. Negating swaps them: 'not all' means 'some are not'.

Why This Matters

Nearly every definition and theorem hides a quantifier: 'all primes greater than 2 are odd', 'every positive number has a square root'. Knowing which one you face tells you what evidence settles it: one example proves an 'exists' claim but says nothing about a 'for all' claim, and one counterexample destroys a 'for all' claim. Misreading this leads to proofs by example and to wrong negations.

Intuitive Explanation

The sentence 'x+3>5' is neither true nor false until you know what x is. A quantifier settles that by saying how many values the claim covers. '∀x, x+3>5' (for every real x) is false: x=0 gives 3>5. '∃x, x+3>5' (for some real x) is true: x=10 works. Same sentence, different quantifier, opposite truth values.

The two quantifiers need opposite kinds of evidence. To prove a ∀ claim you must cover every case, usually with algebra rather than examples; to disprove it, one counterexample is enough. To prove an ∃ claim, one example is enough; to disprove it, you must show that every case fails. That is why negation swaps them: ¬∀x P(x) is ∃x ¬P(x), and ¬∃x P(x) is ∀x ¬P(x).

When two quantifiers appear, their order changes the meaning. '∀x ∃y: y>x' says every number has some bigger number, which is true (take y=x+1). '∃y ∀x: y>x' says one number is bigger than every number, itself included, which is false. Same symbols, swapped order, a different claim.

Think of it like this. A ∀ claim is like a teacher announcing 'everyone handed in the homework': one missing student makes it false. An ∃ claim is 'someone handed in the homework': one student who did makes it true. A single student settles each claim, but in opposite directions.

Core idea. Quantifiers set the scope of a predicate: every case (∀) or at least one case (∃).


When to Use

Use quantifiers whenever a claim says how many cases it covers: 'every', 'all', 'any', 'each' (∀), or 'some', 'there is', 'at least one' (∃). Decide which you have before choosing a method: a counterexample disproves 'all', a single example proves 'some'. Hidden quantifiers count too: 'x2≥0' in a textbook usually means for all real x. If the sentence has no variable, it is already a plain statement.

Tip. Ask: Am I claiming a property for every element or for at least one element?

How to Recognize It

Before deciding how to prove or disprove a claim, find every variable in it and work out how many cases the claim covers, including quantifiers that are only implied.

  1. Does the claim involve a variable without saying how many cases it covers, as in 'a prime is odd'?

    If yes, there is a hidden quantifier, usually 'for all': 'every prime is odd', which 2 disproves. If no, and the sentence has no variable at all, it is a plain statement with no quantifier.

  2. Are you trying to disprove a claim about every case?

    If yes, one counterexample is enough: 'for every whole number n, n2+n+41 is prime' fails at n=40, since 402+40+41=1681=412. If no, and you are proving a 'there exists' claim, one working example does it.

  3. Does the claim contain two quantifiers, like 'for every x there is a y'?

    If yes, read them in order: ∀x ∃y (y>x) is true for whole numbers, but ∃y ∀x (y>x), one number bigger than all of them, is false. If no, a single quantifier sets the scope.

  4. Is there an if-then hiding inside the 'for all', as in 'every square is a rectangle'?

    If yes, it is ∀x (S(x)→R(x)), so its negation is 'some square is not a rectangle', ∃x (S(x)∧¬R(x)). If no, negate directly by swapping ∀ and ∃ and negating the property.

Quantifiers compared with Negation, Conditional in a universal, and Order of mixed quantifiers

Quantifiers, negation, the conditional hidden inside 'all' and the order of mixed quantifiers all turn up in the same sentences. Ask how many cases the claim covers, what happens when you deny it, whether an if-then sits inside, and which quantifier comes first.

Quantifiers

Meaning
Use this when you must say whether a property holds for every element or for at least one element.
Key test
Am I claiming a property for every element or for at least one element?
Formula
¬(∀x P(x))⇔∃x ¬P(x); ¬(∃x P(x))⇔∀x ¬P(x)
Example
Disprove the claim '∀x, x2>x' for real numbers.

Negation

Meaning
Flips truth; with quantifiers it also swaps ∀ and ∃.
Key test
Use the rule ¬∀=∃¬ when negating quantified claims.
Formula
¬(∀x P)⇔∃x ¬P
Example
'not all pass' = 'someone fails'

Conditional in a universal

Meaning
Often '∀x (P(x)→Q(x))' is mistaken for a bare ∀.
Key test
Recognize the implication inside the universal claim.
Formula
∀x (P(x)→Q(x))
Example
'all primes >2 are odd'

Order of mixed quantifiers

Meaning
∀∃ differs from ∃∀.
Key test
Use care: swapping order changes meaning.
Formula
∀x∃y≠∃y∀x
Example
'everyone has a mother' vs 'one mother for everyone'

Formula & Notation

¬(∀x P(x))⇔∃x ¬P(x); ¬(∃x P(x))⇔∀x ¬P(x)
∀x P(x)⇔⋀x∈DP(x); ∃x P(x)⇔⋁x∈DP(x); ¬∀x P(x)⇔∃x ¬P(x)

How to read it: ∀ (universal), ∃ (existential)

Worked Examples

Example 1 — Disprove a universal

Easy

Disprove the claim '∀x, x2>x' for real numbers.
Show the steps and the answer
  1. Identify the quantifier: ∀, a claim about every real number.

    A 'for all' claim falls to a single counterexample.

  2. Look where squaring does not make a number bigger: between 0 and 1.

    Multiplying a number between 0 and 1 by itself shrinks it, so the claim should break there.

  3. Test x=0.5: x2=0.25, and 0.25>0.5 is false.

    One real x with x2≤x is enough to disprove the claim.

  4. Note other counterexamples: x=0 gives 0>0, false, and x=1 gives 1>1, false.

    Every x from 0 to 1 fails, so the claim breaks on a whole interval.

Answer: False — x=0.5 is a counterexample

Takeaway: To disprove a 'for all' claim, find one value where it fails; here any x from 0 to 1 will do.

Example 2 — One example is not enough

Standard

Does showing 32>3 prove '∀x, x2>x'?
Show the steps and the answer
  1. Check the example: 32=9>3, true.

    The example is correct; the question is what it can prove.

  2. Say what one true case does prove: ∃x with x2>x.

    An example settles an 'exists' claim, not a 'for all' claim.

  3. Recall the counterexample x=0.5, where 0.25>0.5 is false.

    The universal claim is actually false, so no number of examples like 3 could ever prove it.

  4. Describe what a proof of a ∀ claim needs: one argument that covers every real x at once.

    Examples check individual cases, and a universal statement about the reals covers infinitely many.

Answer: No — one example cannot prove a universal

Takeaway: One example proves 'there exists' but never 'for all'; a universal claim needs a general argument and falls to one counterexample.

Example 3 — Find the mistake: reading quantifiers in the wrong order

Application

Over the integers, a student reads '∀x ∃y: x+y=0' and writes: "This says one integer y adds to every x to give 0, which is impossible, so the statement is false." Find the mistake and correct it.
Show the steps and the answer
  1. Read the quantifiers left to right: first 'for every x', then 'there exists y'.

    Because ∃y comes after ∀x, the y is allowed to depend on x.

  2. Find a y for each x: take y=−x; for example x=7 gets y=−7.

    Every integer has an opposite that is also an integer, so the claim holds for every x.

  3. Identify the student's reading: '∃y ∀x: x+y=0', one y for all x.

    That version is indeed false: y would need 1+y=0 and 2+y=0, so y=−1 and y=−2 at once.

  4. Conclude that the given statement is true; the student judged a different statement.

    Swapping the order of mixed quantifiers changes the claim.

Answer: True: for each integer x, the integer y=−x gives x+y=0. The student's version, ∃y ∀x, is the false one.

Takeaway: Read mixed quantifiers in order: in ∀x ∃y the y may change with x; in ∃y ∀x one y must work for every x.

Where You'll See It

  • Testing an app

    A test suite showing that a sorting app works on 500 lists proves 'there exists a list it sorts correctly', not 'it sorts every list'. One failing list, such as an empty one, disproves 'every'. That is why testers hunt for counterexamples at the edges: empty inputs, huge inputs, repeated values.

  • Airline punctuality claims

    An airline claiming 'all our flights leave on time' is refuted by one late departure. A passenger claiming 'some of their flights leave late' is proved right by the same late departure. One event settles both claims, in opposite directions, because one is a ∀ claim and the other an ∃ claim.

Common Mistakes

  1. The slip: Negating 'for all' as 'for none'

    Instead: ¬∀x P(x) is ∃x ¬P(x), 'at least one fails.'

  2. The slip: Thinking one example proves a ∀ claim

    Instead: a universal needs every case; one example only proves ∃.

  3. The slip: Swapping mixed quantifier order

    Instead: ∀x ∃y and ∃y ∀x can mean different things.


Mini Practice

Try these on your own. Tap Reveal when you want to check.

  1. Is "∃x∈Z such that x2=49" true? Give a witness.

    Hint: For "there exists", one example is enough.

  2. Is "∀n∈N, n2+n is even" true?

    Hint: Factor n2+n. What do you know about two consecutive numbers?

  3. Disprove "∀n∈N, n2+n+41 is prime."

    Hint: Try a value of n that makes every term share a factor of 41.

  4. Write the negation of "∃x∈R, x2<0", and say which is true, the statement or its negation.

    Hint: Swap the quantifier and negate the inequality.

  5. A: "Every student has a locker." B: "There is 1 locker that belongs to every student." Do A and B mean the same thing?

    Hint: Write each with ∀ and ∃. Which quantifier comes first?

  6. Zoe negates "Every prime number is odd" as "No prime number is odd." Correct Zoe, and say which version is true.

    Hint: What does it take to make an "every" statement false?

Want the full set?

50 practice questions for this concept — free to try, every one with a complete worked solution showing the why, not just the answer.

Frequently Asked Questions

Is 'all unicorns can fly' true or false?

In logic it is true, because there are no unicorns. The claim means: for every xx, if xx is a unicorn, then xx can fly. Since nothing is a unicorn, the 'if' part is never true, and the claim can never be broken. Its negation, 'some unicorn cannot fly', is false, because no unicorn exists at all. A 'for all' claim about an empty set is always true.

Why do the symbols look like an upside-down A and a backwards E?

They come from the words: ∀\forall is an upside-down A for 'all', and ∃\exists is a backwards E for 'exists'. Giuseppe Peano introduced ∃\exists in the 1890s, and Gerhard Gentzen added ∀\forall in 1935 to match it. Before that, writers used other signs for 'for all', so older books can look quite different. Today the two symbols are standard almost everywhere.

Can 'any' mean both 'all' and 'some'?

Yes, which makes it slippery. 'Any square is a rectangle' means every square is. But 'if any student is late, the trip is delayed' means if at least one student is late. And 'I didn't see any birds' means I saw none. When a sentence uses 'any', rewrite it with 'every' or 'at least one' before you negate it or try to prove it.

Does 'some' mean 'at least two' or 'not all'?

In math, neither. 'Some' means at least one, and it allows all. 'Some prime numbers are even' is true with just one example, 2. And 'some squares are rectangles' is true even though every square is one. In everyday speech, 'some students passed' hints that not all did, but logic does not read that hint into the claim.

Learning Path

← Before

Logical Statement
Quantifiers

You are here

You need Logical Statement, especially the idea that a sentence with a free variable has no truth value yet. Quantifiers add ∀ and ∃ to fix that, along with the rule for negating them. Next, Proof Techniques show how to prove ∀ claims in general, disprove them by counterexample, and prove ∃ claims by finding an example.

See Also