Non-Equivalence as Disjunction of Negated Implications/Proof 1

Theorem

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

Proof
The above reasoning is completely reversible.