| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > undif5 | Structured version Visualization version GIF version | ||
| Description: An equality involving class union and class difference. (Contributed by Thierry Arnoux, 26-Jun-2024.) |
| Ref | Expression |
|---|---|
| undif5 | ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 ∪ 𝐵) ∖ 𝐵) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | difun2 4409 | . 2 ⊢ ((𝐴 ∪ 𝐵) ∖ 𝐵) = (𝐴 ∖ 𝐵) | |
| 2 | disjdif2 4408 | . 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝐴 ∖ 𝐵) = 𝐴) | |
| 3 | 1, 2 | eqtrid 2786 | 1 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 ∪ 𝐵) ∖ 𝐵) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1547 ∖ cdif 3880 ∪ cun 3881 ∩ cin 3882 ∅c0 4261 |
| 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 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-in 3890 df-nul 4262 |
| This theorem is referenced by: cyclnumvtx 29886 fressupp 32780 nn0diffz0 32886 elrgspnlem4 33326 mplidomlem 33711 vieta 33764 sucdifsn2 38852 |
| Copyright terms: Public domain | W3C validator |