Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > prmssnn | Structured version Visualization version GIF version |
Description: The prime numbers are a subset of the positive integers. (Contributed by AV, 22-Jul-2020.) |
Ref | Expression |
---|---|
prmssnn | ⊢ ℙ ⊆ ℕ |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | prmnn 15226 | . 2 ⊢ (𝑥 ∈ ℙ → 𝑥 ∈ ℕ) | |
2 | 1 | ssriv 3572 | 1 ⊢ ℙ ⊆ ℕ |
Colors of variables: wff setvar class |
Syntax hints: ⊆ wss 3540 ℕcn 10897 ℙcprime 15223 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rab 2905 df-v 3175 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-br 4584 df-prm 15224 |
This theorem is referenced by: prmex 15229 prmgaplem3 15595 prmgaplem4 15596 prmdvdsfmtnof1lem1 40034 prmdvdsfmtnof 40036 |
Copyright terms: Public domain | W3C validator |