| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > in12 | Structured version Visualization version GIF version | ||
| Description: A rearrangement of intersection. (Contributed by NM, 21-Apr-2001.) |
| Ref | Expression |
|---|---|
| in12 | ⊢ (𝐴 ∩ (𝐵 ∩ 𝐶)) = (𝐵 ∩ (𝐴 ∩ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | incom 4172 | . . 3 ⊢ (𝐴 ∩ 𝐵) = (𝐵 ∩ 𝐴) | |
| 2 | 1 | ineq1i 4179 | . 2 ⊢ ((𝐴 ∩ 𝐵) ∩ 𝐶) = ((𝐵 ∩ 𝐴) ∩ 𝐶) |
| 3 | inass 4191 | . 2 ⊢ ((𝐴 ∩ 𝐵) ∩ 𝐶) = (𝐴 ∩ (𝐵 ∩ 𝐶)) | |
| 4 | inass 4191 | . 2 ⊢ ((𝐵 ∩ 𝐴) ∩ 𝐶) = (𝐵 ∩ (𝐴 ∩ 𝐶)) | |
| 5 | 2, 3, 4 | 3eqtr3i 2760 | 1 ⊢ (𝐴 ∩ (𝐵 ∩ 𝐶)) = (𝐵 ∩ (𝐴 ∩ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1540 ∩ cin 3913 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2701 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1543 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-rab 3406 df-v 3449 df-in 3921 |
| This theorem is referenced by: in32 4193 in31 4195 in4 4197 resdmres 6205 kmlem12 10115 ressress 17217 fh1 31547 fh2 31548 mdslmd3i 32261 bj-inrab3 36917 |
| Copyright terms: Public domain | W3C validator |