| 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 4249 | . 2 ⊢ (𝐴 ∖ (𝐵 ∪ 𝐵)) = ((𝐴 ∖ 𝐵) ∖ 𝐵) | |
| 2 | unidm 4108 | . . 3 ⊢ (𝐵 ∪ 𝐵) = 𝐵 | |
| 3 | 2 | difeq2i 4075 | . 2 ⊢ (𝐴 ∖ (𝐵 ∪ 𝐵)) = (𝐴 ∖ 𝐵) |
| 4 | 1, 3 | eqtr3i 2786 | 1 ⊢ ((𝐴 ∖ 𝐵) ∖ 𝐵) = (𝐴 ∖ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1559 ∖ cdif 3899 ∪ cun 3900 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-tru 1562 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-rab 3414 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 |
| This theorem is referenced by: axcclem 10408 lpdifsn 23191 compne 44977 |
| Copyright terms: Public domain | W3C validator |