Theorem in12 4170

Description: A rearrangement of intersection. (Contributed by NM, 21-Apr-2001.)

Assertion

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

Proof of Theorem in12

Step	Hyp	Ref	Expression
1		incom 4150	. . 3 ⊢ (𝐴 ∩ 𝐵) = (𝐵 ∩ 𝐴)
2	1	ineq1i 4157	. 2 ⊢ ((𝐴 ∩ 𝐵) ∩ 𝐶) = ((𝐵 ∩ 𝐴) ∩ 𝐶)
3		inass 4169	. 2 ⊢ ((𝐴 ∩ 𝐵) ∩ 𝐶) = (𝐴 ∩ (𝐵 ∩ 𝐶))
4		inass 4169	. 2 ⊢ ((𝐵 ∩ 𝐴) ∩ 𝐶) = (𝐵 ∩ (𝐴 ∩ 𝐶))
5	2, 3, 4	3eqtr3i 2768	1 ⊢ (𝐴 ∩ (𝐵 ∩ 𝐶)) = (𝐵 ∩ (𝐴 ∩ 𝐶))

Syntax hints:   = wceq 1542   ∩ cin 3889

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 2709

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-rab 3391  df-v 3432  df-in 3897

This theorem is referenced by:  in32  4171  in31  4173  in4  4175  resdmres  6190  kmlem12  10075  ressress  17208  fh1  31704  fh2  31705  mdslmd3i  32418  bj-inrab3  37252