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 4196 | . 2 ⊢ ((𝐵 ∩ 𝐶) ∩ 𝐴) = ((𝐵 ∩ 𝐴) ∩ 𝐶) | |
2 | incom 4176 | . 2 ⊢ (𝐴 ∩ (𝐵 ∩ 𝐶)) = ((𝐵 ∩ 𝐶) ∩ 𝐴) | |
3 | incom 4176 | . 2 ⊢ (𝐶 ∩ (𝐵 ∩ 𝐴)) = ((𝐵 ∩ 𝐴) ∩ 𝐶) | |
4 | 1, 2, 3 | 3eqtr4i 2852 | 1 ⊢ (𝐴 ∩ (𝐵 ∩ 𝐶)) = (𝐶 ∩ (𝐵 ∩ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1531 ∩ cin 3933 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1905 ax-6 1964 ax-7 2009 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2154 ax-12 2170 ax-ext 2791 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1534 df-ex 1775 df-nf 1779 df-sb 2064 df-clab 2798 df-cleq 2812 df-clel 2891 df-nfc 2961 df-rab 3145 df-v 3495 df-in 3941 |
This theorem is referenced by: inin 30269 |
Copyright terms: Public domain | W3C validator |