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

Theorem unisucs 6429
Description: The union of the successor of a set is equal to the binary union of that set with its union. (Contributed by NM, 30-Aug-1993.) Extract from unisuc 6431. (Revised by BJ, 28-Dec-2024.)
Assertion
Ref Expression
unisucs (𝐴𝑉 suc 𝐴 = ( 𝐴𝐴))

Proof of Theorem unisucs
StepHypRef Expression
1 df-suc 6356 . . . 4 suc 𝐴 = (𝐴 ∪ {𝐴})
21unieqi 4880 . . 3 suc 𝐴 = (𝐴 ∪ {𝐴})
32a1i 11 . 2 (𝐴𝑉 suc 𝐴 = (𝐴 ∪ {𝐴}))
4 uniun 4891 . . 3 (𝐴 ∪ {𝐴}) = ( 𝐴 {𝐴})
54a1i 11 . 2 (𝐴𝑉 (𝐴 ∪ {𝐴}) = ( 𝐴 {𝐴}))
6 unisng 4886 . . 3 (𝐴𝑉 {𝐴} = 𝐴)
76uneq2d 4124 . 2 (𝐴𝑉 → ( 𝐴 {𝐴}) = ( 𝐴𝐴))
83, 5, 73eqtrd 2804 1 (𝐴𝑉 suc 𝐴 = ( 𝐴𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1563  wcel 2145  cun 3905  {csn 4585   cuni 4868  suc csuc 6352
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1566  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-v 3459  df-un 3912  df-ss 3924  df-sn 4586  df-pr 4588  df-uni 4869  df-suc 6356
This theorem is referenced by:  unisucg  6430
  Copyright terms: Public domain W3C validator