HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Earth and Environmental Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
Conditionals, Contrapositives and Quantifiers
  1. 1Conditional and biconditional statements
  2. 2Converse, inverse and contrapositive
  3. 3Quantifiers and their negations
  1. Mathematics
  2. /Conditionals, Contrapositives and Quantifiers
  3. /Quantifiers and their negations

Course 36.2·Lesson 3 of 3

Quantifiers and their negations

'For all' (∀\forall∀) and 'there exists' (∃\exists∃) turn an open sentence into a statement over a stated set. The negation swaps them: ∼(∀x P(x))≡∃x ∼P(x)\sim(\forall x\, P(x)) \equiv \exists x\, \sim P(x)∼(∀xP(x))≡∃x∼P(x)

Lesson 3 of 3Show all lessonsHide
Conditionals, Contrapositives and Quantifiers
  1. 1Conditional and biconditional statements
  2. 2Converse, inverse and contrapositive
  3. 3Quantifiers and their negations

Try the code and the simulations beside the lesson.

What you will be able to do

  • read statements with "for all" and "there exists";
  • write their negations correctly, in words and in symbols;
  • disprove a statement with a counterexample;
  • see why the order of two quantifiers matters.

Two kinds of claim

A teacher says: "Every student in this room has a pencil." A friend says: "Someone in this room has a red pencil." The first claim is about all the students. The second needs only one.

Words like "every" and "some" are quantifiers.

  • The universal quantifier "for all", "for every", "for each" is written ∀\forall∀.
  • The existential quantifier "there exists", "for some", "at least one" is written ∃\exists∃.

Each one turns an open sentence into a statement. "x2≥0x^2 \ge 0x2≥0" is an open sentence. "For every real xxx, x2≥0x^2 \ge 0x2≥0" is a true statement:

∀x∈R, x2≥0.\displaystyle \forall x \in \mathbb{R},\ x^2 \ge 0.∀x∈R, x2≥0.

"There exists a real xxx with x2=2x^2 = 2x2=2" is true too. But over the rational numbers it is false, because 2\sqrt{2}2​ is not rational. The set the variable runs over is part of the statement.

How to show each one

  • To show "for all xxx, P(x)P(x)P(x)" is true, you need an argument that covers every xxx. Checking examples is not enough.
  • To show it is false, one counterexample is enough: one xxx with P(x)P(x)P(x) false.
  • To show "there exists xxx with P(x)P(x)P(x)" is true, one example is enough.
  • To show it is false, you must show P(x)P(x)P(x) fails for every xxx.

Example. "For every prime ppp, ppp is odd" is false. The counterexample is p=2p = 2p=2.

Negating a quantified statement

What is the negation of "Every student has a pencil"? It is not "Every student has no pencil". It is "Some student has no pencil". One student without a pencil is enough to make the claim false.

  • ∼(∀x P(x))≡∃x ∼P(x)\sim(\forall x\ P(x)) \equiv \exists x\ \sim P(x)∼(∀x P(x))≡∃x ∼P(x);
  • ∼(∃x P(x))≡∀x ∼P(x)\sim(\exists x\ P(x)) \equiv \forall x\ \sim P(x)∼(∃x P(x))≡∀x ∼P(x).

In words: the negation changes "all" to "some", changes "some" to "all", and negates what follows.

  • "There is a rational number rrr with r2=2r^2 = 2r2=2." Negation: "For every rational number rrr, r2≠2r^2 \ne 2r2=2."
  • "All the lamps are on." Negation: "At least one lamp is not on."
  • "No square number ends in 777" means "every square number does not end in 777". Its negation is "some square number ends in 777".

Two quantifiers: the order matters

Over the integers, compare these.

  • ∀x ∃y (x+y=0)\forall x\ \exists y\ (x + y = 0)∀x ∃y (x+y=0): for every xxx there is a yyy with x+y=0x + y = 0x+y=0. True: take y=−xy = -xy=−x. The yyy may depend on xxx.
  • ∃y ∀x (x+y=0)\exists y\ \forall x\ (x + y = 0)∃y ∀x (x+y=0): one single yyy works for every xxx. False: no number cancels every integer at once.

