Metamath Proof Explorer


Theorem anxordi

Description: Conjunction distributes over exclusive-or. In intuitionistic logic this assertion is also true, even though xordi does not necessarily hold, in part because the usual definition of xor is subtly different in intuitionistic logic. (Contributed by David A. Wheeler, 7-Oct-2018)

Ref Expression
Assertion anxordi ( ( 𝜑 ∧ ( 𝜓𝜒 ) ) ↔ ( ( 𝜑𝜓 ) ⊻ ( 𝜑𝜒 ) ) )

Proof

Step Hyp Ref Expression
1 xordi ( ( 𝜑 ∧ ¬ ( 𝜓𝜒 ) ) ↔ ¬ ( ( 𝜑𝜓 ) ↔ ( 𝜑𝜒 ) ) )
2 df-xor ( ( 𝜓𝜒 ) ↔ ¬ ( 𝜓𝜒 ) )
3 2 anbi2i ( ( 𝜑 ∧ ( 𝜓𝜒 ) ) ↔ ( 𝜑 ∧ ¬ ( 𝜓𝜒 ) ) )
4 df-xor ( ( ( 𝜑𝜓 ) ⊻ ( 𝜑𝜒 ) ) ↔ ¬ ( ( 𝜑𝜓 ) ↔ ( 𝜑𝜒 ) ) )
5 1 3 4 3bitr4i ( ( 𝜑 ∧ ( 𝜓𝜒 ) ) ↔ ( ( 𝜑𝜓 ) ⊻ ( 𝜑𝜒 ) ) )