| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > difun1 | Structured version Visualization version GIF version | ||
| Description: A relationship involving double difference and union. (Contributed by NM, 29-Aug-2004.) |
| Ref | Expression |
|---|---|
| difun1 | ⊢ (𝐴 ∖ (𝐵 ∪ 𝐶)) = ((𝐴 ∖ 𝐵) ∖ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | inass 4170 | . . . 4 ⊢ ((𝐴 ∩ (V ∖ 𝐵)) ∩ (V ∖ 𝐶)) = (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) | |
| 2 | invdif 4222 | . . . 4 ⊢ ((𝐴 ∩ (V ∖ 𝐵)) ∩ (V ∖ 𝐶)) = ((𝐴 ∩ (V ∖ 𝐵)) ∖ 𝐶) | |
| 3 | 1, 2 | eqtr3i 2777 | . . 3 ⊢ (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) = ((𝐴 ∩ (V ∖ 𝐵)) ∖ 𝐶) |
| 4 | undm 4240 | . . . . 5 ⊢ (V ∖ (𝐵 ∪ 𝐶)) = ((V ∖ 𝐵) ∩ (V ∖ 𝐶)) | |
| 5 | 4 | ineq2i 4160 | . . . 4 ⊢ (𝐴 ∩ (V ∖ (𝐵 ∪ 𝐶))) = (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) |
| 6 | invdif 4222 | . . . 4 ⊢ (𝐴 ∩ (V ∖ (𝐵 ∪ 𝐶))) = (𝐴 ∖ (𝐵 ∪ 𝐶)) | |
| 7 | 5, 6 | eqtr3i 2777 | . . 3 ⊢ (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) = (𝐴 ∖ (𝐵 ∪ 𝐶)) |
| 8 | 3, 7 | eqtr3i 2777 | . 2 ⊢ ((𝐴 ∩ (V ∖ 𝐵)) ∖ 𝐶) = (𝐴 ∖ (𝐵 ∪ 𝐶)) |
| 9 | invdif 4222 | . . 3 ⊢ (𝐴 ∩ (V ∖ 𝐵)) = (𝐴 ∖ 𝐵) | |
| 10 | 9 | difeq1i 4067 | . 2 ⊢ ((𝐴 ∩ (V ∖ 𝐵)) ∖ 𝐶) = ((𝐴 ∖ 𝐵) ∖ 𝐶) |
| 11 | 8, 10 | eqtr3i 2777 | 1 ⊢ (𝐴 ∖ (𝐵 ∪ 𝐶)) = ((𝐴 ∖ 𝐵) ∖ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1550 Vcvv 3444 ∖ cdif 3892 ∪ cun 3893 ∩ cin 3894 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-ext 2724 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-tru 1553 df-ex 1790 df-sb 2081 df-clab 2731 df-cleq 2744 df-clel 2827 df-rab 3405 df-v 3446 df-dif 3898 df-un 3900 df-in 3902 |
| This theorem is referenced by: dif32 4245 difabs 4246 difpr 4753 infdiffi 9599 mreexexlem4d 17651 nulmbl2 25567 unmbl 25568 caragenuncllem 47024 |
| Copyright terms: Public domain | W3C validator |