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

Theorem difabs 4264
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 4260 . 2 (𝐴 ∖ (𝐵𝐵)) = ((𝐴𝐵) ∖ 𝐵)
2 unidm 4119 . . 3 (𝐵𝐵) = 𝐵
32difeq2i 4086 . 2 (𝐴 ∖ (𝐵𝐵)) = (𝐴𝐵)
41, 3eqtr3i 2794 1 ((𝐴𝐵) ∖ 𝐵) = (𝐴𝐵)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1567  cdif 3910  cun 3911
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1570  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920
This theorem is referenced by:  axcclem  10437  lpdifsn  23265  compne  45035
  Copyright terms: Public domain W3C validator