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

Definition df-ord 4474
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 4470 . 2  wff  Ord  A
31wtr 4192 . . 3  wff  Tr  A
4 cep 4382 . . . 4  class  _E
51, 4wwe 4430 . . 3  wff  _E  We  A
63, 5wa 358 . 2  wff  ( Tr  A  /\  _E  We  A )
72, 6wb 176 1  wff  ( Ord 
A  <->  ( Tr  A  /\  _E  We  A ) )
Colors of variables: wff set class
This definition is referenced by:  ordeq  4478  ordwe  4484  ordtr  4485  trssord  4488  ordelord  4493  ord0  4523  ordon  4653  dford2  7408  smobeth  8295  gruina  8527  dford5reg  24696  dfon2  24706  tfrALTlem  24834
  Copyright terms: Public domain W3C validator