Theorem piord 10949

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

Syntax hints:   → wi 4   ∈ wcel 2108  Ord word 6394  ωcom 7903  Ncnpi 10913

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1540  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ral 3068  df-rab 3444  df-v 3490  df-dif 3979  df-ss 3993  df-uni 4932  df-tr 5284  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-ord 6398  df-on 6399  df-om 7904  df-ni 10941

This theorem is referenced by: (None)