| 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 10866 | . 2 ⊢ (𝐴 ∈ N → 𝐴 ∈ ω) | |
| 2 | nnon 7871 | . 2 ⊢ (𝐴 ∈ ω → 𝐴 ∈ On) | |
| 3 | 1, 2 | syl 18 | 1 ⊢ (𝐴 ∈ N → 𝐴 ∈ On) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2150 Oncon0 6364 ωcom 7865 Ncnpi 10832 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-ext 2742 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-tru 1571 df-ex 1808 df-sb 2099 df-clab 2749 df-cleq 2762 df-clel 2845 df-rab 3424 df-v 3464 df-dif 3916 df-ss 3930 df-om 7866 df-ni 10860 |
| This theorem is referenced by: indpi 10895 nqereu 10917 |
| Copyright terms: Public domain | W3C validator |