| 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 4180 | . . 3 ⊢ (𝐴 ∩ 𝐴) = 𝐴 | |
| 2 | 1 | ineq1i 4170 | . 2 ⊢ ((𝐴 ∩ 𝐴) ∩ (𝐵 ∩ 𝐶)) = (𝐴 ∩ (𝐵 ∩ 𝐶)) |
| 3 | in4 4187 | . 2 ⊢ ((𝐴 ∩ 𝐴) ∩ (𝐵 ∩ 𝐶)) = ((𝐴 ∩ 𝐵) ∩ (𝐴 ∩ 𝐶)) | |
| 4 | 2, 3 | eqtr3i 2789 | 1 ⊢ (𝐴 ∩ (𝐵 ∩ 𝐶)) = ((𝐴 ∩ 𝐵) ∩ (𝐴 ∩ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1562 ∩ cin 3905 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-ext 2736 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-tru 1565 df-ex 1802 df-sb 2093 df-clab 2743 df-cleq 2756 df-clel 2839 df-rab 3417 df-v 3458 df-in 3913 |
| This theorem is referenced by: difundi 4244 dfif5 4499 resindi 5983 offres 7966 incexclem 15868 bitsinv1 16478 bitsinvp1 16485 bitsres 16509 fh1 31823 |
| Copyright terms: Public domain | W3C validator |