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

Theorem difabs 4247
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 4243 . 2 (𝐴 ∖ (𝐵 ∪ 𝐵)) = ((𝐴 ∖ 𝐵) ∖ 𝐵)
2 unidm 4155 . . 3 (𝐵 ∪ 𝐵) = 𝐵
32difeq2i 4059 . 2 (𝐴 ∖ (𝐵 ∪ 𝐵)) = (𝐴 ∖ 𝐵)
41, 3eqtr3i 2785 1 ((𝐴 ∖ 𝐵) ∖ 𝐵) = (𝐴 ∖ 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1569   ∖ cdif 4044   ∪ cun 4148
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-dif 4046  df-in 4090  df-un 4150
This theorem is used by:  axcclem  10542  lpdifsn  23470  compne  45532
  Copyright terms: Public domain W3C validator