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

Theorem unisucs 6442
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 6444. (Revised by BJ, 28-Dec-2024.)
Assertion
Ref Expression
unisucs (𝐴𝑉 suc 𝐴 = ( 𝐴𝐴))

Proof of Theorem unisucs
StepHypRef Expression
1 df-suc 6368 . . . 4 suc 𝐴 = (𝐴 ∪ {𝐴})
21unieqi 4885 . . 3 suc 𝐴 = (𝐴 ∪ {𝐴})
32a1i 11 . 2 (𝐴𝑉 suc 𝐴 = (𝐴 ∪ {𝐴}))
4 uniun 4896 . . 3 (𝐴 ∪ {𝐴}) = ( 𝐴 {𝐴})
54a1i 11 . 2 (𝐴𝑉 (𝐴 ∪ {𝐴}) = ( 𝐴 {𝐴}))
6 unisng 4891 . . 3 (𝐴𝑉 {𝐴} = 𝐴)
76uneq2d 4123 . 2 (𝐴𝑉 → ( 𝐴 {𝐴}) = ( 𝐴𝐴))
83, 5, 73eqtrd 2802 1 (𝐴𝑉 suc 𝐴 = ( 𝐴𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1570  wcel 2143  cun 3904  {csn 4590   cuni 4873  suc csuc 6364
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-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-v 3457  df-un 3911  df-ss 3923  df-sn 4591  df-pr 4593  df-uni 4874  df-suc 6368
This theorem is referenced by:  unisucg  6443
  Copyright terms: Public domain W3C validator