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

Theorem undif5 4438
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 4435 . 2 ((𝐴𝐵) ∖ 𝐵) = (𝐴𝐵)
2 disjdif2 4434 . 2 ((𝐴𝐵) = ∅ → (𝐴𝐵) = 𝐴)
31, 2eqtrid 2809 1 ((𝐴𝐵) = ∅ → ((𝐴𝐵) ∖ 𝐵) = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1560  cdif 3901  cun 3902  cin 3903  c0 4285
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-ext 2734
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-tru 1563  df-fal 1573  df-ex 1800  df-sb 2091  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3415  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-nul 4286
This theorem is referenced by:  cyclnumvtx  30000  fressupp  32890  nn0diffz0  32996  elrgspnlem4  33426  mplidomlem  33824  vieta  33877  sucdifsn2  38984
  Copyright terms: Public domain W3C validator