I came across a problem that I'm stuck at. It's about basic logic.
Here is the problem:
Prove that (P∧R)⇒(∼Q)(P∧R)⇒(∼Q) is logically equivalent to ∼(P∧(Q∧R))∼(P∧(Q∧R)) without making a truth table.