| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > undifabs | Structured version Visualization version GIF version | ||
| Description: Absorption of difference by union. (Contributed by NM, 18-Aug-2013.) |
| Ref | Expression |
|---|---|
| undifabs | ⊢ (𝐴 ∪ (𝐴 ∖ 𝐵)) = 𝐴 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | undif3 4250 | . 2 ⊢ (𝐴 ∪ (𝐴 ∖ 𝐵)) = ((𝐴 ∪ 𝐴) ∖ (𝐵 ∖ 𝐴)) | |
| 2 | unidm 4108 | . . 3 ⊢ (𝐴 ∪ 𝐴) = 𝐴 | |
| 3 | 2 | difeq1i 4074 | . 2 ⊢ ((𝐴 ∪ 𝐴) ∖ (𝐵 ∖ 𝐴)) = (𝐴 ∖ (𝐵 ∖ 𝐴)) |
| 4 | difdif 4086 | . 2 ⊢ (𝐴 ∖ (𝐵 ∖ 𝐴)) = 𝐴 | |
| 5 | 1, 3, 4 | 3eqtri 2788 | 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 |
| This theorem is referenced by: dfif5 4494 indifundif 32683 dfsucmap3 38923 |
| Copyright terms: Public domain | W3C validator |