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. Problems
  2. /Prove, with the laws of logic, that p ⇒ (q ⇒ r) ≡ (p wedge q) ⇒ r…
AdvancedMathematicsHigh School (11–12)Mathematical ReasoningNumericalproof

Prove, with the laws of logic, that p ⇒ (q ⇒ r) ≡ (p wedge q) ⇒ r…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

Prove, with the laws of logic, that p⇒(q⇒r)≡(p∧q)⇒rp \Rightarrow (q \Rightarrow r) \equiv (p \wedge q) \Rightarrow rp⇒(q⇒r)≡(p∧q)⇒r. Use A⇒B≡∼A∨BA \Rightarrow B \equiv \sim A \vee BA⇒B≡∼A∨B and De Morgan's law. Then count the rows of the truth table, out of 888, in which p⇒(q⇒r)p \Rightarrow (q \Rightarrow r)p⇒(q⇒r) is false. Finally, the grouping (p⇒q)⇒r(p \Rightarrow q) \Rightarrow r(p⇒q)⇒r looks similar. In how many of the 888 rows does it differ from p⇒(q⇒r)p \Rightarrow (q \Rightarrow r)p⇒(q⇒r)?

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

p⇒qp \Rightarrow qp⇒q is false only when ppp is true and qqq is false, and p⇒q≡∼p∨qp \Rightarrow q \equiv \sim p \vee qp⇒q≡∼p∨q. 'ppp only if qqq' means p⇒qp \Rightarrow qp⇒q. ∼(p⇒q)≡p∧∼q\sim(p \Rightarrow q) \equiv p \wedge \sim q∼(p⇒q)≡p∧∼q. p⇔qp \Leftrightarrow qp⇔q is true when ppp and qqq agree.

The worked solution

Check an answer or open a hint to unlock the worked solution.

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

Step 1. The left side. q⇒r≡∼q∨rq \Rightarrow r \equiv \sim q \vee rq⇒r≡∼q∨r. So p⇒(q⇒r)≡∼p∨∼q∨rp \Rightarrow (q \Rightarrow r) \equiv \sim p \vee \sim q \vee rp⇒(q⇒r)≡∼p∨∼q∨r.

Step 2. The right side. (p∧q)⇒r≡∼(p∧q)∨r≡∼p∨∼q∨r(p \wedge q) \Rightarrow r \equiv \sim(p \wedge q) \vee r \equiv \sim p \vee \sim q \vee r(p∧q)⇒r≡∼(p∧q)∨r≡∼p∨∼q∨r, by De Morgan. Both sides are the same, so the equivalence is proved.

Step 3. False rows. ∼p∨∼q∨r\sim p \vee \sim q \vee r∼p∨∼q∨r is false only when ppp T, qqq T and rrr F. That is 111 row.

Step 4. The other grouping. (p⇒q)⇒r≡∼(∼p∨q)∨r≡(p∧∼q)∨r(p \Rightarrow q) \Rightarrow r \equiv \sim(\sim p \vee q) \vee r \equiv (p \wedge \sim q) \vee r(p⇒q)⇒r≡∼(∼p∨q)∨r≡(p∧∼q)∨r. When ppp is F and rrr is F, this is F, but p⇒(q⇒r)p \Rightarrow (q \Rightarrow r)p⇒(q⇒r) is T. That happens in the rows (F, T, F) and (F, F, F). In every other row they agree.

Check. Row (T, T, F): both groupings are F. Row (T, F, F): (p∧∼q)∨r(p \wedge \sim q) \vee r(p∧∼q)∨r is T and so is ∼p∨∼q∨r\sim p \vee \sim q \vee r∼p∨∼q∨r.

Answer: proof complete; the chain is false in 111 row, and the two groupings differ in 222 rows.

Log in to save this for later
← All Problems
← A college prints three rules about a certificate…For each whole number n from 1 to 50, consider the statement S(n): "if n is a multiple of 6, then n… →
More onMathematical Reasoning

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Conditional and biconditional statementsConditionals, Contrapositives and Quantifiers

More on this topic

  1. Prove by cases that for every integer n, n² leaves remainder 0 or 1 when divided by 3…Advanced
  2. Prove by contradiction that there are no integers a and b with 6a + 9b = 100…Advanced
  3. Prove by contradiction that √3 is irrational…Hard
Prove by exhaustion that no perfect square ends in the digit 2, 3, 7 or 8…Advanced
  • The formula f(n) = n² + n + 41 gives a prime for n = 0, 1, 2, … for a long time…Advanced
  • All problems on this topic →