| 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 4125 | . . 3 ⊢ (𝐴 ∩ 𝐴) = 𝐴 | |
| 2 | 1 | ineq1i 4115 | . 2 ⊢ ((𝐴 ∩ 𝐴) ∩ (𝐵 ∩ 𝐶)) = (𝐴 ∩ (𝐵 ∩ 𝐶)) |
| 3 | in4 4132 | . 2 ⊢ ((𝐴 ∩ 𝐴) ∩ (𝐵 ∩ 𝐶)) = ((𝐴 ∩ 𝐵) ∩ (𝐴 ∩ 𝐶)) | |
| 4 | 2, 3 | eqtr3i 2791 | 1 ⊢ (𝐴 ∩ (𝐵 ∩ 𝐶)) = ((𝐴 ∩ 𝐵) ∩ (𝐴 ∩ 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1572 ∩ cin 4091 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1575 df-ex 1815 df-sb 2104 df-clab 2745 df-cleq 2758 df-clel 2842 df-rab 3416 df-v 3455 df-in 4093 |
| This theorem is used by: difundi 4237 dfif5 4501 resindi 6001 offres 8028 incexclem 16048 bitsinv1 16654 bitsinvp1 16661 bitsres 16685 fh1 32279 |
| Copyright terms: Public domain | W3C validator |