Question
Without using truth table prove that : p ↔ q ≡ (p∧ q) ∨ (~ p ∧ ~q)

Answer

LHS = p ↔ q
≡ (p ↔ q) ∧ (q ↔ p) … (Biconditional Law)
≡ (~p ∨ q) ∧ (~q ∨ p) … (Conditional Law)
≡ [~p ∧ (~q ∨ p)] ∨ [q ∧ (~q ∨ p)] … (Distributive Law)
≡ [(~p ∧ ~q) ∨ (~p ∧ p)] ∨ [(q ∧ ~q) ∨ (q ∧ p)] … (Distributive Law)
≡ [(~p ∧ ~q) ∨ F] ∨ [F ∨ (q ∧ p)] … (ComplementLaw)
≡ (~ p ∧ ~ q) ∨ (q ∧ p) … (Identity Law)
≡ (~ p ∧ ~ q) ∨ (p ∧ q) … (Commutative Law)
≡ (p ∧ q) ∨ (~p ∧ ~q) … (Commutative 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