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

Theorem indifcom 4237
Description: Commutation law for intersection and difference. (Contributed by Scott Fenton, 18-Feb-2013.)
Assertion
Ref Expression
indifcom (𝐴 ∩ (𝐵𝐶)) = (𝐵 ∩ (𝐴𝐶))

Proof of Theorem indifcom
StepHypRef Expression
1 incom 4163 . . 3 (𝐴𝐵) = (𝐵𝐴)
21difeq1i 4076 . 2 ((𝐴𝐵) ∖ 𝐶) = ((𝐵𝐴) ∖ 𝐶)
3 indif2 4235 . 2 (𝐴 ∩ (𝐵𝐶)) = ((𝐴𝐵) ∖ 𝐶)
4 indif2 4235 . 2 (𝐵 ∩ (𝐴𝐶)) = ((𝐵𝐴) ∖ 𝐶)
52, 3, 43eqtr4i 2770 1 (𝐴 ∩ (𝐵𝐶)) = (𝐵 ∩ (𝐴𝐶))
Colors of variables: wff setvar class
Syntax hints:   = wceq 1542  cdif 3900  cin 3902
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 3402  df-v 3444  df-dif 3906  df-in 3910
This theorem is referenced by:  ufprim  23868  cmmbl  25506  unmbl  25509  volinun  25518  limciun  25866  caragenuncllem  46874
  Copyright terms: Public domain W3C validator