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 5058 | . 2 ⊢ (𝐴(𝑅 △ 𝑆)𝐵 ↔ 〈𝐴, 𝐵〉 ∈ (𝑅 △ 𝑆)) | |
2 | elsymdif 4221 | . . 3 ⊢ (〈𝐴, 𝐵〉 ∈ (𝑅 △ 𝑆) ↔ ¬ (〈𝐴, 𝐵〉 ∈ 𝑅 ↔ 〈𝐴, 𝐵〉 ∈ 𝑆)) | |
3 | df-br 5058 | . . . 4 ⊢ (𝐴𝑅𝐵 ↔ 〈𝐴, 𝐵〉 ∈ 𝑅) | |
4 | df-br 5058 | . . . 4 ⊢ (𝐴𝑆𝐵 ↔ 〈𝐴, 𝐵〉 ∈ 𝑆) | |
5 | 3, 4 | bibi12i 341 | . . 3 ⊢ ((𝐴𝑅𝐵 ↔ 𝐴𝑆𝐵) ↔ (〈𝐴, 𝐵〉 ∈ 𝑅 ↔ 〈𝐴, 𝐵〉 ∈ 𝑆)) |
6 | 2, 5 | xchbinxr 336 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ (𝑅 △ 𝑆) ↔ ¬ (𝐴𝑅𝐵 ↔ 𝐴𝑆𝐵)) |
7 | 1, 6 | bitri 276 | 1 ⊢ (𝐴(𝑅 △ 𝑆)𝐵 ↔ ¬ (𝐴𝑅𝐵 ↔ 𝐴𝑆𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 207 ∈ wcel 2105 △ csymdif 4215 〈cop 4563 class class class wbr 5057 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-v 3494 df-dif 3936 df-un 3938 df-symdif 4216 df-br 5058 |
This theorem is referenced by: brtxpsd 33252 |
Copyright terms: Public domain | W3C validator |