| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > difabs | 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 3434 | . 2 ⊢ (𝐴 ∖ (𝐵 ∪ 𝐵)) = ((𝐴 ∖ 𝐵) ∖ 𝐵) | |
| 2 | unidm 3317 | . . 3 ⊢ (𝐵 ∪ 𝐵) = 𝐵 | |
| 3 | 2 | difeq2i 3289 | . 2 ⊢ (𝐴 ∖ (𝐵 ∪ 𝐵)) = (𝐴 ∖ 𝐵) |
| 4 | 1, 3 | eqtr3i 2229 | 1 ⊢ ((𝐴 ∖ 𝐵) ∖ 𝐵) = (𝐴 ∖ 𝐵) |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1373 ∖ cdif 3164 ∪ cun 3165 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-ext 2188 |
| This theorem depends on definitions: df-bi 117 df-tru 1376 df-nf 1485 df-sb 1787 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ral 2490 df-rab 2494 df-v 2775 df-dif 3169 df-un 3171 df-in 3173 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |