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

Theorem unon 3088
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 2507 . . . 4 |- (x e. U.On <-> E.y e. On x e. y)
2 onelon 2972 . . . . 5 |- ((y e. On /\ x e. y) -> x e. On)
32r19.23aiva 1744 . . . 4 |- (E.y e. On x e. y -> x e. On)
41, 3sylbi 199 . . 3 |- (x e. U.On -> x e. On)
5 suceloni 3062 . . . . 5 |- (x e. On -> suc x e. On)
6 visset 1813 . . . . . 6 |- x e. V
76sucid 3051 . . . . 5 |- x e. suc x
85, 7jctil 292 . . . 4 |- (x e. On -> (x e. suc x /\ suc x e. On))
9 elunii 2508 . . . 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 1474 1 |- U.On = On
Colors of variables: wff set class
Syntax hints:   /\ wa 223   = wceq 956   e. wcel 958  E.wrex 1646  U.cuni 2503  Oncon0 2948  suc csuc 2950
This theorem is referenced by:  ordunisuc 3089  limon 3094  orduninsuc 3114
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2703  ax-pow 2742  ax-pr 2779  ax-un 2866
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 776  df-3an 777  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-ral 1649  df-rex 1650  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-tp 2415  df-op 2416  df-uni 2504  df-br 2620  df-opab 2667  df-tr 2681  df-eprel 2832  df-po 2840  df-so 2850  df-fr 2917  df-we 2934  df-ord 2951  df-on 2952  df-suc 2954
Copyright terms: Public domain