Non-Equivalence as Disjunction of Conjunctions/Formulation 1

Theorem

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

This can be expressed as two separate theorems: