| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dford5 | Structured version Visualization version GIF version | ||
| Description: A class is ordinal iff it is a subclass of On and transitive. (Contributed by Scott Fenton, 21-Nov-2021.) |
| Ref | Expression |
|---|---|
| dford5 | ⊢ (Ord 𝐴 ↔ (𝐴 ⊆ On ∧ Tr 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ordsson 7726 | . . 3 ⊢ (Ord 𝐴 → 𝐴 ⊆ On) | |
| 2 | ordtr 6324 | . . 3 ⊢ (Ord 𝐴 → Tr 𝐴) | |
| 3 | 1, 2 | jca 516 | . 2 ⊢ (Ord 𝐴 → (𝐴 ⊆ On ∧ Tr 𝐴)) |
| 4 | epweon 7718 | . . . 4 ⊢ E We On | |
| 5 | wess 5604 | . . . 4 ⊢ (𝐴 ⊆ On → ( E We On → E We 𝐴)) | |
| 6 | 4, 5 | mpi 20 | . . 3 ⊢ (𝐴 ⊆ On → E We 𝐴) |
| 7 | df-ord 6313 | . . . . 5 ⊢ (Ord 𝐴 ↔ (Tr 𝐴 ∧ E We 𝐴)) | |
| 8 | 7 | biimpri 229 | . . . 4 ⊢ ((Tr 𝐴 ∧ E We 𝐴) → Ord 𝐴) |
| 9 | 8 | ancoms 459 | . . 3 ⊢ (( E We 𝐴 ∧ Tr 𝐴) → Ord 𝐴) |
| 10 | 6, 9 | sylan 586 | . 2 ⊢ ((𝐴 ⊆ On ∧ Tr 𝐴) → Ord 𝐴) |
| 11 | 3, 10 | impbii 210 | 1 ⊢ (Ord 𝐴 ↔ (𝐴 ⊆ On ∧ Tr 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 207 ∧ wa 396 ⊆ wss 3883 Tr wtr 5179 E cep 5517 We wwe 5570 Ord word 6309 Oncon0 6310 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 ax-sep 5218 ax-pr 5362 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-ne 2935 df-ral 3054 df-rex 3064 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-br 5073 df-opab 5135 df-tr 5180 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-we 5573 df-ord 6313 df-on 6314 |
| This theorem is referenced by: nosupno 27685 noinfno 27700 bdayons 28286 nadd2rabord 43830 nadd1rabord 43834 |
| Copyright terms: Public domain | W3C validator |