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

Theorem ssonuni 4404
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 4403 . 2  |-  ( A 
C_  On  ->  Ord  U. A )
2 uniexg 4361 . . 3  |-  ( A  e.  V  ->  U. A  e.  _V )
3 elong 4295 . . 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 155 1  |-  ( A  e.  V  ->  ( A  C_  On  ->  U. A  e.  On ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104    e. wcel 1480   _Vcvv 2686    C_ wss 3071   U.cuni 3736   Ord word 4284   Oncon0 4285
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-un 4355
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-in 3077  df-ss 3084  df-uni 3737  df-tr 4027  df-iord 4288  df-on 4290
This theorem is referenced by:  ssonunii  4405  onun2  4406  onuni  4410  iunon  6181
  Copyright terms: Public domain W3C validator