HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Definition df-ord 3660
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.
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 3656 . 2 wff Ord A
31wtr 3411 . . 3 wff Tr A
4 cep 3581 . . . 4 class _E
51, 4wwe 3624 . . 3 wff _E We A
63, 5wa 240 . 2 wff (Tr A /\ _E We A)
72, 6wb 163 1 wff (Ord A <-> (Tr A /\ _E We A))
Colors of variables: wff set class
This definition is referenced by:  ordeq 3664  ordwe 3671  ordtr 3672  trssord 3675  ordelord 3680  ord0 3715  ordon 3863  dford2 5711  dford3 13848  dfon2 13858  tfrALTlem 13976  tartord 15240
Copyright terms: Public domain