Theorem xordi

Conjunction distributes over exclusive-or, using \( \neg (\varphi \leftrightarrow \psi) \) to express exclusive-or. This is one way to interpret the distributive law of multiplication over addition in modulo 2 arithmetic. This is not necessarily true in intuitionistic logic, though anxordi does hold in it. (Contributed by NM, 3-Oct-2008.)

Conclusion
\( \vdash \varphi \wedge \neg (\psi \leftrightarrow \chi) \leftrightarrow \neg (\varphi \wedge \psi \leftrightarrow \varphi \wedge \chi) \)
Proof
l0
annim
\( \vdash \varphi \wedge \neg (\psi \leftrightarrow \chi) \leftrightarrow \neg (\varphi \rightarrow (\psi \leftrightarrow \chi)) \)
pm5.32
\( \vdash \varphi \rightarrow (\psi \leftrightarrow \chi) \leftrightarrow (\varphi \wedge \psi \leftrightarrow \varphi \wedge \chi) \)
xchbinx l0 _