MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  indif1 Structured version   Visualization version   GIF version

Theorem indif1 4229
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
StepHypRef Expression
1 indif2 4228 . 2 (𝐵 ∩ (𝐴 ∖ 𝐶)) = ((𝐵 ∩ 𝐴) ∖ 𝐶)
2 incom 4108 . 2 (𝐵 ∩ (𝐴 ∖ 𝐶)) = ((𝐴 ∖ 𝐶) ∩ 𝐵)
3 incom 4108 . . 3 (𝐵 ∩ 𝐴) = (𝐴 ∩ 𝐵)
43difeq1i 4061 . 2 ((𝐵 ∩ 𝐴) ∖ 𝐶) = ((𝐴 ∩ 𝐵) ∖ 𝐶)
51, 2, 43eqtr3i 2794 1 ((𝐴 ∖ 𝐶) ∩ 𝐵) = ((𝐴 ∩ 𝐵) ∖ 𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1569   ∖ cdif 4047   ∩ cin 4091
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-rab 3416  df-v 3455  df-dif 4049  df-in 4093
This theorem is used by:  resdifcom  5993  resdmdfsn  6026  resdmdfsnOLD  6027  hartogslem1  9546  fpwwe2  10738  leiso  14614  basdif0  23283  tgdif0  23322  kqdisj  24063  trufil  24241  difininv  33167  gtiso  33348  dfon4  36782  disjdifb  50059
  Copyright terms: Public domain W3C validator