p∨r
p∧r
(q∨r)→(p∧r)
(p∨r)→(p∧r)
Given q is F and (p∧q)↔r is T ⇒ p∧q is F which implies that r is F ⇒ q is F and r is F ⇒ (q∨r) is always F ⇒ (q∨r)→(p∧r) is a tautology.