(p ∧ q) ∧ (p ⇒ ¬q) prove contradiction? : <p>So I have reached dead end after this I tried doing de Morgan rule after this but and faced dead end after that.
I have tried this</p>

<pre><code>(p ∧ q) ∧ (¬p ∨ ¬q)
(p ∧ q) ∧ ¬(p ∧ q)
</code></pre>
