Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > brdif | Structured version Visualization version GIF version |
Description: The difference of two binary relations. (Contributed by Scott Fenton, 11-Apr-2011.) |
Ref | Expression |
---|---|
brdif | ⊢ (𝐴(𝑅 ∖ 𝑆)𝐵 ↔ (𝐴𝑅𝐵 ∧ ¬ 𝐴𝑆𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eldif 3902 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ (𝑅 ∖ 𝑆) ↔ (〈𝐴, 𝐵〉 ∈ 𝑅 ∧ ¬ 〈𝐴, 𝐵〉 ∈ 𝑆)) | |
2 | df-br 5080 | . 2 ⊢ (𝐴(𝑅 ∖ 𝑆)𝐵 ↔ 〈𝐴, 𝐵〉 ∈ (𝑅 ∖ 𝑆)) | |
3 | df-br 5080 | . . 3 ⊢ (𝐴𝑅𝐵 ↔ 〈𝐴, 𝐵〉 ∈ 𝑅) | |
4 | df-br 5080 | . . . 4 ⊢ (𝐴𝑆𝐵 ↔ 〈𝐴, 𝐵〉 ∈ 𝑆) | |
5 | 4 | notbii 320 | . . 3 ⊢ (¬ 𝐴𝑆𝐵 ↔ ¬ 〈𝐴, 𝐵〉 ∈ 𝑆) |
6 | 3, 5 | anbi12i 627 | . 2 ⊢ ((𝐴𝑅𝐵 ∧ ¬ 𝐴𝑆𝐵) ↔ (〈𝐴, 𝐵〉 ∈ 𝑅 ∧ ¬ 〈𝐴, 𝐵〉 ∈ 𝑆)) |
7 | 1, 2, 6 | 3bitr4i 303 | 1 ⊢ (𝐴(𝑅 ∖ 𝑆)𝐵 ↔ (𝐴𝑅𝐵 ∧ ¬ 𝐴𝑆𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 205 ∧ wa 396 ∈ wcel 2110 ∖ cdif 3889 〈cop 4573 class class class wbr 5079 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2015 ax-8 2112 ax-9 2120 ax-ext 2711 |
This theorem depends on definitions: df-bi 206 df-an 397 df-tru 1545 df-ex 1787 df-sb 2072 df-clab 2718 df-cleq 2732 df-clel 2818 df-v 3433 df-dif 3895 df-br 5080 |
This theorem is referenced by: fundif 6481 fndmdif 6916 isocnv3 7199 brdifun 8510 dflt2 12881 pltval 18048 ltgov 26956 opeldifid 30934 qtophaus 31782 dftr6 33714 dffr5 33717 fundmpss 33736 slenlt 33951 brsset 34187 dfon3 34190 brtxpsd2 34193 dffun10 34212 elfuns 34213 dfrecs2 34248 dfrdg4 34249 dfint3 34250 brub 34252 broutsideof 34419 brvdif 36396 frege124d 41339 |
Copyright terms: Public domain | W3C validator |