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

Theorem onuni 4621
Description: The union of an ordinal number is an ordinal number. (Contributed by NM, 29-Sep-2006.)
Assertion
Ref Expression
onuni  |-  ( A  e.  On  ->  U. A  e.  On )

Proof of Theorem onuni
StepHypRef Expression
1 onss 4619 . 2  |-  ( A  e.  On  ->  A  C_  On )
2 ssonuni 4615 . 2  |-  ( A  e.  On  ->  ( A  C_  On  ->  U. A  e.  On ) )
31, 2mpd 14 1  |-  ( A  e.  On  ->  U. A  e.  On )
Colors of variables: wff set class
Syntax hints:    -> wi 4    e. wcel 1701    C_ wss 3186   U.cuni 3864   Oncon0 4429
This theorem is referenced by:  onuninsuci  4668  oeeulem  6641  cnfcom3lem  7451  rankxpsuc  7597  dfac12lem2  7815  ttukeylem3  8183  r1limwun  8403  ontgval  25256  ordtoplem  25260  ordcmp  25272  aomclem1  26299
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1537  ax-5 1548  ax-17 1607  ax-9 1645  ax-8 1666  ax-13 1703  ax-14 1705  ax-6 1720  ax-7 1725  ax-11 1732  ax-12 1897  ax-ext 2297  ax-sep 4178  ax-nul 4186  ax-pr 4251  ax-un 4549
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 1533  df-nf 1536  df-sb 1640  df-eu 2180  df-mo 2181  df-clab 2303  df-cleq 2309  df-clel 2312  df-nfc 2441  df-ne 2481  df-ral 2582  df-rex 2583  df-rab 2586  df-v 2824  df-sbc 3026  df-dif 3189  df-un 3191  df-in 3193  df-ss 3200  df-pss 3202  df-nul 3490  df-if 3600  df-sn 3680  df-pr 3681  df-tp 3682  df-op 3683  df-uni 3865  df-br 4061  df-opab 4115  df-tr 4151  df-eprel 4342  df-po 4351  df-so 4352  df-fr 4389  df-we 4391  df-ord 4432  df-on 4433
  Copyright terms: Public domain W3C validator