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

Theorem ssonuni 6640
Description: The union of a set of ordinal numbers is an ordinal number. Theorem 9 of [Suppes] p. 132. (Contributed by NM, 1-Nov-2003.)
Assertion
Ref Expression
ssonuni  |-  ( A  e.  V  ->  ( A  C_  On  ->  U. A  e.  On ) )

Proof of Theorem ssonuni
StepHypRef Expression
1 ssorduni 6639 . 2  |-  ( A 
C_  On  ->  Ord  U. A )
2 uniexg 6615 . . 3  |-  ( A  e.  V  ->  U. A  e.  _V )
3 elong 5450 . . 3  |-  ( U. A  e.  _V  ->  ( U. A  e.  On  <->  Ord  U. A ) )
42, 3syl 17 . 2  |-  ( A  e.  V  ->  ( U. A  e.  On  <->  Ord  U. A ) )
51, 4syl5ibr 229 1  |-  ( A  e.  V  ->  ( A  C_  On  ->  U. A  e.  On ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 189    e. wcel 1898   _Vcvv 3057    C_ wss 3416   U.cuni 4212   Ord word 5441   Oncon0 5442
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1680  ax-4 1693  ax-5 1769  ax-6 1816  ax-7 1862  ax-8 1900  ax-9 1907  ax-10 1926  ax-11 1931  ax-12 1944  ax-13 2102  ax-ext 2442  ax-sep 4539  ax-nul 4548  ax-pr 4653  ax-un 6610
This theorem depends on definitions:  df-bi 190  df-or 376  df-an 377  df-3or 992  df-3an 993  df-tru 1458  df-ex 1675  df-nf 1679  df-sb 1809  df-eu 2314  df-mo 2315  df-clab 2449  df-cleq 2455  df-clel 2458  df-nfc 2592  df-ne 2635  df-ral 2754  df-rex 2755  df-rab 2758  df-v 3059  df-sbc 3280  df-dif 3419  df-un 3421  df-in 3423  df-ss 3430  df-pss 3432  df-nul 3744  df-if 3894  df-sn 3981  df-pr 3983  df-tp 3985  df-op 3987  df-uni 4213  df-br 4417  df-opab 4476  df-tr 4512  df-eprel 4764  df-po 4774  df-so 4775  df-fr 4812  df-we 4814  df-ord 5445  df-on 5446
This theorem is referenced by:  ssonunii  6641  onuni  6647  iunon  7083  onfununi  7086  oemapvali  8215  cardprclem  8439  carduni  8441  dfac12lem2  8600  ontgval  31140
  Copyright terms: Public domain W3C validator