Non-Equivalence as Disjunction of Conjunctions/Formulation 1/Reverse Implication/Proof

Theorem

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