| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > indifdir | Structured version Visualization version GIF version | ||
| Description: Distribute intersection over difference. (Contributed by Scott Fenton, 14-Apr-2011.) (Revised by BTernaryTau, 14-Aug-2024.) |
| Ref | Expression |
|---|---|
| indifdir | ⊢ ((𝐴 ∖ 𝐵) ∩ 𝐶) = ((𝐴 ∩ 𝐶) ∖ (𝐵 ∩ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | indifdi 4241 | . 2 ⊢ (𝐶 ∩ (𝐴 ∖ 𝐵)) = ((𝐶 ∩ 𝐴) ∖ (𝐶 ∩ 𝐵)) | |
| 2 | incom 4108 | . 2 ⊢ ((𝐴 ∖ 𝐵) ∩ 𝐶) = (𝐶 ∩ (𝐴 ∖ 𝐵)) | |
| 3 | incom 4108 | . . 3 ⊢ (𝐴 ∩ 𝐶) = (𝐶 ∩ 𝐴) | |
| 4 | incom 4108 | . . 3 ⊢ (𝐵 ∩ 𝐶) = (𝐶 ∩ 𝐵) | |
| 5 | 3, 4 | difeq12i 4063 | . 2 ⊢ ((𝐴 ∩ 𝐶) ∖ (𝐵 ∩ 𝐶)) = ((𝐶 ∩ 𝐴) ∖ (𝐶 ∩ 𝐵)) |
| 6 | 1, 2, 5 | 3eqtr4i 2796 | 1 ⊢ ((𝐴 ∖ 𝐵) ∩ 𝐶) = ((𝐴 ∩ 𝐶) ∖ (𝐵 ∩ 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 ∖ cdif 4047 ∩ cin 4091 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1572 df-ex 1812 df-sb 2101 df-clab 2742 df-cleq 2755 df-clel 2838 df-rab 3416 df-v 3455 df-dif 4049 df-in 4093 |
| This theorem is used by: resdifdir 6244 preddif 6338 fresaun 6761 uniioombllem4 25919 subsalsal 47508 |
| Copyright terms: Public domain | W3C validator |