Skip to content
Exercise 12.2 · Q15

Q.Prove that p→(¬q∨r)≡¬p∨(¬q∨r)p\to(\neg q\vee r)\equiv \neg p\vee(\neg q\vee r) using truth table.

Puducherry TnboardTextbookSubjectiveImportance★★★★★
30% · 25/84 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

With three variables the table needs 23=82^3=8 rows; we evaluate both formulas across every row and check the final columns match, which proves the equivalence directly (this is really the general identity A→B≡¬A∨BA\to B\equiv\neg A\vee B with A=pA=p, B=¬q∨rB=\neg q\vee r).

Step 1. Set up the 8-row table with p,q,rp,q,r.

ppqqrr¬q\neg q¬q∨r\neg q\vee rp→(¬q∨r)p\to(\neg q\vee r)¬p\neg p¬p∨(¬q∨r)\neg p\vee(\neg q\vee r)
TTTFTTFT
TTFFFFFF
TFTTTTFT
TFFTTTFT
FTTFTTTT
FTFFFTTT
FFTTTTTT
FFFTTTTT

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.