Question
Without using truth table, show that : ~r → ~(p ∧ q) ≡ [~(q → r)] → (~p)

Answer

LHS = ~r → ~(p ∧ q)
≡ ~q → (~p ∨ ~q) ……(De Morgan’s Law)
≡ ~(~r) ∨ (~p ∨~q) …..(Conditional Law)
≡ r ∨ (~p ∨ ~q) …..(Involution Law)
≡ r ∨ ~q ∨ ~p …..(Commutative Law)
≡ (~q ∨ r) ∨ (~p) ……(Commutative Law)
≡ ~(q → r) ∨ (~p) ……(Conditional Law)
≡ ~(q → r) → (~p) ……(Conditional Law)
= RHS.

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free