Theorem elsymdifxor 4213

Description: Membership in a symmetric difference is an exclusive-or relationship. (Contributed by David A. Wheeler, 26-Apr-2020.) (Proof shortened by BJ, 13-Aug-2022.)

Assertion

Ref	Expression
elsymdifxor	⊢ (𝐴 ∈ (𝐵 △ 𝐶) ↔ (𝐴 ∈ 𝐵 ⊻ 𝐴 ∈ 𝐶))

Proof of Theorem elsymdifxor

Step	Hyp	Ref	Expression
1		elsymdif 4211	. 2 ⊢ (𝐴 ∈ (𝐵 △ 𝐶) ↔ ¬ (𝐴 ∈ 𝐵 ↔ 𝐴 ∈ 𝐶))
2		df-xor 1542	. 2 ⊢ ((𝐴 ∈ 𝐵 ⊻ 𝐴 ∈ 𝐶) ↔ ¬ (𝐴 ∈ 𝐵 ↔ 𝐴 ∈ 𝐶))
3	1, 2	bitr4i 281	1 ⊢ (𝐴 ∈ (𝐵 △ 𝐶) ↔ (𝐴 ∈ 𝐵 ⊻ 𝐴 ∈ 𝐶))

Syntax hints:  ¬ wn 3   ↔ wb 209   ⊻ wxo 1541   ∈ wcel 2143   △ csymdif 4205

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-xor 1542  df-tru 1573  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-v 3457  df-dif 3908  df-un 3910  df-symdif 4206

This theorem is referenced by:  dfsymdif2  4214  symdifass  4215