Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ontrci | Structured version Visualization version GIF version |
Description: An ordinal number is a transitive class. (Contributed by NM, 11-Jun-1994.) |
Ref | Expression |
---|---|
on.1 | ⊢ 𝐴 ∈ On |
Ref | Expression |
---|---|
ontrci | ⊢ Tr 𝐴 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | on.1 | . . 3 ⊢ 𝐴 ∈ On | |
2 | 1 | onordi 6297 | . 2 ⊢ Ord 𝐴 |
3 | ordtr 6207 | . 2 ⊢ (Ord 𝐴 → Tr 𝐴) | |
4 | 2, 3 | ax-mp 5 | 1 ⊢ Tr 𝐴 |
Colors of variables: wff setvar class |
Syntax hints: ∈ wcel 2114 Tr wtr 5174 Ord word 6192 Oncon0 6193 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ral 3145 df-v 3498 df-in 3945 df-ss 3954 df-uni 4841 df-tr 5175 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-ord 6196 df-on 6197 |
This theorem is referenced by: onunisuci 6306 hfuni 33647 |
Copyright terms: Public domain | W3C validator |