![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > prmssnn | 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 12112 | . 2 ⊢ (𝑥 ∈ ℙ → 𝑥 ∈ ℕ) | |
2 | 1 | ssriv 3161 | 1 ⊢ ℙ ⊆ ℕ |
Colors of variables: wff set class |
Syntax hints: ⊆ wss 3131 ℕcn 8921 ℙcprime 12109 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-ext 2159 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-nf 1461 df-sb 1763 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ral 2460 df-rab 2464 df-v 2741 df-un 3135 df-in 3137 df-ss 3144 df-sn 3600 df-pr 3601 df-op 3603 df-br 4006 df-prm 12110 |
This theorem is referenced by: prmex 12115 1arith 12367 prminf 12458 |
Copyright terms: Public domain | W3C validator |