Theorem piord 10636

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 10634	. 2 ⊢ (𝐴 ∈ N → 𝐴 ∈ ω)
2		nnord 7720	. 2 ⊢ (𝐴 ∈ ω → Ord 𝐴)
3	1, 2	syl 17	1 ⊢ (𝐴 ∈ N → Ord 𝐴)

Syntax hints:   → wi 4   ∈ wcel 2106  Ord word 6265  ωcom 7712  Ncnpi 10600

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 397  df-tru 1542  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ral 3069  df-rab 3073  df-v 3434  df-dif 3890  df-in 3894  df-ss 3904  df-uni 4840  df-tr 5192  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-ord 6269  df-on 6270  df-om 7713  df-ni 10628

This theorem is referenced by: (None)