Theorem brsymdif 5158

Description: Characterization of the symmetric difference of two binary relations. The RHS could also be expressed using exclusive disjunction df-xor 1541. (Contributed by Scott Fenton, 11-Apr-2012.)

Assertion

Ref	Expression
brsymdif	⊢ (𝐴(𝑅 △ 𝑆)𝐵 ↔ ¬ (𝐴𝑅𝐵 ↔ 𝐴𝑆𝐵))

Proof of Theorem brsymdif

Step	Hyp	Ref	Expression
1		df-br 5103	. 2 ⊢ (𝐴(𝑅 △ 𝑆)𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ (𝑅 △ 𝑆))
2		elsymdif 4202	. . 3 ⊢ (⟨𝐴, 𝐵⟩ ∈ (𝑅 △ 𝑆) ↔ ¬ (⟨𝐴, 𝐵⟩ ∈ 𝑅 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑆))
3		df-br 5103	. . . 4 ⊢ (𝐴𝑅𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑅)
4		df-br 5103	. . . 4 ⊢ (𝐴𝑆𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑆)
5	3, 4	bibi12i 342	. . 3 ⊢ ((𝐴𝑅𝐵 ↔ 𝐴𝑆𝐵) ↔ (⟨𝐴, 𝐵⟩ ∈ 𝑅 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑆))
6	2, 5	xchbinxr 338	. 2 ⊢ (⟨𝐴, 𝐵⟩ ∈ (𝑅 △ 𝑆) ↔ ¬ (𝐴𝑅𝐵 ↔ 𝐴𝑆𝐵))
7	1, 6	bitri 278	1 ⊢ (𝐴(𝑅 △ 𝑆)𝐵 ↔ ¬ (𝐴𝑅𝐵 ↔ 𝐴𝑆𝐵))

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∈ wcel 2144   △ csymdif 4196  ⟨cop 4834   class class class wbr 5102

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-dif 4046  df-un 4150  df-symdif 4197  df-br 5103

This theorem is used by:  brtxpsd  36780