Theorem undif5 4451

Description: An equality involving class union and class difference. (Contributed by Thierry Arnoux, 26-Jun-2024.)

Assertion

Ref	Expression
undif5	⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 ∪ 𝐵) ∖ 𝐵) = 𝐴)

Proof of Theorem undif5

Step	Hyp	Ref	Expression
1		difun2 4447	. 2 ⊢ ((𝐴 ∪ 𝐵) ∖ 𝐵) = (𝐴 ∖ 𝐵)
2		disjdif2 4446	. 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝐴 ∖ 𝐵) = 𝐴)
3	1, 2	eqtrid 2777	1 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 ∪ 𝐵) ∖ 𝐵) = 𝐴)

Syntax hints:   → wi 4   = wceq 1540   ∖ cdif 3914   ∪ cun 3915   ∩ cin 3916  ∅c0 4299

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2702

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-in 3924  df-nul 4300

This theorem is referenced by:  cyclnumvtx  29737  fressupp  32618  elrgspnlem4  33203  sucdifsn2  38233