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

Theorem undif5 4443
Description: An equality involving class union and class difference. (Contributed by Thierry Arnoux, 26-Jun-2024.)
Assertion
Ref Expression
undif5 ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 ∪ 𝐵) ∖ 𝐵) = 𝐴)

Proof of Theorem undif5
StepHypRef Expression
1 difun2 4440 . 2 ((𝐴 ∪ 𝐵) ∖ 𝐵) = (𝐴 ∖ 𝐵)
2 disjdif2 4439 . 2 ((𝐴 ∩ 𝐵) = ∅ → (𝐴 ∖ 𝐵) = 𝐴)
31, 2eqtrid 2810 1 ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 ∪ 𝐵) ∖ 𝐵) = 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∖ cdif 4048   ∩ cin 4092   ∪ cun 4152  ∅c0 4281
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282
This theorem is used by:  cyclnumvtx  30445  fressupp  33378  nn0diffz0  33482  elrgspnlem4  33905  mplidomlem  34270  vieta  34323  sucdifsn2  39683
  Copyright terms: Public domain W3C validator