![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > brsymdif | Structured version Visualization version GIF version |
Description: Characterization of the symmetric difference of two binary relations. (Contributed by Scott Fenton, 11-Apr-2012.) |
Ref | Expression |
---|---|
brsymdif | ⊢ (𝐴(𝑅 △ 𝑆)𝐵 ↔ ¬ (𝐴𝑅𝐵 ↔ 𝐴𝑆𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-br 5149 | . 2 ⊢ (𝐴(𝑅 △ 𝑆)𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ (𝑅 △ 𝑆)) | |
2 | elsymdif 4247 | . . 3 ⊢ (⟨𝐴, 𝐵⟩ ∈ (𝑅 △ 𝑆) ↔ ¬ (⟨𝐴, 𝐵⟩ ∈ 𝑅 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑆)) | |
3 | df-br 5149 | . . . 4 ⊢ (𝐴𝑅𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑅) | |
4 | df-br 5149 | . . . 4 ⊢ (𝐴𝑆𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑆) | |
5 | 3, 4 | bibi12i 339 | . . 3 ⊢ ((𝐴𝑅𝐵 ↔ 𝐴𝑆𝐵) ↔ (⟨𝐴, 𝐵⟩ ∈ 𝑅 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑆)) |
6 | 2, 5 | xchbinxr 334 | . 2 ⊢ (⟨𝐴, 𝐵⟩ ∈ (𝑅 △ 𝑆) ↔ ¬ (𝐴𝑅𝐵 ↔ 𝐴𝑆𝐵)) |
7 | 1, 6 | bitri 274 | 1 ⊢ (𝐴(𝑅 △ 𝑆)𝐵 ↔ ¬ (𝐴𝑅𝐵 ↔ 𝐴𝑆𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 205 ∈ wcel 2106 △ csymdif 4241 ⟨cop 4634 class class class wbr 5148 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2703 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-tru 1544 df-ex 1782 df-sb 2068 df-clab 2710 df-cleq 2724 df-clel 2810 df-v 3476 df-dif 3951 df-un 3953 df-symdif 4242 df-br 5149 |
This theorem is referenced by: brtxpsd 34935 |
Copyright terms: Public domain | W3C validator |