| 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 4181 | . . . 4 ⊢ ((𝐴 ∩ (V ∖ 𝐵)) ∩ (V ∖ 𝐶)) = (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) | |
| 2 | invdif 4232 | . . . 4 ⊢ ((𝐴 ∩ (V ∖ 𝐵)) ∩ (V ∖ 𝐶)) = ((𝐴 ∩ (V ∖ 𝐵)) ∖ 𝐶) | |
| 3 | 1, 2 | eqtr3i 2762 | . . 3 ⊢ (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) = ((𝐴 ∩ (V ∖ 𝐵)) ∖ 𝐶) |
| 4 | undm 4250 | . . . . 5 ⊢ (V ∖ (𝐵 ∪ 𝐶)) = ((V ∖ 𝐵) ∩ (V ∖ 𝐶)) | |
| 5 | 4 | ineq2i 4170 | . . . 4 ⊢ (𝐴 ∩ (V ∖ (𝐵 ∪ 𝐶))) = (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) |
| 6 | invdif 4232 | . . . 4 ⊢ (𝐴 ∩ (V ∖ (𝐵 ∪ 𝐶))) = (𝐴 ∖ (𝐵 ∪ 𝐶)) | |
| 7 | 5, 6 | eqtr3i 2762 | . . 3 ⊢ (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) = (𝐴 ∖ (𝐵 ∪ 𝐶)) |
| 8 | 3, 7 | eqtr3i 2762 | . 2 ⊢ ((𝐴 ∩ (V ∖ 𝐵)) ∖ 𝐶) = (𝐴 ∖ (𝐵 ∪ 𝐶)) |
| 9 | invdif 4232 | . . 3 ⊢ (𝐴 ∩ (V ∖ 𝐵)) = (𝐴 ∖ 𝐵) | |
| 10 | 9 | difeq1i 4075 | . 2 ⊢ ((𝐴 ∩ (V ∖ 𝐵)) ∖ 𝐶) = ((𝐴 ∖ 𝐵) ∖ 𝐶) |
| 11 | 8, 10 | eqtr3i 2762 | 1 ⊢ (𝐴 ∖ (𝐵 ∪ 𝐶)) = ((𝐴 ∖ 𝐵) ∖ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 Vcvv 3441 ∖ cdif 3899 ∪ cun 3900 ∩ cin 3901 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3401 df-v 3443 df-dif 3905 df-un 3907 df-in 3909 |
| This theorem is referenced by: dif32 4255 difabs 4256 difpr 4760 infdiffi 9572 mreexexlem4d 17575 nulmbl2 25498 unmbl 25499 caragenuncllem 46833 |
| Copyright terms: Public domain | W3C validator |