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

Theorem unon 4622
 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

Proof of Theorem unon
Dummy variables are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eluni2 3831 . . . 4
2 onelon 4417 . . . . 5
32rexlimiva 2662 . . . 4
41, 3sylbi 187 . . 3
5 vex 2791 . . . . 5
65sucid 4471 . . . 4
7 suceloni 4604 . . . 4
8 elunii 3832 . . . 4
96, 7, 8sylancr 644 . . 3
104, 9impbii 180 . 2
1110eqriv 2280 1
 Colors of variables: wff set class Syntax hints:   wceq 1623   wcel 1684  wrex 2544  cuni 3827  con0 4392   csuc 4394 This theorem is referenced by:  ordunisuc  4623  limon  4627  orduninsuc  4634  ordtoplem  24874  ordcmp  24886 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pr 4214  ax-un 4512 This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-rab 2552  df-v 2790  df-sbc 2992  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pss 3168  df-nul 3456  df-if 3566  df-sn 3646  df-pr 3647  df-tp 3648  df-op 3649  df-uni 3828  df-br 4024  df-opab 4078  df-tr 4114  df-eprel 4305  df-po 4314  df-so 4315  df-fr 4352  df-we 4354  df-ord 4395  df-on 4396  df-suc 4398
 Copyright terms: Public domain W3C validator