| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| 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. |
| Ref | Expression |
|---|---|
| df-ord |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cA |
. . 3
| |
| 2 | 1 | word 3656 |
. 2
|
| 3 | 1 | wtr 3411 |
. . 3
|
| 4 | cep 3581 |
. . . 4
| |
| 5 | 1, 4 | wwe 3624 |
. . 3
|
| 6 | 3, 5 | wa 240 |
. 2
|
| 7 | 2, 6 | wb 163 |
1
|
| 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 |