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

Theorem unon 7807
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 4868 . . . 4 (𝑥 On ↔ ∃𝑦 ∈ On 𝑥𝑦)
2 onelon 6367 . . . . 5 ((𝑦 ∈ On ∧ 𝑥𝑦) → 𝑥 ∈ On)
32rexlimiva 3154 . . . 4 (∃𝑦 ∈ On 𝑥𝑦𝑥 ∈ On)
41, 3sylbi 219 . . 3 (𝑥 On → 𝑥 ∈ On)
5 vex 3457 . . . . 5 𝑥 ∈ V
65sucid 6426 . . . 4 𝑥 ∈ suc 𝑥
7 onsuc 7789 . . . 4 (𝑥 ∈ On → suc 𝑥 ∈ On)
8 elunii 4869 . . . 4 ((𝑥 ∈ suc 𝑥 ∧ suc 𝑥 ∈ On) → 𝑥 On)
96, 7, 8sylancr 596 . . 3 (𝑥 ∈ On → 𝑥 On)
104, 9impbii 211 . 2 (𝑥 On ↔ 𝑥 ∈ On)
1110eqriv 2758 1 On = On
Colors of variables: wff setvar class
Syntax hints:   = wceq 1559  wcel 2141  wrex 3085   cuni 4864  Oncon0 6342  suc csuc 6344
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733  ax-sep 5245  ax-pr 5389  ax-un 7714
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-tr 5207  df-eprel 5545  df-po 5553  df-so 5554  df-fr 5598  df-we 5600  df-ord 6345  df-on 6346  df-suc 6348
This theorem is referenced by:  ordunisuc  7808  limon  7812  orduninsuc  7819  ordtoplem  36759  ordcmp  36771  onsupnmax  43769
  Copyright terms: Public domain W3C validator