Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  sucdifsn2 Structured version   Visualization version   GIF version

Theorem sucdifsn2 38216
Description: Absorption of union with a singleton by difference. (Contributed by Peter Mazsa, 24-Jul-2024.)
Assertion
Ref Expression
sucdifsn2 ((𝐴 ∪ {𝐴}) ∖ {𝐴}) = 𝐴

Proof of Theorem sucdifsn2
StepHypRef Expression
1 disjcsn 9499 . 2 (𝐴 ∩ {𝐴}) = ∅
2 undif5 4436 . 2 ((𝐴 ∩ {𝐴}) = ∅ → ((𝐴 ∪ {𝐴}) ∖ {𝐴}) = 𝐴)
31, 2ax-mp 5 1 ((𝐴 ∪ {𝐴}) ∖ {𝐴}) = 𝐴
Colors of variables: wff setvar class
Syntax hints:   = wceq 1540  cdif 3900  cun 3901  cin 3902  c0 4284  {csn 4577
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 2701  ax-sep 5235  ax-pr 5371  ax-reg 9484
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 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rab 3395  df-v 3438  df-dif 3906  df-un 3908  df-in 3910  df-nul 4285  df-sn 4578
This theorem is referenced by:  sucdifsn  38217  partsuc2  38761
  Copyright terms: Public domain W3C validator