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

Theorem undif5 4445
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 4442 . 2 ((𝐴𝐵) ∖ 𝐵) = (𝐴𝐵)
2 disjdif2 4441 . 2 ((𝐴𝐵) = ∅ → (𝐴𝐵) = 𝐴)
31, 2eqtrid 2810 1 ((𝐴𝐵) = ∅ → ((𝐴𝐵) ∖ 𝐵) = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1570  cdif 3902  cun 3903  cin 3904  c0 4286
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-nul 4287
This theorem is referenced by:  cyclnumvtx  30149  fressupp  33033  nn0diffz0  33139  elrgspnlem4  33565  mplidomlem  33917  vieta  33970  sucdifsn2  39154
  Copyright terms: Public domain W3C validator