Skip to content
Question 197 of 227

Q.Without using truth table show that ∼(p∨q)∨(∼p∧q)≡∼p\sim (p \lor q) \lor (\sim p \land q) \equiv \sim p

Maharashtra MsbshseMaharashtra HSC (MSBSHSE) Board 2016Subjective· 3mImportance★★★★★
87% · 197/227 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 →

Apply De Morgan's law and then the distributive law.

∼(p∨q)∨(∼p∧q)\sim(p\lor q)\lor(\sim p\land q)

Apply De Morgan's law to the first term: ∼(p∨q)≡∼p∧∼q\sim(p\lor q)\equiv\sim p\land\sim q.

≡(∼p∧∼q)∨(∼p∧q)\equiv(\sim p\land\sim q)\lor(\sim p\land q)

Apply the distributive law A∧B∨A∧C≡A∧(B∨C)A\land B\lor A\land C\equiv A\land(B\lor C) with A=∼pA=\sim p, B=∼qB=\sim q, C=qC=q:

≡∼p∧(∼q∨q)\equiv \sim p\land(\sim q\lor q)

Since ∼q∨q\sim q\lor q is a tautology (always true, denote TT):

≡∼p∧T≡∼p\equiv \sim p\land T \equiv \sim p

…

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.