HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem onord 3095
Description: An ordinal number is an ordinal class.
Hypothesis
Ref Expression
on.1 |- A e. On
Assertion
Ref Expression
onord |- Ord A

Proof of Theorem onord
StepHypRef Expression
1 on.1 . 2 |- A e. On
2 eloni 2958 . 2 |- (A e. On -> Ord A)
31, 2ax-mp 7 1 |- Ord A
Colors of variables: wff set class
Syntax hints:   e. wcel 958  Ord word 2947  Oncon0 2948
This theorem is referenced by:  ontrc 3096  onirr 3097  onuniorsuc 3107  onun 3110  onsucss 3111  oawordeulem 4188  rankel 4680  bndrank 4682  rankpr 4692  rankuniss 4701  rankelpr 4708  rankelop 4709  rankxplim3 4714  rankxpsuc 4715  cardlim 4851  carduni 4858  alephfp 4900  cda1en 4926
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3an 777  df-ex 981  df-sb 1172  df-clab 1464  df-cleq 1469  df-clel 1472  df-ral 1649  df-rex 1650  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-sn 2412  df-pr 2413  df-op 2416  df-uni 2504  df-br 2620  df-tr 2681  df-po 2840  df-so 2850  df-fr 2917  df-we 2934  df-ord 2951  df-on 2952
Copyright terms: Public domain