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

Theorem ordtri1 5756
Description: A trichotomy law for ordinals. (Contributed by NM, 25-Mar-1995.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
Assertion
Ref Expression
ordtri1  |-  ( ( Ord  A  /\  Ord  B )  ->  ( A  C_  B  <->  -.  B  e.  A ) )

Proof of Theorem ordtri1
StepHypRef Expression
1 ordsseleq 5752 . 2  |-  ( ( Ord  A  /\  Ord  B )  ->  ( A  C_  B  <->  ( A  e.  B  \/  A  =  B ) ) )
2 ordn2lp 5743 . . . . 5  |-  ( Ord 
A  ->  -.  ( A  e.  B  /\  B  e.  A )
)
3 imnan 438 . . . . 5  |-  ( ( A  e.  B  ->  -.  B  e.  A
)  <->  -.  ( A  e.  B  /\  B  e.  A ) )
42, 3sylibr 224 . . . 4  |-  ( Ord 
A  ->  ( A  e.  B  ->  -.  B  e.  A ) )
5 ordirr 5741 . . . . 5  |-  ( Ord 
B  ->  -.  B  e.  B )
6 eleq2 2690 . . . . . 6  |-  ( A  =  B  ->  ( B  e.  A  <->  B  e.  B ) )
76notbid 308 . . . . 5  |-  ( A  =  B  ->  ( -.  B  e.  A  <->  -.  B  e.  B ) )
85, 7syl5ibrcom 237 . . . 4  |-  ( Ord 
B  ->  ( A  =  B  ->  -.  B  e.  A ) )
94, 8jaao 531 . . 3  |-  ( ( Ord  A  /\  Ord  B )  ->  ( ( A  e.  B  \/  A  =  B )  ->  -.  B  e.  A
) )
10 ordtri3or 5755 . . . . . 6  |-  ( ( Ord  A  /\  Ord  B )  ->  ( A  e.  B  \/  A  =  B  \/  B  e.  A ) )
11 df-3or 1038 . . . . . 6  |-  ( ( A  e.  B  \/  A  =  B  \/  B  e.  A )  <->  ( ( A  e.  B  \/  A  =  B
)  \/  B  e.  A ) )
1210, 11sylib 208 . . . . 5  |-  ( ( Ord  A  /\  Ord  B )  ->  ( ( A  e.  B  \/  A  =  B )  \/  B  e.  A
) )
1312orcomd 403 . . . 4  |-  ( ( Ord  A  /\  Ord  B )  ->  ( B  e.  A  \/  ( A  e.  B  \/  A  =  B )
) )
1413ord 392 . . 3  |-  ( ( Ord  A  /\  Ord  B )  ->  ( -.  B  e.  A  ->  ( A  e.  B  \/  A  =  B )
) )
159, 14impbid 202 . 2  |-  ( ( Ord  A  /\  Ord  B )  ->  ( ( A  e.  B  \/  A  =  B )  <->  -.  B  e.  A ) )
161, 15bitrd 268 1  |-  ( ( Ord  A  /\  Ord  B )  ->  ( A  C_  B  <->  -.  B  e.  A ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 196    \/ wo 383    /\ wa 384    \/ w3o 1036    = wceq 1483    e. wcel 1990    C_ wss 3574   Ord word 5722
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-tr 4753  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-ord 5726
This theorem is referenced by:  ontri1  5757  ordtri2  5758  ordtri4  5761  ordtr3  5769  ordtr3OLD  5770  ordintdif  5774  ordtri2or  5822  ordsucss  7018  ordsucsssuc  7023  ordsucuniel  7024  limsssuc  7050  ssnlim  7083  smoword  7463  tfrlem15  7488  nnaword  7707  nnawordex  7717  onomeneq  8150  nndomo  8154  isfinite2  8218  unfilem1  8224  wofib  8450  cantnflem1  8586  alephgeom  8905  alephdom2  8910  cflim2  9085  fin67  9217  winainflem  9515  finminlem  32312
  Copyright terms: Public domain W3C validator