The statement (p ∧ (~ q) ) ⇒ (p ⇒ (~ q)) is

Using logical equivalence condition $\left(p \to q ≡ ~ p ∨ q\right)$, given statement can be expressed as,

\left(p ∧ ~ q\right) \to \left(p \to ~ q\right)

≡ \left(~ \left(p ∧ ~ q\right)\right) ∨ \left(~ p ∨ ~ q\right)$. . . . . . . ( 1 )$

We know De Morgan's law of logical equivalence is,

$~ \left(p ∧ q\right)$ ≡ ~ p ∨ ~ q$</p><p>Applying De Morgan's law in equation(1) we get,</p><p>$≡ \left(~ p ∨ q\right)$∨ \left(~ p ∨ ~ q\right)$\left[∵ ~ \left(~ p\right)≡ p\right]

$≡ \left(~ p ∨ ~ p\right)$ ∨ \left(q ∨ ~ q\right)$</p><p>$≡ ~ p ∨ t ≡ t (tautology)