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

Theorem onunisuc 6501
Description: An ordinal number is equal to the union of its successor. (Contributed by NM, 12-Jun-1994.) Generalize from onunisuci 6510. (Revised by BJ, 28-Dec-2024.)
Assertion
Ref Expression
onunisuc (𝐴 ∈ On → ∪ suc 𝐴 = 𝐴)

Proof of Theorem onunisuc
StepHypRef Expression
1 ontr 6500 . 2 (𝐴 ∈ On → Tr 𝐴)
2 unisucg 6469 . 2 (𝐴 ∈ On → (Tr 𝐴 ↔ ∪ suc 𝐴 = 𝐴))
31, 2mpbid 235 1 (𝐴 ∈ On → ∪ suc 𝐴 = 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  ∪ cuni 4872  Tr wtr 5218  Oncon0 6388  suc csuc 6390
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-v 3456  df-ss 3901  df-un 4154  df-sn 4589  df-pr 4591  df-uni 4873  df-tr 5219  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-ord 6391  df-on 6392  df-suc 6394
This theorem is used by:  onunisuci  6510  ordunisuc  7877  nlimsuc  44703
  Copyright terms: Public domain W3C validator