HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem unon 3094
Description: The class of all ordinal numbers is its own union. Exercise 11 of [TakeutiZaring] p. 40.
Assertion
Ref Expression
unon |- U.On = On

Proof of Theorem unon
StepHypRef Expression
1 eluni2 2511 . . . 4 |- (x e. U.On <-> E.y e. On x e. y)
2 onelon 2978 . . . . 5 |- ((y e. On /\ x e. y) -> x e. On)
32r19.23aiva 1747 . . . 4 |- (E.y e. On x e. y -> x e. On)
41, 3sylbi 199 . . 3 |- (x e. U.On -> x e. On)
5 suceloni 3068 . . . . 5 |- (x e. On -> suc x e. On)
6 visset 1816 . . . . . 6 |- x e. V
76sucid 3057 . . . . 5 |- x e. suc x
85, 7jctil 292 . . . 4 |- (x e. On -> (x e. suc x /\ suc x e. On))
9 elunii 2512 . . . 4 |- ((x e. suc x /\ suc x e. On) -> x e. U.On)
108, 9syl 10 . . 3 |- (x e. On -> x e. U.On)
114, 10impbi 157 . 2 |- (x e. U.On <-> x e. On)
1211eqriv 1477 1 |- U.On = On
Colors of variables: wff set class
Syntax hints:   /\ wa 223   = wceq 958   e. wcel 960  E.wrex 1649  U.cuni 2507  Oncon0 2954  suc csuc 2956
This theorem is referenced by:  ordunisuc 3095  limon 3100  orduninsuc 3120
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-sep 2708  ax-pow 2748  ax-pr 2785  ax-un 2872
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 778  df-3an 779  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-ral 1652  df-rex 1653  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-tp 2419  df-op 2420  df-uni 2508  df-br 2625  df-opab 2672  df-tr 2686  df-eprel 2838  df-po 2846  df-so 2856  df-fr 2923  df-we 2940  df-ord 2957  df-on 2958  df-suc 2960
Copyright terms: Public domain