Non-Equivalence as Conjunction of Disjunction with Negation of Conjunction/Proof 1

Theorem

 * $\neg \left ({p \iff q}\right) \dashv \vdash \left({p \lor q} \right) \land \neg \left({p \land q}\right)$

Proof
The above argument is reversible: