| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > difabs | Structured version Visualization version GIF version | ||
| Description: Absorption-like law for class difference: you can remove a class only once. (Contributed by FL, 2-Aug-2009.) |
| Ref | Expression |
|---|---|
| difabs | ⊢ ((𝐴 ∖ 𝐵) ∖ 𝐵) = (𝐴 ∖ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | difun1 4245 | . 2 ⊢ (𝐴 ∖ (𝐵 ∪ 𝐵)) = ((𝐴 ∖ 𝐵) ∖ 𝐵) | |
| 2 | unidm 4104 | . . 3 ⊢ (𝐵 ∪ 𝐵) = 𝐵 | |
| 3 | 2 | difeq2i 4071 | . 2 ⊢ (𝐴 ∖ (𝐵 ∪ 𝐵)) = (𝐴 ∖ 𝐵) |
| 4 | 1, 3 | eqtr3i 2785 | 1 ⊢ ((𝐴 ∖ 𝐵) ∖ 𝐵) = (𝐴 ∖ 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∖ cdif 3896 ∪ cun 3897 |
| 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-or 862 df-tru 1573 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-un 3904 df-in 3906 |
| This theorem is used by: axcclem 10459 lpdifsn 23368 compne 45264 |
| Copyright terms: Public domain | W3C validator |