Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > prmuz2 | Structured version Visualization version GIF version |
Description: A prime number is an integer greater than or equal to 2. (Contributed by Paul Chapman, 17-Nov-2012.) |
Ref | Expression |
---|---|
prmuz2 | ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ (ℤ≥‘2)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | isprm4 16031 | . 2 ⊢ (𝑃 ∈ ℙ ↔ (𝑃 ∈ (ℤ≥‘2) ∧ ∀𝑥 ∈ (ℤ≥‘2)(𝑥 ∥ 𝑃 → 𝑥 = 𝑃))) | |
2 | 1 | simplbi 500 | 1 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ (ℤ≥‘2)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1536 ∈ wcel 2113 ∀wral 3141 class class class wbr 5069 ‘cfv 6358 2c2 11695 ℤ≥cuz 12246 ∥ cdvds 15610 ℙcprime 16018 |
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 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-cnex 10596 ax-resscn 10597 ax-1cn 10598 ax-icn 10599 ax-addcl 10600 ax-addrcl 10601 ax-mulcl 10602 ax-mulrcl 10603 ax-mulcom 10604 ax-addass 10605 ax-mulass 10606 ax-distr 10607 ax-i2m1 10608 ax-1ne0 10609 ax-1rid 10610 ax-rnegex 10611 ax-rrecex 10612 ax-cnre 10613 ax-pre-lttri 10614 ax-pre-lttrn 10615 ax-pre-ltadd 10616 ax-pre-mulgt0 10617 ax-pre-sup 10618 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-nel 3127 df-ral 3146 df-rex 3147 df-reu 3148 df-rmo 3149 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7117 df-ov 7162 df-oprab 7163 df-mpo 7164 df-om 7584 df-2nd 7693 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-1o 8105 df-2o 8106 df-er 8292 df-en 8513 df-dom 8514 df-sdom 8515 df-fin 8516 df-sup 8909 df-pnf 10680 df-mnf 10681 df-xr 10682 df-ltxr 10683 df-le 10684 df-sub 10875 df-neg 10876 df-div 11301 df-nn 11642 df-2 11703 df-3 11704 df-n0 11901 df-z 11985 df-uz 12247 df-rp 12393 df-seq 13373 df-exp 13433 df-cj 14461 df-re 14462 df-im 14463 df-sqrt 14597 df-abs 14598 df-dvds 15611 df-prm 16019 |
This theorem is referenced by: prmgt1 16044 prmm2nn0 16045 oddprmgt2 16046 sqnprm 16049 isprm5 16054 isprm7 16055 prmrp 16059 isprm6 16061 prmdvdsexpb 16063 prmdiv 16125 prmdiveq 16126 modprm1div 16137 oddprm 16150 pcpremul 16183 pceulem 16185 pczpre 16187 pczcl 16188 pc1 16195 pczdvds 16202 pczndvds 16204 pczndvds2 16206 pcidlem 16211 pcmpt 16231 pcfaclem 16237 pcfac 16238 pockthlem 16244 pockthg 16245 prmunb 16253 prmreclem2 16256 prmgapprmolem 16400 odcau 18732 sylow3lem6 18760 gexexlem 18975 znfld 20710 logbprmirr 25377 wilthlem1 25648 wilthlem3 25650 wilth 25651 ppisval 25684 ppisval2 25685 chtge0 25692 isppw 25694 ppiprm 25731 chtprm 25733 chtwordi 25736 vma1 25746 fsumvma2 25793 chpval2 25797 chpchtsum 25798 chpub 25799 mersenne 25806 perfect1 25807 bposlem1 25863 lgslem1 25876 lgsval2lem 25886 lgsdirprm 25910 lgsne0 25914 lgsqrlem2 25926 gausslemma2dlem0b 25936 gausslemma2dlem4 25948 lgseisenlem1 25954 lgseisenlem3 25956 lgseisen 25958 lgsquadlem3 25961 m1lgs 25967 2sqblem 26010 chtppilimlem1 26052 rplogsumlem2 26064 rpvmasumlem 26066 dchrisum0flblem2 26088 padicabvcxp 26211 ostth3 26217 umgrhashecclwwlk 27860 fmtnoprmfac1 43734 fmtnoprmfac2lem1 43735 lighneallem2 43778 lighneallem4 43782 gbowgt5 43934 ztprmneprm 44402 |
Copyright terms: Public domain | W3C validator |