| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pion | Structured version Visualization version GIF version | ||
| Description: A positive integer is an ordinal number. (Contributed by NM, 23-Mar-1996.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| pion | ⊢ (𝐴 ∈ N → 𝐴 ∈ On) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pinn 10789 | . 2 ⊢ (𝐴 ∈ N → 𝐴 ∈ ω) | |
| 2 | nnon 7814 | . 2 ⊢ (𝐴 ∈ ω → 𝐴 ∈ On) | |
| 3 | 1, 2 | syl 17 | 1 ⊢ (𝐴 ∈ N → 𝐴 ∈ On) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2113 Oncon0 6317 ωcom 7808 Ncnpi 10755 |
| 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 2115 ax-9 2123 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1544 df-ex 1781 df-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-rab 3400 df-v 3442 df-dif 3904 df-ss 3918 df-om 7809 df-ni 10783 |
| This theorem is referenced by: indpi 10818 nqereu 10840 |
| Copyright terms: Public domain | W3C validator |