| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > piord | Structured version Visualization version GIF version | ||
| Description: A positive integer is ordinal. (Contributed by NM, 29-Jan-1996.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| piord | ⊢ (𝐴 ∈ N → Ord 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pinn 10791 | . 2 ⊢ (𝐴 ∈ N → 𝐴 ∈ ω) | |
| 2 | nnord 7816 | . 2 ⊢ (𝐴 ∈ ω → Ord 𝐴) | |
| 3 | 1, 2 | syl 17 | 1 ⊢ (𝐴 ∈ N → Ord 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2114 Ord word 6315 ωcom 7808 Ncnpi 10757 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2707 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2714 df-cleq 2727 df-clel 2810 df-ral 3051 df-rab 3399 df-v 3441 df-dif 3903 df-ss 3917 df-uni 4863 df-tr 5205 df-po 5531 df-so 5532 df-fr 5576 df-we 5578 df-ord 6319 df-on 6320 df-om 7809 df-ni 10785 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |