| 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 4109 | . . 3 ⊢ (𝐴 ∩ 𝐵) = (𝐵 ∩ 𝐴) | |
| 2 | 1 | ineq1i 4116 | . 2 ⊢ ((𝐴 ∩ 𝐵) ∩ 𝐶) = ((𝐵 ∩ 𝐴) ∩ 𝐶) |
| 3 | inass 4127 | . 2 ⊢ ((𝐴 ∩ 𝐵) ∩ 𝐶) = (𝐴 ∩ (𝐵 ∩ 𝐶)) | |
| 4 | inass 4127 | . 2 ⊢ ((𝐵 ∩ 𝐴) ∩ 𝐶) = (𝐵 ∩ (𝐴 ∩ 𝐶)) | |
| 5 | 2, 3, 4 | 3eqtr3i 2794 | 1 ⊢ (𝐴 ∩ (𝐵 ∩ 𝐶)) = (𝐵 ∩ (𝐴 ∩ 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∩ cin 4092 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-rab 3417 df-v 3456 df-in 4094 |
| This theorem is used by: in32 4129 in31 4131 in4 4133 resdmres 6252 kmlem12 10279 ressress 17469 fh1 32277 fh2 32278 mdslmd3i 32991 bj-inrab3 38057 |
| Copyright terms: Public domain | W3C validator |