ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ssonuni Unicode version

Theorem ssonuni 4232
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 4231 . 2  |-  ( A 
C_  On  ->  Ord  U. A )
2 uniexg 4193 . . 3  |-  ( A  e.  V  ->  U. A  e.  _V )
3 elong 4128 . . 3  |-  ( U. A  e.  _V  ->  ( U. A  e.  On  <->  Ord  U. A ) )
42, 3syl 14 . 2  |-  ( A  e.  V  ->  ( U. A  e.  On  <->  Ord  U. A ) )
51, 4syl5ibr 154 1  |-  ( A  e.  V  ->  ( A  C_  On  ->  U. A  e.  On ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 103    e. wcel 1433   _Vcvv 2601    C_ wss 2973   U.cuni 3601   Ord word 4117   Oncon0 4118
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-un 4188
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-in 2979  df-ss 2986  df-uni 3602  df-tr 3876  df-iord 4121  df-on 4123
This theorem is referenced by:  ssonunii  4233  onun2  4234  onuni  4238  iunon  5922
  Copyright terms: Public domain W3C validator