To negate a statement with two quantifiers, swap each one and negate the end:

  • ∼(∀x ∃y P)≡∃x ∀y ∼P\sim(\forall x\ \exists y\ P) \equiv \exists x\ \forall y\ \sim P∼(∀x ∃y P)≡∃x ∀y ∼P.

Practise with new numbers

Try it in Python

On a finite set, Python's all() is "for all" and any() is "there exists". The program tests a few claims about the numbers from 111 to 303030 and prints a counterexample when a claim fails.

Read it first. Then run it. Which claim fails, and what counterexample does the program print?

1. Change the range to range(-5, 31). Does the first claim still hold?

2. Test the two orders of the quantifiers in x + y == 0 on the set from -3 to 3. Which one is true?

Common mistakes

  • Proving a for-all statement by examples. Ten examples do not cover every case. One counterexample does disprove it.
  • Negating "all" to "none". The negation of "all are on" is "some are not on".
  • Forgetting the set. A statement can be true over the real numbers and false over the rational numbers.
  • Swapping the order of two quantifiers. "∀x ∃y\forall x\ \exists y∀x ∃y" and "∃y ∀x\exists y\ \forall x∃y ∀x" are different claims.

Remember these

  • ∀\forall∀ means for all, ∃\exists∃ means there exists.
  • ∼∀≡∃∼\sim\forall \equiv \exists\sim∼∀≡∃∼ and ∼∃≡∀∼\sim\exists \equiv \forall\sim∼∃≡∀∼.
  • One counterexample disproves a for-all statement.
  • The order of different quantifiers matters.

Check yourself

Try each one on your own first. If you are stuck, open a hint. Then check with Show the answer.

  1. Write the negation of "Every train today left on time".
  1. Is "for every real xxx, x2>xx^2 > xx2>x" true? If not, give a counterexample.
  1. Write the negation of ∃x∈N, x+3=1\exists x \in \mathbb{N},\ x + 3 = 1∃x∈N, x+3=1, and say which of the two is true.
  1. Over the real numbers, is ∀x ∃y (y>x)\forall x\ \exists y\ (y > x)∀x ∃y (y>x) true? Is ∃y ∀x (y>x)\exists y\ \forall x\ (y > x)∃y ∀x (y>x) true?
  1. Write the negation of "No prime number is even" and give its truth value.

References

  • NCERT, Mathematics Textbook for Class XI (edition before 2023), Chapter 14, section 14.5 on quantifiers.
  • OpenStax, Contemporary Mathematics, Chapter 2, section on statements and quantifiers.

Enroll free in Conditionals, Contrapositives and Quantifiers

Every lesson is open to read. Enrolling also lets you:

  • Mark lessons done and carry on where you stopped.
  • Take the tests of this lesson and its course.
  • Count the course towards the certificate for its chapter.
No payment. You can leave at any time.

Problems (3)

A class of 30 students fills in a survey…Hard · High School (11–12) · by StemPy Lab
Let S = {1, 2, 3, 4, 5, 6}, the faces of a die…Advanced · High School (11–12) · by StemPy Lab
Consider the claim "for every real number x, x² > x"…Advanced · High School (11–12) · by StemPy Lab
That was the last lessonBack to the course: take the test
← Conditionals, Contrapositives and Quantifiers
← Converse, inverse and contrapositiveNext →

Discussion (0)

Log in to join the discussion.

Loading…

and
∼(∃x P(x))≡∀x ∼P(x)\sim(\exists x\, P(x)) \equiv \forall x\, \sim P(x)∼(∃xP(x))≡∀x∼P(x)
. One counterexample disproves a for-all statement, and one example proves a there-exists statement. With two quantifiers, the order matters.
about 25 min1 simulation1 practice question1 Python program5 questions to check yourself

This lesson is free to read. Enroll free to keep your place and take the tests.

Python Labs (1)

A checker for for-all and there-existsPython Lab · by StemPy Lab

Question Sets (1)

Conditionals and Quantifiers: Concept Check10 questions · by StemPy Lab

Notes (1)

Conditionals, Contrapositives and Quantifiers: Quick RevisionNote · by StemPy Lab