Theorem undifabs 4444

Description: Absorption of difference by union. (Contributed by NM, 18-Aug-2013.)

Assertion

Ref	Expression
undifabs	⊢ (𝐴 ∪ (𝐴 ∖ 𝐵)) = 𝐴

Proof of Theorem undifabs

Step	Hyp	Ref	Expression
1		undif3 4256	. 2 ⊢ (𝐴 ∪ (𝐴 ∖ 𝐵)) = ((𝐴 ∪ 𝐴) ∖ (𝐵 ∖ 𝐴))
2		unidm 4114	. . 3 ⊢ (𝐴 ∪ 𝐴) = 𝐴
3	2	difeq1i 4080	. 2 ⊢ ((𝐴 ∪ 𝐴) ∖ (𝐵 ∖ 𝐴)) = (𝐴 ∖ (𝐵 ∖ 𝐴))
4		difdif 4092	. 2 ⊢ (𝐴 ∖ (𝐵 ∖ 𝐴)) = 𝐴
5	1, 3, 4	3eqtri 2793	1 ⊢ (𝐴 ∪ (𝐴 ∖ 𝐵)) = 𝐴

This proof depends on syntax axioms:   = wceq 1570   ∖ cdif 3905   ∪ cun 3906

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 2738

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 2745  df-cleq 2758  df-clel 2841  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913

This theorem is used by:  dfif5  4509  indifundif  32907  dfsucmap3  39152