![]() |
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 4504 | . 2 ⊢ ((𝐴 ∪ 𝐵) ∖ 𝐵) = (𝐴 ∖ 𝐵) | |
2 | disjdif2 4503 | . 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝐴 ∖ 𝐵) = 𝐴) | |
3 | 1, 2 | eqtrid 2792 | 1 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 ∪ 𝐵) ∖ 𝐵) = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∖ cdif 3973 ∪ cun 3974 ∩ cin 3975 ∅c0 4352 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-tru 1540 df-fal 1550 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-in 3983 df-nul 4353 |
This theorem is referenced by: fressupp 32700 sucdifsn2 38193 |
Copyright terms: Public domain | W3C validator |