| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > disjdif2 | Structured version Visualization version GIF version | ||
| Description: The difference of a class and a class disjoint from it is the original class. (Contributed by BJ, 21-Apr-2019.) |
| Ref | Expression |
|---|---|
| disjdif2 | ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝐴 ∖ 𝐵) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | difeq2 4075 | . 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝐴 ∖ (𝐴 ∩ 𝐵)) = (𝐴 ∖ ∅)) | |
| 2 | difin 4225 | . 2 ⊢ (𝐴 ∖ (𝐴 ∩ 𝐵)) = (𝐴 ∖ 𝐵) | |
| 3 | dif0 4334 | . 2 ⊢ (𝐴 ∖ ∅) = 𝐴 | |
| 4 | 1, 2, 3 | 3eqtr3g 2823 | 1 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝐴 ∖ 𝐵) = 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∖ cdif 3903 ∩ cin 3905 ∅c0 4286 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-rab 3419 df-v 3459 df-dif 3909 df-in 3913 df-nul 4287 |
| This theorem is used by: undif5 4447 opwo0id 5482 setsfun0 17256 cnfldfun 21588 ptbasfi 23791 ltslpss 28154 leslss 28155 fzdif2 33207 fzodif2 33208 chtvalz 35083 bj-2upln1upl 37719 disjresdif 38954 dvrelog2 42891 dvrelog3 42892 readvrec2 43182 readvrec 43183 gneispace 44920 dvmptfprodlem 46718 |
| Copyright terms: Public domain | W3C validator |