Non-Equivalence as Disjunction of Conjunctions/Formulation 2

Theorem

 * $\vdash \paren {\neg \paren {p \iff q} } \iff \paren {\paren {\neg p \land q} \lor \paren {p \land \neg q} }$