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

Theorem unon 7828
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 4877 . . . 4 (𝑥 On ↔ ∃𝑦 ∈ On 𝑥𝑦)
2 onelon 6387 . . . . 5 ((𝑦 ∈ On ∧ 𝑥𝑦) → 𝑥 ∈ On)
32rexlimiva 3158 . . . 4 (∃𝑦 ∈ On 𝑥𝑦𝑥 ∈ On)
41, 3sylbi 220 . . 3 (𝑥 On → 𝑥 ∈ On)
5 vex 3459 . . . . 5 𝑥 ∈ V
65sucid 6447 . . . 4 𝑥 ∈ suc 𝑥
7 onsuc 7810 . . . 4 (𝑥 ∈ On → suc 𝑥 ∈ On)
8 elunii 4878 . . . 4 ((𝑥 ∈ suc 𝑥 ∧ suc 𝑥 ∈ On) → 𝑥 On)
96, 7, 8sylancr 598 . . 3 (𝑥 ∈ On → 𝑥 On)
104, 9impbii 212 . 2 (𝑥 On ↔ 𝑥 ∈ On)
1110eqriv 2760 1 On = On
Colors of variables: wff setvar class
Syntax hints:   = wceq 1570  wcel 2143  wrex 3089   cuni 4873  Oncon0 6362  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  ax-sep 5258  ax-pr 5406  ax-un 7734
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-br 5111  df-opab 5175  df-tr 5220  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-ord 6365  df-on 6366  df-suc 6368
This theorem is referenced by:  ordunisuc  7829  limon  7833  orduninsuc  7840  ordtoplem  36924  ordcmp  36936  onsupnmax  43935
  Copyright terms: Public domain W3C validator