| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ontr | Structured version Visualization version GIF version | ||
| Description: An ordinal number is a transitive class. (Contributed by NM, 11-Jun-1994.) Put in closed form. (Resised by BJ, 28-Dec-2024.) |
| Ref | Expression |
|---|---|
| ontr | ⊢ (𝐴 ∈ On → Tr 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eloni 6320 | . 2 ⊢ (𝐴 ∈ On → Ord 𝐴) | |
| 2 | ordtr 6324 | . 2 ⊢ (Ord 𝐴 → Tr 𝐴) | |
| 3 | 1, 2 | syl 17 | 1 ⊢ (𝐴 ∈ On → Tr 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2119 Tr wtr 5179 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 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-tru 1550 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-ral 3054 df-v 3433 df-ss 3900 df-uni 4839 df-tr 5180 df-po 5526 df-so 5527 df-fr 5571 df-we 5573 df-ord 6313 df-on 6314 |
| This theorem is referenced by: onunisuc 6422 onuninsuci 7780 hfuni 36412 |
| Copyright terms: Public domain | W3C validator |