Theorem indif1 4266

Description: Bring an intersection in and out of a class difference. (Contributed by Mario Carneiro, 15-May-2015.)

Assertion

Ref	Expression
indif1	⊢ ((𝐴 ∖ 𝐶) ∩ 𝐵) = ((𝐴 ∩ 𝐵) ∖ 𝐶)

Proof of Theorem indif1

Step	Hyp	Ref	Expression
1		indif2 4265	. 2 ⊢ (𝐵 ∩ (𝐴 ∖ 𝐶)) = ((𝐵 ∩ 𝐴) ∖ 𝐶)
2		incom 4196	. 2 ⊢ (𝐵 ∩ (𝐴 ∖ 𝐶)) = ((𝐴 ∖ 𝐶) ∩ 𝐵)
3		incom 4196	. . 3 ⊢ (𝐵 ∩ 𝐴) = (𝐴 ∩ 𝐵)
4	3	difeq1i 4113	. 2 ⊢ ((𝐵 ∩ 𝐴) ∖ 𝐶) = ((𝐴 ∩ 𝐵) ∖ 𝐶)
5	1, 2, 4	3eqtr3i 2767	1 ⊢ ((𝐴 ∖ 𝐶) ∩ 𝐵) = ((𝐴 ∩ 𝐵) ∖ 𝐶)

Syntax hints:   = wceq 1541   ∖ cdif 3940   ∩ cin 3942

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2702

This theorem depends on definitions:  df-bi 206  df-an 397  df-tru 1544  df-ex 1782  df-sb 2068  df-clab 2709  df-cleq 2723  df-clel 2809  df-rab 3432  df-v 3474  df-dif 3946  df-in 3950

This theorem is referenced by:  resdifcom  5991  resdmdfsn  6022  hartogslem1  9518  fpwwe2  10619  leiso  14401  basdif0  22382  tgdif0  22421  kqdisj  23162  trufil  23340  difininv  31616  gtiso  31790  dfon4  34681  disjdifb  47130