Theorem piord 10771

Description: A positive integer is ordinal. (Contributed by NM, 29-Jan-1996.) (New usage is discouraged.)

Assertion

Ref	Expression
piord	⊢ (𝐴 ∈ N → Ord 𝐴)

Proof of Theorem piord

Step	Hyp	Ref	Expression
1		pinn 10769	. 2 ⊢ (𝐴 ∈ N → 𝐴 ∈ ω)
2		nnord 7804	. 2 ⊢ (𝐴 ∈ ω → Ord 𝐴)
3	1, 2	syl 17	1 ⊢ (𝐴 ∈ N → Ord 𝐴)

Syntax hints:   → wi 4   ∈ wcel 2111  Ord word 6305  ωcom 7796  Ncnpi 10735

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 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-ext 2703

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1544  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-ral 3048  df-rab 3396  df-v 3438  df-dif 3900  df-ss 3914  df-uni 4857  df-tr 5197  df-po 5522  df-so 5523  df-fr 5567  df-we 5569  df-ord 6309  df-on 6310  df-om 7797  df-ni 10763

This theorem is referenced by: (None)