Theorem symdifass 4211

Description: Symmetric difference is associative. (Contributed by Scott Fenton, 24-Apr-2012.) (Proof shortened by BJ, 7-Sep-2022.)

Assertion

Ref	Expression
symdifass	⊢ ((𝐴 △ 𝐵) △ 𝐶) = (𝐴 △ (𝐵 △ 𝐶))

Proof of Theorem symdifass

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elsymdifxor 4209	. . 3 ⊢ (𝑥 ∈ ((𝐴 △ 𝐵) △ 𝐶) ↔ (𝑥 ∈ (𝐴 △ 𝐵) ⊻ 𝑥 ∈ 𝐶))
2		elsymdifxor 4209	. . . . 5 ⊢ (𝑥 ∈ (𝐴 △ 𝐵) ↔ (𝑥 ∈ 𝐴 ⊻ 𝑥 ∈ 𝐵))
3		biid 264	. . . . 5 ⊢ (𝑥 ∈ 𝐶 ↔ 𝑥 ∈ 𝐶)
4	2, 3	xorbi12i 1554	. . . 4 ⊢ ((𝑥 ∈ (𝐴 △ 𝐵) ⊻ 𝑥 ∈ 𝐶) ↔ ((𝑥 ∈ 𝐴 ⊻ 𝑥 ∈ 𝐵) ⊻ 𝑥 ∈ 𝐶))
5		xorass 1545	. . . 4 ⊢ (((𝑥 ∈ 𝐴 ⊻ 𝑥 ∈ 𝐵) ⊻ 𝑥 ∈ 𝐶) ↔ (𝑥 ∈ 𝐴 ⊻ (𝑥 ∈ 𝐵 ⊻ 𝑥 ∈ 𝐶)))
6		biid 264	. . . . 5 ⊢ (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐴)
7		elsymdifxor 4209	. . . . . 6 ⊢ (𝑥 ∈ (𝐵 △ 𝐶) ↔ (𝑥 ∈ 𝐵 ⊻ 𝑥 ∈ 𝐶))
8	7	bicomi 227	. . . . 5 ⊢ ((𝑥 ∈ 𝐵 ⊻ 𝑥 ∈ 𝐶) ↔ 𝑥 ∈ (𝐵 △ 𝐶))
9	6, 8	xorbi12i 1554	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ⊻ (𝑥 ∈ 𝐵 ⊻ 𝑥 ∈ 𝐶)) ↔ (𝑥 ∈ 𝐴 ⊻ 𝑥 ∈ (𝐵 △ 𝐶)))
10	4, 5, 9	3bitri 300	. . 3 ⊢ ((𝑥 ∈ (𝐴 △ 𝐵) ⊻ 𝑥 ∈ 𝐶) ↔ (𝑥 ∈ 𝐴 ⊻ 𝑥 ∈ (𝐵 △ 𝐶)))
11		elsymdifxor 4209	. . . 4 ⊢ (𝑥 ∈ (𝐴 △ (𝐵 △ 𝐶)) ↔ (𝑥 ∈ 𝐴 ⊻ 𝑥 ∈ (𝐵 △ 𝐶)))
12	11	bicomi 227	. . 3 ⊢ ((𝑥 ∈ 𝐴 ⊻ 𝑥 ∈ (𝐵 △ 𝐶)) ↔ 𝑥 ∈ (𝐴 △ (𝐵 △ 𝐶)))
13	1, 10, 12	3bitri 300	. 2 ⊢ (𝑥 ∈ ((𝐴 △ 𝐵) △ 𝐶) ↔ 𝑥 ∈ (𝐴 △ (𝐵 △ 𝐶)))
14	13	eqriv 2759	1 ⊢ ((𝐴 △ 𝐵) △ 𝐶) = (𝐴 △ (𝐵 △ 𝐶))

This proof depends on syntax axioms:   ⊻ wxo 1541   = wceq 1570   ∈ wcel 2145   △ csymdif 4201

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-xor 1542  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-v 3455  df-dif 3905  df-un 3907  df-symdif 4202

This theorem is used by: (None)