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

Theorem onord 2343
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 2209 . 2 |- (A e. On -> Ord A)
31, 2ax-mp 6 1 |- Ord A
Colors of variables: wff set class
Syntax hints:   e. wcel 1092  Ord word 2198  Oncon0 2199
This theorem is referenced by:  ontrc 2344  oneirr 2345  onuniorsuc 2355  onun 2358  onsucss 2359  oawordeulem 3156  r1val2 3522  rankel 3524  bndrank 3526  rankpr 3536  cardlim 3657  carduni 3664  cda1en 3721
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3an 583  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-sn 1811  df-pr 1812  df-op 1815  df-uni 1920  df-tr 2042  df-br 2063  df-po 2128  df-so 2138  df-fr 2169  df-we 2186  df-ord 2202  df-on 2203
metamath.org