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

Theorem unon 7815
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 4872 . . . 4 (𝑥 On ↔ ∃𝑦 ∈ On 𝑥𝑦)
2 onelon 6375 . . . . 5 ((𝑦 ∈ On ∧ 𝑥𝑦) → 𝑥 ∈ On)
32rexlimiva 3158 . . . 4 (∃𝑦 ∈ On 𝑥𝑦𝑥 ∈ On)
41, 3sylbi 220 . . 3 (𝑥 On → 𝑥 ∈ On)
5 vex 3461 . . . . 5 𝑥 ∈ V
65sucid 6434 . . . 4 𝑥 ∈ suc 𝑥
7 onsuc 7797 . . . 4 (𝑥 ∈ On → suc 𝑥 ∈ On)
8 elunii 4873 . . . 4 ((𝑥 ∈ suc 𝑥 ∧ suc 𝑥 ∈ On) → 𝑥 On)
96, 7, 8sylancr 598 . . 3 (𝑥 ∈ On → 𝑥 On)
104, 9impbii 212 . 2 (𝑥 On ↔ 𝑥 ∈ On)
1110eqriv 2762 1 On = On
Colors of variables: wff setvar class
Syntax hints:   = wceq 1563  wcel 2145  wrex 3089   cuni 4868  Oncon0 6350  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  ax-sep 5251  ax-pr 5395  ax-un 7722
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-opab 5168  df-tr 5213  df-eprel 5552  df-po 5560  df-so 5561  df-fr 5605  df-we 5607  df-ord 6353  df-on 6354  df-suc 6356
This theorem is referenced by:  ordunisuc  7816  limon  7820  orduninsuc  7827  ordtoplem  36808  ordcmp  36820  onsupnmax  43817
  Copyright terms: Public domain W3C validator