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

Theorem orduniorsuc 4769
Description: An ordinal class is either its union or the successor of its union. If we adopt the view that zero is a limit ordinal, this means every ordinal class is either a limit or a successor. (Contributed by NM, 13-Sep-2003.)
Assertion
Ref Expression
orduniorsuc  |-  ( Ord 
A  ->  ( A  =  U. A  \/  A  =  suc  U. A ) )

Proof of Theorem orduniorsuc
StepHypRef Expression
1 orduniss 4635 . . . . . 6  |-  ( Ord 
A  ->  U. A  C_  A )
2 orduni 4733 . . . . . . . 8  |-  ( Ord 
A  ->  Ord  U. A
)
3 ordelssne 4568 . . . . . . . 8  |-  ( ( Ord  U. A  /\  Ord  A )  ->  ( U. A  e.  A  <->  ( U. A  C_  A  /\  U. A  =/=  A
) ) )
42, 3mpancom 651 . . . . . . 7  |-  ( Ord 
A  ->  ( U. A  e.  A  <->  ( U. A  C_  A  /\  U. A  =/=  A ) ) )
54biimprd 215 . . . . . 6  |-  ( Ord 
A  ->  ( ( U. A  C_  A  /\  U. A  =/=  A )  ->  U. A  e.  A
) )
61, 5mpand 657 . . . . 5  |-  ( Ord 
A  ->  ( U. A  =/=  A  ->  U. A  e.  A ) )
7 ordsucss 4757 . . . . 5  |-  ( Ord 
A  ->  ( U. A  e.  A  ->  suc  U. A  C_  A ) )
86, 7syld 42 . . . 4  |-  ( Ord 
A  ->  ( U. A  =/=  A  ->  suc  U. A  C_  A )
)
9 ordsucuni 4768 . . . 4  |-  ( Ord 
A  ->  A  C_  suc  U. A )
108, 9jctild 528 . . 3  |-  ( Ord 
A  ->  ( U. A  =/=  A  ->  ( A  C_  suc  U. A  /\  suc  U. A  C_  A ) ) )
11 df-ne 2569 . . . 4  |-  ( A  =/=  U. A  <->  -.  A  =  U. A )
12 necom 2648 . . . 4  |-  ( A  =/=  U. A  <->  U. A  =/= 
A )
1311, 12bitr3i 243 . . 3  |-  ( -.  A  =  U. A  <->  U. A  =/=  A )
14 eqss 3323 . . 3  |-  ( A  =  suc  U. A  <->  ( A  C_  suc  U. A  /\  suc  U. A  C_  A ) )
1510, 13, 143imtr4g 262 . 2  |-  ( Ord 
A  ->  ( -.  A  =  U. A  ->  A  =  suc  U. A
) )
1615orrd 368 1  |-  ( Ord 
A  ->  ( A  =  U. A  \/  A  =  suc  U. A ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 177    \/ wo 358    /\ wa 359    = wceq 1649    e. wcel 1721    =/= wne 2567    C_ wss 3280   U.cuni 3975   Ord word 4540   suc csuc 4543
This theorem is referenced by:  onuniorsuci  4778  oeeulem  6803  cantnfp1lem2  7591  cantnflem1  7601  cnfcom2lem  7614  dfac12lem1  7979  dfac12lem2  7980  ttukeylem3  8347  ttukeylem5  8349  ttukeylem6  8350  ordtoplem  26089  ordcmp  26101  aomclem5  27023
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-13 1723  ax-14 1725  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2385  ax-sep 4290  ax-nul 4298  ax-pr 4363  ax-un 4660
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3or 937  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2258  df-mo 2259  df-clab 2391  df-cleq 2397  df-clel 2400  df-nfc 2529  df-ne 2569  df-ral 2671  df-rex 2672  df-rab 2675  df-v 2918  df-sbc 3122  df-dif 3283  df-un 3285  df-in 3287  df-ss 3294  df-pss 3296  df-nul 3589  df-if 3700  df-sn 3780  df-pr 3781  df-tp 3782  df-op 3783  df-uni 3976  df-br 4173  df-opab 4227  df-tr 4263  df-eprel 4454  df-po 4463  df-so 4464  df-fr 4501  df-we 4503  df-ord 4544  df-on 4545  df-suc 4547
  Copyright terms: Public domain W3C validator