| 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 10772 | . 2 ⊢ (𝐴 ∈ N → 𝐴 ∈ ω) | |
| 2 | nnord 7807 | . 2 ⊢ (𝐴 ∈ ω → Ord 𝐴) | |
| 3 | 1, 2 | syl 17 | 1 ⊢ (𝐴 ∈ N → Ord 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2109 Ord word 6306 ωcom 7799 Ncnpi 10738 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2701 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1543 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-ral 3045 df-rab 3395 df-v 3438 df-dif 3906 df-ss 3920 df-uni 4859 df-tr 5200 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-ord 6310 df-on 6311 df-om 7800 df-ni 10766 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |