| 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 4068 | . 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝐴 ∖ (𝐴 ∩ 𝐵)) = (𝐴 ∖ ∅)) | |
| 2 | difin 4218 | . 2 ⊢ (𝐴 ∖ (𝐴 ∩ 𝐵)) = (𝐴 ∖ 𝐵) | |
| 3 | dif0 4327 | . 2 ⊢ (𝐴 ∖ ∅) = 𝐴 | |
| 4 | 1, 2, 3 | 3eqtr3g 2818 | 1 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝐴 ∖ 𝐵) = 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∖ cdif 3896 ∩ cin 3898 ∅c0 4279 |
| 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 2147 ax-9 2155 ax-ext 2732 |
| 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 2739 df-cleq 2752 df-clel 2835 df-rab 3413 df-v 3452 df-dif 3902 df-in 3906 df-nul 4280 |
| This theorem is used by: undif5 4440 opwo0id 5474 setsfun0 17265 cnfldfun 21600 ptbasfi 23808 ltslpss 28174 leslss 28175 fzdif2 33262 fzodif2 33263 chtvalz 35138 bj-2upln1upl 37769 disjresdif 38994 dvrelog2 42931 dvrelog3 42932 readvrec2 43237 readvrec 43238 gneispace 44975 dvmptfprodlem 46773 |
| Copyright terms: Public domain | W3C validator |