Theorem in13 4171

Description: A rearrangement of intersection. (Contributed by NM, 27-Aug-2012.)

Assertion

Ref	Expression
in13	⊢ (𝐴 ∩ (𝐵 ∩ 𝐶)) = (𝐶 ∩ (𝐵 ∩ 𝐴))

Proof of Theorem in13

Step	Hyp	Ref	Expression
1		in32 4170	. 2 ⊢ ((𝐵 ∩ 𝐶) ∩ 𝐴) = ((𝐵 ∩ 𝐴) ∩ 𝐶)
2		incom 4149	. 2 ⊢ (𝐴 ∩ (𝐵 ∩ 𝐶)) = ((𝐵 ∩ 𝐶) ∩ 𝐴)
3		incom 4149	. 2 ⊢ (𝐶 ∩ (𝐵 ∩ 𝐴)) = ((𝐵 ∩ 𝐴) ∩ 𝐶)
4	1, 2, 3	3eqtr4i 2769	1 ⊢ (𝐴 ∩ (𝐵 ∩ 𝐶)) = (𝐶 ∩ (𝐵 ∩ 𝐴))

Syntax hints:   = wceq 1542   ∩ cin 3888

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-rab 3390  df-v 3431  df-in 3896

This theorem is referenced by:  inin  32586