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
  1. Notes
  2. /Conditionals, Contrapositives and Quantifiers: Quick Revision
Mathematics

Conditionals, Contrapositives and Quantifiers: Quick Revision

A brief note on if-then and if-and-only-if statements, the converse, inverse and contrapositive, negations of compound statements, and the quantifiers for all and there exists, with practice and questions.

StemPy LabWritten by StemPy Lab
Log in to save

A brief note on Conditionals, Contrapositives and Quantifiers. Read it before a test. Try each question at the end before you open its answer.

The conditional

  • p⇒qp \Rightarrow qp⇒q is false only when ppp is T and qqq is F.
  • p⇒q≡∼p∨qp \Rightarrow q \equiv \sim p \vee qp⇒q≡∼p∨q.
  • Same meaning: if ppp then qqq; ppp only if qqq; qqq if ppp; ppp is sufficient for qqq; qqq is necessary for ppp.
  • Unless: "ppp unless qqq" is ∼q⇒p\sim q \Rightarrow p∼q⇒p.
  • Biconditional: p⇔qp \Leftrightarrow qp⇔q is true when ppp and qqq agree.

Related statements

  • Converse: q⇒pq \Rightarrow pq⇒p. Inverse: ∼p⇒∼q\sim p \Rightarrow \sim q∼p⇒∼q.
  • Contrapositive: ∼q⇒∼p\sim q \Rightarrow \sim p∼q⇒∼p, equivalent to p⇒qp \Rightarrow qp⇒q.
  • The converse and the inverse are equivalent to each other.

Negations

  • ∼(p⇒q)≡p∧∼q\sim(p \Rightarrow q) \equiv p \wedge \sim q∼(p⇒q)≡p∧∼q.
  • ∼(p⇔q)≡p⇔∼q\sim(p \Leftrightarrow q) \equiv p \Leftrightarrow \sim q∼(p⇔q)≡p⇔∼q.
  • ∼(∀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).

Quantifiers

  • One counterexample disproves a for-all statement.
  • The set of the variable is part of the statement.
  • The order of ∀\forall∀ and ∃\exists∃ matters.

A worked example

Is "if n2n^2n2 is a multiple of 444, then nnn is a multiple of 444" true for whole numbers?

  1. Look for a counterexample. n=2n = 2n=2: n2=4n^2 = 4n2=4 is a multiple of 444, and 222 is not.
  2. Conclusion. The statement is false.
  3. Its contrapositive "if nnn is not a multiple of 444, then n2n^2n2 is not" fails at n=2n = 2n=2 too.

Practice with new numbers

A program to try

The program checks the four related statements on every row, then tests a for-all claim and prints a counterexample.

Read it first. Then run it. Which statements agree in every row?

1. Change the claim to n * n % 4 in (0, 1). Does it still have a counterexample?

Mistakes to avoid

  • Reversing "only if".
  • Negating an if-then with an if-then.
  • Thinking the converse follows from the statement.
  • Negating "all" to "none".

Check yourself

  1. Write "qqq is necessary for ppp" with an arrow.
  1. Negate "If it is cold, then the pond freezes".
  1. The contrapositive of a statement is true. What is the statement?
  1. Negate "Some bags are heavy".
  1. Is ∀x∈R ∃y∈R (y2=x)\forall x \in \mathbb{R}\ \exists y \in \mathbb{R}\ (y^2 = x)∀x∈R ∃y∈R (y2=x) true?

Sources

  • NCERT, Mathematics Textbook for Class XI (edition before 2023), Chapter 14.
  • OpenStax, Contemporary Mathematics, Chapter 2.
← All Notes
← Statements, Connectives and Truth Tables: Quick RevisionValid Arguments and Methods of Proof: Quick Revision →
More onMathematical Reasoning

Discussion (0)

Log in to join the discussion.

Loading…

On this page

  1. The conditional
  2. Related statements
  3. Negations
  4. Quantifiers
  5. A worked example
  6. Practice with new numbers
  7. A program to try
  8. Mistakes to avoid
  9. Check yourself
  10. Sources

Goes with the lesson

  1. Quantifiers and their negations
Conditionals, Contrapositives and Quantifiers

More notes on this topic

  1. Valid Arguments and Methods of Proof: Quick Revision
  2. Statements, Connectives and Truth Tables: Quick Revision
All notes on this topic →