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

Theorem indif1 4230
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 4229 . 2 (𝐵 ∩ (𝐴 ∖ 𝐶)) = ((𝐵 ∩ 𝐴) ∖ 𝐶)
2 incom 4109 . 2 (𝐵 ∩ (𝐴 ∖ 𝐶)) = ((𝐴 ∖ 𝐶) ∩ 𝐵)
3 incom 4109 . . 3 (𝐵 ∩ 𝐴) = (𝐴 ∩ 𝐵)
43difeq1i 4062 . 2 ((𝐵 ∩ 𝐴) ∖ 𝐶) = ((𝐴 ∩ 𝐵) ∖ 𝐶)
51, 2, 43eqtr3i 2794 1 ((𝐴 ∖ 𝐶) ∩ 𝐵) = ((𝐴 ∩ 𝐵) ∖ 𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ∖ cdif 4048   ∩ cin 4092
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-dif 4050  df-in 4094
This theorem is used by:  resdifcom  6005  resdmdfsn  6039  resdmdfsnOLD  6040  hartogslem1  9573  fpwwe2  10767  leiso  14645  basdif0  23326  tgdif0  23365  kqdisj  24106  trufil  24284  difininv  33212  gtiso  33391  dfon4  36870  disjdifb  50312
  Copyright terms: Public domain W3C validator