Theorem bj-bixor 37217

Description: Equivalence of two ternary operations. Note the identical order and parenthesizing of the three arguments in both expressions. (Contributed by BJ, 31-Dec-2023.)

Assertion

Ref	Expression
bj-bixor	⊢ ((𝜑 ↔ (𝜓 ⊻ 𝜒)) ↔ (𝜑 ⊻ (𝜓 ↔ 𝜒)))

Proof of Theorem bj-bixor

Step	Hyp	Ref	Expression
1		pm5.18 384	. . 3 ⊢ ((𝜑 ↔ (𝜓 ↔ 𝜒)) ↔ ¬ (𝜑 ↔ ¬ (𝜓 ↔ 𝜒)))
2	1	con2bii 360	. 2 ⊢ ((𝜑 ↔ ¬ (𝜓 ↔ 𝜒)) ↔ ¬ (𝜑 ↔ (𝜓 ↔ 𝜒)))
3		df-xor 1542	. . 3 ⊢ ((𝜓 ⊻ 𝜒) ↔ ¬ (𝜓 ↔ 𝜒))
4	3	bibi2i 340	. 2 ⊢ ((𝜑 ↔ (𝜓 ⊻ 𝜒)) ↔ (𝜑 ↔ ¬ (𝜓 ↔ 𝜒)))
5		df-xor 1542	. 2 ⊢ ((𝜑 ⊻ (𝜓 ↔ 𝜒)) ↔ ¬ (𝜑 ↔ (𝜓 ↔ 𝜒)))
6	2, 4, 5	3bitr4i 306	1 ⊢ ((𝜑 ↔ (𝜓 ⊻ 𝜒)) ↔ (𝜑 ⊻ (𝜓 ↔ 𝜒)))

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ⊻ wxo 1541

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This proof depends on definitions:  df-bi 210  df-xor 1542

This theorem is used by: (None)