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 4878 . . 3 ∪ suc 𝐴 = ∪ (𝐴 ∪ {𝐴})
32a1i 11 . 2 (𝐴 ∈ 𝑉 → ∪ suc 𝐴 = ∪ (𝐴 ∪ {𝐴}))
4 uniun 4889 . . 3 ∪ (𝐴 ∪ {𝐴}) = (∪ 𝐴 ∪ ∪ {𝐴})
54a1i 11 . 2 (𝐴 ∈ 𝑉 → ∪ (𝐴 ∪ {𝐴}) = (∪ 𝐴 ∪ ∪ {𝐴}))
6 unisng 4884 . . 3 (𝐴 ∈ 𝑉 → ∪ {𝐴} = 𝐴)
76uneq2d 4167 . 2 (𝐴 ∈ 𝑉 → (∪ 𝐴 ∪ ∪ {𝐴}) = (∪ 𝐴 ∪ 𝐴))
83, 5, 73eqtrd 2799 1 (𝐴 ∈ 𝑉 → ∪ suc 𝐴 = (∪ 𝐴 ∪ 𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144   ∪ cun 4149  {csn 4584  ∪ cuni 4866  suc csuc 6364
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-ss 3896  df-un 4151  df-sn 4585  df-pr 4587  df-uni 4867  df-suc 6368
This theorem is used by:  unisucg  6443
  Copyright terms: Public domain W3C validator