| 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 2942 |
. 2
|
| 3 | 1 | wtr 2675 |
. . 3
|
| 4 | cep 2825 |
. . . 4
| |
| 5 | 1, 4 | wwe 2911 |
. . 3
|
| 6 | 3, 5 | wa 223 |
. 2
|
| 7 | 2, 6 | wb 146 |
1
|
| Colors of variables: wff set class |
| This definition is referenced by: ordeq 2950 ordwe 2956 ordtr 2957 trssord 2960 ordelord 2965 ordon 2982 ord0 3016 |