| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > in13 | Structured version Visualization version GIF version | ||
| Description: A rearrangement of intersection. (Contributed by NM, 27-Aug-2012.) |
| Ref | Expression |
|---|---|
| in13 | ⊢ (𝐴 ∩ (𝐵 ∩ 𝐶)) = (𝐶 ∩ (𝐵 ∩ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | in32 4177 | . 2 ⊢ ((𝐵 ∩ 𝐶) ∩ 𝐴) = ((𝐵 ∩ 𝐴) ∩ 𝐶) | |
| 2 | incom 4156 | . 2 ⊢ (𝐴 ∩ (𝐵 ∩ 𝐶)) = ((𝐵 ∩ 𝐶) ∩ 𝐴) | |
| 3 | incom 4156 | . 2 ⊢ (𝐶 ∩ (𝐵 ∩ 𝐴)) = ((𝐵 ∩ 𝐴) ∩ 𝐶) | |
| 4 | 1, 2, 3 | 3eqtr4i 2764 | 1 ⊢ (𝐴 ∩ (𝐵 ∩ 𝐶)) = (𝐶 ∩ (𝐵 ∩ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1541 ∩ cin 3896 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-ext 2703 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1544 df-ex 1781 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-rab 3396 df-v 3438 df-in 3904 |
| This theorem is referenced by: inin 32496 |
| Copyright terms: Public domain | W3C validator |