A statement is a theorem (tautology) only if both sides of the biconditional are logically equivalent — i.e., agree in every row of the truth table. A single counterexample row falsifies the claim.
Statement (a): ((p∧q)⇒r)⇔((p⇒r)∧(q⇒r))
Try p=T, q=F, r=F:
- LHS: p∧q=T∧F=F, so F⇒r=T.
- RHS: (p⇒r)=(T⇒F)=F and (q⇒r)=(F⇒F)=T, so F∧T=F.
LHS =T but RHS =F, so the biconditional is false here. Statement (a) is not a tautology.
(The correct identity for the left side is ((p∧q)⇒r)≡((p⇒r)∨(q⇒r)) — note the ∨, not ∧.)
Statement (b): ((p∨q)⇒r)⇔((p⇒r)∨(q⇒r))
Try the same p=T, q=F, r=F:
- LHS: p∨q=T∨F=T, so T⇒F=F.
- RHS: (p⇒r)=(T⇒F)=F and (q⇒r)=(F⇒F)=T, so F∨T=T.
LHS =F but RHS =T, so the biconditional is false here. Statement (b) is not a tautology.
(The correct identity for the left side is ((p∨q)⇒r)≡((p⇒r)∧(q⇒r)) — note the ∧, not ∨.)
Conclusion
The two valid distribution laws for implication over a disjunctive/conjunctive hypothesis are:
((p∨q)⇒r)≡(p⇒r)∧(q⇒r)
((p∧q)⇒r)≡(p⇒r)∨(q⇒r)
Both printed statements pair the wrong connective on the right side, so neither is a theorem. The answer is option 4.
Pitfall: When the hypothesis of an implication is a disjunction, it splits into a conjunction of implications (and vice versa). The connective flips — a single p=T, q=F, r=F row catches the error every time.