| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > inindi | Structured version Visualization version GIF version | ||
| Description: Intersection distributes over itself. (Contributed by NM, 6-May-1994.) |
| Ref | Expression |
|---|---|
| inindi | ⊢ (𝐴 ∩ (𝐵 ∩ 𝐶)) = ((𝐴 ∩ 𝐵) ∩ (𝐴 ∩ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | inidm 4168 | . . 3 ⊢ (𝐴 ∩ 𝐴) = 𝐴 | |
| 2 | 1 | ineq1i 4157 | . 2 ⊢ ((𝐴 ∩ 𝐴) ∩ (𝐵 ∩ 𝐶)) = (𝐴 ∩ (𝐵 ∩ 𝐶)) |
| 3 | in4 4175 | . 2 ⊢ ((𝐴 ∩ 𝐴) ∩ (𝐵 ∩ 𝐶)) = ((𝐴 ∩ 𝐵) ∩ (𝐴 ∩ 𝐶)) | |
| 4 | 2, 3 | eqtr3i 2762 | 1 ⊢ (𝐴 ∩ (𝐵 ∩ 𝐶)) = ((𝐴 ∩ 𝐵) ∩ (𝐴 ∩ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∩ cin 3889 |
| 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-tru 1545 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3391 df-v 3432 df-in 3897 |
| This theorem is referenced by: difundi 4231 dfif5 4484 resindi 5956 offres 7931 incexclem 15796 bitsinv1 16406 bitsinvp1 16413 bitsres 16437 fh1 31708 |
| Copyright terms: Public domain | W3C validator |