Here are my steps:
(p ∨ q) ∧ (¬p ∨ r) → (q ∨ r)
¬[ (p ∨ q) ∧ (¬p ∨ r) ] ∨ (q ∨ r) implication to disjunction
¬(p ∨ q) ∨ ¬(¬p ∨ r) ∨ (q ∨ r) demorgans law
(¬p ∧ ¬q) ∨ (p ∧ ¬r) ∨ (q ∨ r) demorgans law + double negation
I'm stuck on this last step. The only law that seemed hopeful was the distribution law but that won't even work here. I resorted to using a truth table to prove this but I really want to know if it's possible to shrink this proposition to just true to make it a tautology.
Thank you!