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

Theorem piord 5008
Description: A positive integer is ordinal.
Assertion
Ref Expression
piord |- (A e. N. -> Ord A)

Proof of Theorem piord
StepHypRef Expression
1 pinn 5006 . 2 |- (A e. N. -> A e. om)
2 nnord 3140 . 2 |- (A e. om -> Ord A)
31, 2syl 10 1 |- (A e. N. -> Ord A)
Colors of variables: wff set class
Syntax hints:   -> wi 3   e. wcel 958  Ord word 2947  omcom 3131  N.cnpi 4972
This theorem is referenced by:  ltsopi 5016
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  df-om 3132  df-ni 5000
Copyright terms: Public domain