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

Definition df-ord 4367
Description: Define the ordinal predicate, which is true for a class that is transitive and is well-ordered by the epsilon relation. Variant of definition of [BellMachover] p. 468. (Contributed by NM, 17-Sep-1993.)
Assertion
Ref Expression
df-ord  |-  ( Ord 
A  <->  ( Tr  A  /\  _E  We  A ) )

Detailed syntax breakdown of Definition df-ord
StepHypRef Expression
1 cA . . 3  class  A
21word 4363 . 2  wff  Ord  A
31wtr 4087 . . 3  wff  Tr  A
4 cep 4275 . . . 4  class  _E
51, 4wwe 4323 . . 3  wff  _E  We  A
63, 5wa 360 . 2  wff  ( Tr  A  /\  _E  We  A )
72, 6wb 178 1  wff  ( Ord 
A  <->  ( Tr  A  /\  _E  We  A ) )
Colors of variables: wff set class
This definition is referenced by:  ordeq  4371  ordwe  4377  ordtr  4378  trssord  4381  ordelord  4386  ord0  4416  ordon  4546  dford2  7289  smobeth  8176  gruina  8408  dford5reg  23508  dfon2  23518  tfrALTlem  23646
  Copyright terms: Public domain W3C validator