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

Theorem difabs 4257
Description: Absorption-like law for class difference: you can remove a class only once. (Contributed by FL, 2-Aug-2009.)
Assertion
Ref Expression
difabs ((𝐴𝐵) ∖ 𝐵) = (𝐴𝐵)

Proof of Theorem difabs
StepHypRef Expression
1 difun1 4253 . 2 (𝐴 ∖ (𝐵𝐵)) = ((𝐴𝐵) ∖ 𝐵)
2 unidm 4111 . . 3 (𝐵𝐵) = 𝐵
32difeq2i 4077 . 2 (𝐴 ∖ (𝐵𝐵)) = (𝐴𝐵)
41, 3eqtr3i 2762 1 ((𝐴𝐵) ∖ 𝐵) = (𝐴𝐵)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1542  cdif 3900  cun 3901
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-or 849  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-un 3908  df-in 3910
This theorem is referenced by:  axcclem  10379  lpdifsn  23099  compne  44790
  Copyright terms: Public domain W3C validator