| 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 4180 | . . . 4 ⊢ ((𝐴 ∩ (V ∖ 𝐵)) ∩ (V ∖ 𝐶)) = (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) | |
| 2 | invdif 4232 | . . . 4 ⊢ ((𝐴 ∩ (V ∖ 𝐵)) ∩ (V ∖ 𝐶)) = ((𝐴 ∩ (V ∖ 𝐵)) ∖ 𝐶) | |
| 3 | 1, 2 | eqtr3i 2788 | . . 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 2788 | . . 3 ⊢ (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) = (𝐴 ∖ (𝐵 ∪ 𝐶)) |
| 8 | 3, 7 | eqtr3i 2788 | . 2 ⊢ ((𝐴 ∩ (V ∖ 𝐵)) ∖ 𝐶) = (𝐴 ∖ (𝐵 ∪ 𝐶)) |
| 9 | invdif 4232 | . . 3 ⊢ (𝐴 ∩ (V ∖ 𝐵)) = (𝐴 ∖ 𝐵) | |
| 10 | 9 | difeq1i 4077 | . 2 ⊢ ((𝐴 ∩ (V ∖ 𝐵)) ∖ 𝐶) = ((𝐴 ∖ 𝐵) ∖ 𝐶) |
| 11 | 8, 10 | eqtr3i 2788 | 1 ⊢ (𝐴 ∖ (𝐵 ∪ 𝐶)) = ((𝐴 ∖ 𝐵) ∖ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1561 Vcvv 3455 ∖ cdif 3902 ∪ cun 3903 ∩ cin 3904 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-tru 1564 df-ex 1801 df-sb 2092 df-clab 2742 df-cleq 2755 df-clel 2838 df-rab 3416 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 |
| This theorem is referenced by: dif32 4255 difabs 4256 difpr 4764 infdiffi 9611 mreexexlem4d 17689 nulmbl2 25605 unmbl 25606 caragenuncllem 47077 |
| Copyright terms: Public domain | W3C validator |