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

Theorem ssonunii 4581
Description: The union of a set of ordinal numbers is an ordinal number. Corollary 7N(d) of [Enderton] p. 193. (Contributed by NM, 20-Sep-2003.)
Hypothesis
Ref Expression
ssonuni.1  |-  A  e. 
_V
Assertion
Ref Expression
ssonunii  |-  ( A 
C_  On  ->  U. A  e.  On )

Proof of Theorem ssonunii
StepHypRef Expression
1 ssonuni.1 . 2  |-  A  e. 
_V
2 ssonuni 4580 . 2  |-  ( A  e.  _V  ->  ( A  C_  On  ->  U. A  e.  On ) )
31, 2ax-mp 8 1  |-  ( A 
C_  On  ->  U. A  e.  On )
Colors of variables: wff set class
Syntax hints:    -> wi 4    e. wcel 1686   _Vcvv 2790    C_ wss 3154   U.cuni 3829   Oncon0 4394
This theorem is referenced by:  bm2.5ii  4599  tz9.12lem2  7462  ttukeylem6  8143
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1535  ax-5 1546  ax-17 1605  ax-9 1637  ax-8 1645  ax-13 1688  ax-14 1690  ax-6 1705  ax-7 1710  ax-11 1717  ax-12 1868  ax-ext 2266  ax-sep 4143  ax-nul 4151  ax-pr 4216  ax-un 4514
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 1531  df-nf 1534  df-sb 1632  df-eu 2149  df-mo 2150  df-clab 2272  df-cleq 2278  df-clel 2281  df-nfc 2410  df-ne 2450  df-ral 2550  df-rex 2551  df-rab 2554  df-v 2792  df-sbc 2994  df-dif 3157  df-un 3159  df-in 3161  df-ss 3168  df-pss 3170  df-nul 3458  df-if 3568  df-sn 3648  df-pr 3649  df-tp 3650  df-op 3651  df-uni 3830  df-br 4026  df-opab 4080  df-tr 4116  df-eprel 4307  df-po 4316  df-so 4317  df-fr 4354  df-we 4356  df-ord 4397  df-on 4398
  Copyright terms: Public domain W3C validator