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

Theorem ssorduni 4656
Description: The union of a class of ordinal numbers is ordinal. Proposition 7.19 of [TakeutiZaring] p. 40. (Contributed by NM, 30-May-1994.) (Proof shortened by Andrew Salmon, 12-Aug-2011.)
Assertion
Ref Expression
ssorduni  |-  ( A 
C_  On  ->  Ord  U. A )

Proof of Theorem ssorduni
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eluni2 3910 . . . . 5  |-  ( x  e.  U. A  <->  E. y  e.  A  x  e.  y )
2 ssel 3250 . . . . . . . . 9  |-  ( A 
C_  On  ->  ( y  e.  A  ->  y  e.  On ) )
3 onelss 4513 . . . . . . . . 9  |-  ( y  e.  On  ->  (
x  e.  y  ->  x  C_  y ) )
42, 3syl6 29 . . . . . . . 8  |-  ( A 
C_  On  ->  ( y  e.  A  ->  (
x  e.  y  ->  x  C_  y ) ) )
5 anc2r 539 . . . . . . . 8  |-  ( ( y  e.  A  -> 
( x  e.  y  ->  x  C_  y
) )  ->  (
y  e.  A  -> 
( x  e.  y  ->  ( x  C_  y  /\  y  e.  A
) ) ) )
64, 5syl 15 . . . . . . 7  |-  ( A 
C_  On  ->  ( y  e.  A  ->  (
x  e.  y  -> 
( x  C_  y  /\  y  e.  A
) ) ) )
7 ssuni 3928 . . . . . . 7  |-  ( ( x  C_  y  /\  y  e.  A )  ->  x  C_  U. A )
86, 7syl8 65 . . . . . 6  |-  ( A 
C_  On  ->  ( y  e.  A  ->  (
x  e.  y  ->  x  C_  U. A ) ) )
98rexlimdv 2742 . . . . 5  |-  ( A 
C_  On  ->  ( E. y  e.  A  x  e.  y  ->  x  C_ 
U. A ) )
101, 9syl5bi 208 . . . 4  |-  ( A 
C_  On  ->  ( x  e.  U. A  ->  x  C_  U. A ) )
1110ralrimiv 2701 . . 3  |-  ( A 
C_  On  ->  A. x  e.  U. A x  C_  U. A )
12 dftr3 4196 . . 3  |-  ( Tr 
U. A  <->  A. x  e.  U. A x  C_  U. A )
1311, 12sylibr 203 . 2  |-  ( A 
C_  On  ->  Tr  U. A )
14 onelon 4496 . . . . . . 7  |-  ( ( y  e.  On  /\  x  e.  y )  ->  x  e.  On )
1514ex 423 . . . . . 6  |-  ( y  e.  On  ->  (
x  e.  y  ->  x  e.  On )
)
162, 15syl6 29 . . . . 5  |-  ( A 
C_  On  ->  ( y  e.  A  ->  (
x  e.  y  ->  x  e.  On )
) )
1716rexlimdv 2742 . . . 4  |-  ( A 
C_  On  ->  ( E. y  e.  A  x  e.  y  ->  x  e.  On ) )
181, 17syl5bi 208 . . 3  |-  ( A 
C_  On  ->  ( x  e.  U. A  ->  x  e.  On )
)
1918ssrdv 3261 . 2  |-  ( A 
C_  On  ->  U. A  C_  On )
20 ordon 4653 . . 3  |-  Ord  On
21 trssord 4488 . . . 4  |-  ( ( Tr  U. A  /\  U. A  C_  On  /\  Ord  On )  ->  Ord  U. A
)
22213exp 1150 . . 3  |-  ( Tr 
U. A  ->  ( U. A  C_  On  ->  ( Ord  On  ->  Ord  U. A ) ) )
2320, 22mpii 39 . 2  |-  ( Tr 
U. A  ->  ( U. A  C_  On  ->  Ord  U. A ) )
2413, 19, 23sylc 56 1  |-  ( A 
C_  On  ->  Ord  U. A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    e. wcel 1710   A.wral 2619   E.wrex 2620    C_ wss 3228   U.cuni 3906   Tr wtr 4192   Ord word 4470   Oncon0 4471
This theorem is referenced by:  ssonuni  4657  ssonprc  4662  orduni  4664  onsucuni  4698  limuni3  4722  onfununi  6442  tfrlem8  6484  onssnum  7754  unialeph  7815  cfslbn  7980  hsmexlem1  8139  inaprc  8545  nobndlem1  24904  nobndlem2  24905
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-13 1712  ax-14 1714  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1930  ax-ext 2339  ax-sep 4220  ax-nul 4228  ax-pr 4293  ax-un 4591
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-eu 2213  df-mo 2214  df-clab 2345  df-cleq 2351  df-clel 2354  df-nfc 2483  df-ne 2523  df-ral 2624  df-rex 2625  df-rab 2628  df-v 2866  df-sbc 3068  df-dif 3231  df-un 3233  df-in 3235  df-ss 3242  df-pss 3244  df-nul 3532  df-if 3642  df-sn 3722  df-pr 3723  df-tp 3724  df-op 3725  df-uni 3907  df-br 4103  df-opab 4157  df-tr 4193  df-eprel 4384  df-po 4393  df-so 4394  df-fr 4431  df-we 4433  df-ord 4474  df-on 4475
  Copyright terms: Public domain W3C validator