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

Theorem indif1 4235
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 4234 . 2 (𝐵 ∩ (𝐴𝐶)) = ((𝐵𝐴) ∖ 𝐶)
2 incom 4162 . 2 (𝐵 ∩ (𝐴𝐶)) = ((𝐴𝐶) ∩ 𝐵)
3 incom 4162 . . 3 (𝐵𝐴) = (𝐴𝐵)
43difeq1i 4077 . 2 ((𝐵𝐴) ∖ 𝐶) = ((𝐴𝐵) ∖ 𝐶)
51, 2, 43eqtr3i 2796 1 ((𝐴𝐶) ∩ 𝐵) = ((𝐴𝐵) ∖ 𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  cdif 3903  cin 3905
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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-rab 3419  df-v 3459  df-dif 3909  df-in 3913
This theorem is used by:  resdifcom  5999  resdmdfsn  6033  resdmdfsnOLD  6034  hartogslem1  9511  fpwwe2  10645  leiso  14516  basdif0  23162  tgdif0  23201  kqdisj  23942  trufil  24120  difininv  32936  gtiso  33119  dfon4  36422  disjdifb  49647
  Copyright terms: Public domain W3C validator