| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > indif2 | Structured version Visualization version GIF version | ||
| Description: Bring an intersection in and out of a class difference. (Contributed by Jeff Hankins, 15-Jul-2009.) |
| Ref | Expression |
|---|---|
| indif2 | ⊢ (𝐴 ∩ (𝐵 ∖ 𝐶)) = ((𝐴 ∩ 𝐵) ∖ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | inass 4127 | . 2 ⊢ ((𝐴 ∩ 𝐵) ∩ (V ∖ 𝐶)) = (𝐴 ∩ (𝐵 ∩ (V ∖ 𝐶))) | |
| 2 | invdif 4227 | . 2 ⊢ ((𝐴 ∩ 𝐵) ∩ (V ∖ 𝐶)) = ((𝐴 ∩ 𝐵) ∖ 𝐶) | |
| 3 | invdif 4227 | . . 3 ⊢ (𝐵 ∩ (V ∖ 𝐶)) = (𝐵 ∖ 𝐶) | |
| 4 | 3 | ineq2i 4117 | . 2 ⊢ (𝐴 ∩ (𝐵 ∩ (V ∖ 𝐶))) = (𝐴 ∩ (𝐵 ∖ 𝐶)) |
| 5 | 1, 2, 4 | 3eqtr3ri 2795 | 1 ⊢ (𝐴 ∩ (𝐵 ∖ 𝐶)) = ((𝐴 ∩ 𝐵) ∖ 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 Vcvv 3454 ∖ cdif 4048 ∩ cin 4092 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-rab 3417 df-v 3456 df-dif 4050 df-in 4094 |
| This theorem is used by: indif1 4230 indifcom 4231 rabdif 4269 inssdif0 4325 frpoind 6360 marypha1lem 9449 frind 9778 difopn 23379 restcld 23517 difmbl 25891 voliunlem1 25898 difuncomp 33217 imadifxp 33264 psrbasfsupp 34210 difelcarsg 35009 carsgclctunlem1 35016 topbnd 37289 bj-disj2r 38118 nlpineqsn 38522 mblfinlem3 38768 mblfinlem4 38769 dmxrncnvepres2 39556 gneispace 45324 saldifcl2 47541 caragenuncllem 47725 carageniuncllem1 47734 iscnrm3rlem1 50257 |
| Copyright terms: Public domain | W3C validator |