![]() |
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 16018 | . 2 ⊢ (𝑃 ∈ ℙ ↔ (𝑃 ∈ (ℤ≥‘2) ∧ ∀𝑥 ∈ (ℤ≥‘2)(𝑥 ∥ 𝑃 → 𝑥 = 𝑃))) | |
2 | 1 | simplbi 501 | 1 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ (ℤ≥‘2)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1538 ∈ wcel 2111 ∀wral 3106 class class class wbr 5030 ‘cfv 6324 2c2 11680 ℤ≥cuz 12231 ∥ cdvds 15599 ℙcprime 16005 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-pre-sup 10604 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-2o 8086 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-sup 8890 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 df-nn 11626 df-2 11688 df-3 11689 df-n0 11886 df-z 11970 df-uz 12232 df-rp 12378 df-seq 13365 df-exp 13426 df-cj 14450 df-re 14451 df-im 14452 df-sqrt 14586 df-abs 14587 df-dvds 15600 df-prm 16006 |
This theorem is referenced by: prmgt1 16031 prmm2nn0 16032 oddprmgt2 16033 sqnprm 16036 isprm5 16041 isprm7 16042 prmrp 16046 isprm6 16048 prmdvdsexpb 16050 prmdiv 16112 prmdiveq 16113 modprm1div 16124 oddprm 16137 pcpremul 16170 pceulem 16172 pczpre 16174 pczcl 16175 pc1 16182 pczdvds 16189 pczndvds 16191 pczndvds2 16193 pcidlem 16198 pcmpt 16218 pcfaclem 16224 pcfac 16225 pockthlem 16231 pockthg 16232 prmunb 16240 prmreclem2 16243 prmgapprmolem 16387 odcau 18721 sylow3lem6 18749 gexexlem 18965 znfld 20252 logbprmirr 25382 wilthlem1 25653 wilthlem3 25655 wilth 25656 ppisval 25689 ppisval2 25690 chtge0 25697 isppw 25699 ppiprm 25736 chtprm 25738 chtwordi 25741 vma1 25751 fsumvma2 25798 chpval2 25802 chpchtsum 25803 chpub 25804 mersenne 25811 perfect1 25812 bposlem1 25868 lgslem1 25881 lgsval2lem 25891 lgsdirprm 25915 lgsne0 25919 lgsqrlem2 25931 gausslemma2dlem0b 25941 gausslemma2dlem4 25953 lgseisenlem1 25959 lgseisenlem3 25961 lgseisen 25963 lgsquadlem3 25966 m1lgs 25972 2sqblem 26015 chtppilimlem1 26057 rplogsumlem2 26069 rpvmasumlem 26071 dchrisum0flblem2 26093 padicabvcxp 26216 ostth3 26222 umgrhashecclwwlk 27863 fmtnoprmfac1 44082 fmtnoprmfac2lem1 44083 lighneallem2 44124 lighneallem4 44128 gbowgt5 44280 ztprmneprm 44749 |
Copyright terms: Public domain | W3C validator |