![]() |
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 4283 | . 2 ⊢ (𝐶 ∩ (𝐴 ∖ 𝐵)) = ((𝐶 ∩ 𝐴) ∖ (𝐶 ∩ 𝐵)) | |
2 | incom 4201 | . 2 ⊢ ((𝐴 ∖ 𝐵) ∩ 𝐶) = (𝐶 ∩ (𝐴 ∖ 𝐵)) | |
3 | incom 4201 | . . 3 ⊢ (𝐴 ∩ 𝐶) = (𝐶 ∩ 𝐴) | |
4 | incom 4201 | . . 3 ⊢ (𝐵 ∩ 𝐶) = (𝐶 ∩ 𝐵) | |
5 | 3, 4 | difeq12i 4120 | . 2 ⊢ ((𝐴 ∩ 𝐶) ∖ (𝐵 ∩ 𝐶)) = ((𝐶 ∩ 𝐴) ∖ (𝐶 ∩ 𝐵)) |
6 | 1, 2, 5 | 3eqtr4i 2769 | 1 ⊢ ((𝐴 ∖ 𝐵) ∩ 𝐶) = ((𝐴 ∩ 𝐶) ∖ (𝐵 ∩ 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1540 ∖ cdif 3945 ∩ cin 3947 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-ext 2702 |
This theorem depends on definitions: df-bi 206 df-an 396 df-tru 1543 df-ex 1781 df-sb 2067 df-clab 2709 df-cleq 2723 df-clel 2809 df-rab 3432 df-v 3475 df-dif 3951 df-in 3955 |
This theorem is referenced by: resdifdir 6236 preddif 6330 fresaun 6762 uniioombllem4 25435 subsalsal 45534 |
Copyright terms: Public domain | W3C validator |