Theorem difabs 4256

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

Step	Hyp	Ref	Expression
1		difun1 4252	. 2 ⊢ (𝐴 ∖ (𝐵 ∪ 𝐵)) = ((𝐴 ∖ 𝐵) ∖ 𝐵)
2		unidm 4111	. . 3 ⊢ (𝐵 ∪ 𝐵) = 𝐵
3	2	difeq2i 4078	. 2 ⊢ (𝐴 ∖ (𝐵 ∪ 𝐵)) = (𝐴 ∖ 𝐵)
4	1, 3	eqtr3i 2790	1 ⊢ ((𝐴 ∖ 𝐵) ∖ 𝐵) = (𝐴 ∖ 𝐵)

This proof depends on syntax axioms:   = wceq 1570   ∖ cdif 3903   ∪ cun 3904

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-or 862  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-un 3911  df-in 3913

This theorem is used by:  axcclem  10456  lpdifsn  23350  compne  45208