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

Theorem dford2 8517
Description: Assuming ax-reg 8497, an ordinal is a transitive class on which inclusion satisfies trichotomy. (Contributed by Scott Fenton, 27-Oct-2010.)
Assertion
Ref Expression
dford2  |-  ( Ord 
A  <->  ( Tr  A  /\  A. x  e.  A  A. y  e.  A  ( x  e.  y  \/  x  =  y  \/  y  e.  x
) ) )
Distinct variable group:    x, y, A

Proof of Theorem dford2
StepHypRef Expression
1 df-ord 5726 . 2  |-  ( Ord 
A  <->  ( Tr  A  /\  _E  We  A ) )
2 zfregfr 8509 . . . . 5  |-  _E  Fr  A
3 dfwe2 6981 . . . . 5  |-  (  _E  We  A  <->  (  _E  Fr  A  /\  A. x  e.  A  A. y  e.  A  ( x  _E  y  \/  x  =  y  \/  y  _E  x ) ) )
42, 3mpbiran 953 . . . 4  |-  (  _E  We  A  <->  A. x  e.  A  A. y  e.  A  ( x  _E  y  \/  x  =  y  \/  y  _E  x ) )
5 epel 5032 . . . . . 6  |-  ( x  _E  y  <->  x  e.  y )
6 biid 251 . . . . . 6  |-  ( x  =  y  <->  x  =  y )
7 epel 5032 . . . . . 6  |-  ( y  _E  x  <->  y  e.  x )
85, 6, 73orbi123i 1252 . . . . 5  |-  ( ( x  _E  y  \/  x  =  y  \/  y  _E  x )  <-> 
( x  e.  y  \/  x  =  y  \/  y  e.  x
) )
982ralbii 2981 . . . 4  |-  ( A. x  e.  A  A. y  e.  A  (
x  _E  y  \/  x  =  y  \/  y  _E  x )  <->  A. x  e.  A  A. y  e.  A  ( x  e.  y  \/  x  =  y  \/  y  e.  x
) )
104, 9bitri 264 . . 3  |-  (  _E  We  A  <->  A. x  e.  A  A. y  e.  A  ( x  e.  y  \/  x  =  y  \/  y  e.  x ) )
1110anbi2i 730 . 2  |-  ( ( Tr  A  /\  _E  We  A )  <->  ( Tr  A  /\  A. x  e.  A  A. y  e.  A  ( x  e.  y  \/  x  =  y  \/  y  e.  x ) ) )
121, 11bitri 264 1  |-  ( Ord 
A  <->  ( Tr  A  /\  A. x  e.  A  A. y  e.  A  ( x  e.  y  \/  x  =  y  \/  y  e.  x
) ) )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 196    /\ wa 384    \/ w3o 1036   A.wral 2912   class class class wbr 4653   Tr wtr 4752    _E cep 5028    Fr wfr 5070    We wwe 5072   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-8 1992  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  ax-un 6949  ax-reg 8497
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-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-ord 5726
This theorem is referenced by:  ordelordALT  38747  ordelordALTVD  39103
  Copyright terms: Public domain W3C validator