Theorem symdifass 4178

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 4176	. . 3 ⊢ (𝑥 ∈ ((𝐴 △ 𝐵) △ 𝐶) ↔ (𝑥 ∈ (𝐴 △ 𝐵) ⊻ 𝑥 ∈ 𝐶))
2		elsymdifxor 4176	. . . . 5 ⊢ (𝑥 ∈ (𝐴 △ 𝐵) ↔ (𝑥 ∈ 𝐴 ⊻ 𝑥 ∈ 𝐵))
3		biid 264	. . . . 5 ⊢ (𝑥 ∈ 𝐶 ↔ 𝑥 ∈ 𝐶)
4	2, 3	xorbi12i 1516	. . . 4 ⊢ ((𝑥 ∈ (𝐴 △ 𝐵) ⊻ 𝑥 ∈ 𝐶) ↔ ((𝑥 ∈ 𝐴 ⊻ 𝑥 ∈ 𝐵) ⊻ 𝑥 ∈ 𝐶))
5		xorass 1507	. . . 4 ⊢ (((𝑥 ∈ 𝐴 ⊻ 𝑥 ∈ 𝐵) ⊻ 𝑥 ∈ 𝐶) ↔ (𝑥 ∈ 𝐴 ⊻ (𝑥 ∈ 𝐵 ⊻ 𝑥 ∈ 𝐶)))
6		biid 264	. . . . 5 ⊢ (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐴)
7		elsymdifxor 4176	. . . . . 6 ⊢ (𝑥 ∈ (𝐵 △ 𝐶) ↔ (𝑥 ∈ 𝐵 ⊻ 𝑥 ∈ 𝐶))
8	7	bicomi 227	. . . . 5 ⊢ ((𝑥 ∈ 𝐵 ⊻ 𝑥 ∈ 𝐶) ↔ 𝑥 ∈ (𝐵 △ 𝐶))
9	6, 8	xorbi12i 1516	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ⊻ (𝑥 ∈ 𝐵 ⊻ 𝑥 ∈ 𝐶)) ↔ (𝑥 ∈ 𝐴 ⊻ 𝑥 ∈ (𝐵 △ 𝐶)))
10	4, 5, 9	3bitri 300	. . 3 ⊢ ((𝑥 ∈ (𝐴 △ 𝐵) ⊻ 𝑥 ∈ 𝐶) ↔ (𝑥 ∈ 𝐴 ⊻ 𝑥 ∈ (𝐵 △ 𝐶)))
11		elsymdifxor 4176	. . . 4 ⊢ (𝑥 ∈ (𝐴 △ (𝐵 △ 𝐶)) ↔ (𝑥 ∈ 𝐴 ⊻ 𝑥 ∈ (𝐵 △ 𝐶)))
12	11	bicomi 227	. . 3 ⊢ ((𝑥 ∈ 𝐴 ⊻ 𝑥 ∈ (𝐵 △ 𝐶)) ↔ 𝑥 ∈ (𝐴 △ (𝐵 △ 𝐶)))
13	1, 10, 12	3bitri 300	. 2 ⊢ (𝑥 ∈ ((𝐴 △ 𝐵) △ 𝐶) ↔ 𝑥 ∈ (𝐴 △ (𝐵 △ 𝐶)))
14	13	eqriv 2795	1 ⊢ ((𝐴 △ 𝐵) △ 𝐶) = (𝐴 △ (𝐵 △ 𝐶))

Syntax hints:   ⊻ wxo 1502   = wceq 1538   ∈ wcel 2111   △ csymdif 4168

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-ext 2770

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-xor 1503  df-ex 1782  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-v 3443  df-dif 3884  df-un 3886  df-symdif 4169

This theorem is referenced by: (None)