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

Theorem unon 7782
Description: The class of all ordinal numbers is its own union. Exercise 11 of [TakeutiZaring] p. 40. (Contributed by NM, 12-Nov-2003.)
Assertion
Ref Expression
unon On = On

Proof of Theorem unon
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eluni2 4854 . . . 4 (𝑥 On ↔ ∃𝑦 ∈ On 𝑥𝑦)
2 onelon 6348 . . . . 5 ((𝑦 ∈ On ∧ 𝑥𝑦) → 𝑥 ∈ On)
32rexlimiva 3130 . . . 4 (∃𝑦 ∈ On 𝑥𝑦𝑥 ∈ On)
41, 3sylbi 217 . . 3 (𝑥 On → 𝑥 ∈ On)
5 vex 3433 . . . . 5 𝑥 ∈ V
65sucid 6407 . . . 4 𝑥 ∈ suc 𝑥
7 onsuc 7764 . . . 4 (𝑥 ∈ On → suc 𝑥 ∈ On)
8 elunii 4855 . . . 4 ((𝑥 ∈ suc 𝑥 ∧ suc 𝑥 ∈ On) → 𝑥 On)
96, 7, 8sylancr 588 . . 3 (𝑥 ∈ On → 𝑥 On)
104, 9impbii 209 . 2 (𝑥 On ↔ 𝑥 ∈ On)
1110eqriv 2733 1 On = On
Colors of variables: wff setvar class
Syntax hints:   = wceq 1542  wcel 2114  wrex 3061   cuni 4850  Oncon0 6323  suc csuc 6325
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2708  ax-sep 5231  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-tr 5193  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-ord 6326  df-on 6327  df-suc 6329
This theorem is referenced by:  ordunisuc  7783  limon  7787  orduninsuc  7794  ordtoplem  36617  ordcmp  36629  onsupnmax  43656
  Copyright terms: Public domain W3C validator