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

Theorem ssonuni 4630
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 4629 . 2  |-  ( A 
C_  On  ->  Ord  U. A )
2 uniexg 4580 . . 3  |-  ( A  e.  V  ->  U. A  e.  _V )
3 elong 4513 . . 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, 4imbitrrid 156 1  |-  ( A  e.  V  ->  ( A  C_  On  ->  U. A  e.  On ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    e. wcel 2209   _Vcvv 2821    C_ wss 3220   U.cuni 3930   Ord word 4502   Oncon0 4503
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-un 4573
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-in 3226  df-ss 3233  df-uni 3931  df-tr 4225  df-iord 4506  df-on 4508
This theorem is referenced by:  ssonunii  4631  onun2  4632  onuni  4636  iunon  6545
  Copyright terms: Public domain W3C validator