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 38239
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 9644 . 2 (𝐴 ∩ {𝐴}) = ∅
2 undif5 4485 . 2 ((𝐴 ∩ {𝐴}) = ∅ → ((𝐴 ∪ {𝐴}) ∖ {𝐴}) = 𝐴)
31, 2ax-mp 5 1 ((𝐴 ∪ {𝐴}) ∖ {𝐴}) = 𝐴
Colors of variables: wff setvar class
Syntax hints:   = wceq 1540  cdif 3948  cun 3949  cin 3950  c0 4333  {csn 4626
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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-pr 5432  ax-reg 9632
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-clab 2715  df-cleq 2729  df-clel 2816  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-dif 3954  df-un 3956  df-in 3958  df-nul 4334  df-sn 4627  df-pr 4629
This theorem is referenced by:  sucdifsn  38240  partsuc2  38780
  Copyright terms: Public domain W3C validator