How do I break down $\neg (p \land \neg q)$?
I know that $\neg (p \to q) \equiv p \land \neg q$, so I could say
$$ \neg (p \land \neg q) \equiv \neg (\neg (p \to q)) \equiv p \to q $$
which is true for $\neg p$ or $q$, but is it clever to involve implication when I already have eliminated them?
One may use $$ \neg (a \land b)=\neg a \lor \neg b $$ giving $$ \neg (p \land \neg q)=\neg p \lor \neg (\neg q)=\neg p \lor q. $$