![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > oddprmge3 | Structured version Visualization version GIF version |
Description: An odd prime is greater than or equal to 3. (Contributed by Alexander van der Vekens, 7-Oct-2018.) (Revised by AV, 20-Aug-2021.) |
Ref | Expression |
---|---|
oddprmge3 | ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ (ℤ≥‘3)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eldifi 3765 | . . 3 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ ℙ) | |
2 | oddprmgt2 15458 | . . 3 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 2 < 𝑃) | |
3 | 3z 11448 | . . . . 5 ⊢ 3 ∈ ℤ | |
4 | 3 | a1i 11 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 2 < 𝑃) → 3 ∈ ℤ) |
5 | prmz 15436 | . . . . 5 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ) | |
6 | 5 | adantr 480 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 2 < 𝑃) → 𝑃 ∈ ℤ) |
7 | df-3 11118 | . . . . 5 ⊢ 3 = (2 + 1) | |
8 | 2z 11447 | . . . . . . 7 ⊢ 2 ∈ ℤ | |
9 | zltp1le 11465 | . . . . . . 7 ⊢ ((2 ∈ ℤ ∧ 𝑃 ∈ ℤ) → (2 < 𝑃 ↔ (2 + 1) ≤ 𝑃)) | |
10 | 8, 5, 9 | sylancr 696 | . . . . . 6 ⊢ (𝑃 ∈ ℙ → (2 < 𝑃 ↔ (2 + 1) ≤ 𝑃)) |
11 | 10 | biimpa 500 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 2 < 𝑃) → (2 + 1) ≤ 𝑃) |
12 | 7, 11 | syl5eqbr 4720 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 2 < 𝑃) → 3 ≤ 𝑃) |
13 | 4, 6, 12 | 3jca 1261 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 2 < 𝑃) → (3 ∈ ℤ ∧ 𝑃 ∈ ℤ ∧ 3 ≤ 𝑃)) |
14 | 1, 2, 13 | syl2anc 694 | . 2 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → (3 ∈ ℤ ∧ 𝑃 ∈ ℤ ∧ 3 ≤ 𝑃)) |
15 | eluz2 11731 | . 2 ⊢ (𝑃 ∈ (ℤ≥‘3) ↔ (3 ∈ ℤ ∧ 𝑃 ∈ ℤ ∧ 3 ≤ 𝑃)) | |
16 | 14, 15 | sylibr 224 | 1 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ (ℤ≥‘3)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 383 ∧ w3a 1054 ∈ wcel 2030 ∖ cdif 3604 {csn 4210 class class class wbr 4685 ‘cfv 5926 (class class class)co 6690 1c1 9975 + caddc 9977 < clt 10112 ≤ cle 10113 2c2 11108 3c3 11109 ℤcz 11415 ℤ≥cuz 11725 ℙcprime 15432 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-8 2032 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-sep 4814 ax-nul 4822 ax-pow 4873 ax-pr 4936 ax-un 6991 ax-cnex 10030 ax-resscn 10031 ax-1cn 10032 ax-icn 10033 ax-addcl 10034 ax-addrcl 10035 ax-mulcl 10036 ax-mulrcl 10037 ax-mulcom 10038 ax-addass 10039 ax-mulass 10040 ax-distr 10041 ax-i2m1 10042 ax-1ne0 10043 ax-1rid 10044 ax-rnegex 10045 ax-rrecex 10046 ax-cnre 10047 ax-pre-lttri 10048 ax-pre-lttrn 10049 ax-pre-ltadd 10050 ax-pre-mulgt0 10051 ax-pre-sup 10052 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1055 df-3an 1056 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-eu 2502 df-mo 2503 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ne 2824 df-nel 2927 df-ral 2946 df-rex 2947 df-reu 2948 df-rmo 2949 df-rab 2950 df-v 3233 df-sbc 3469 df-csb 3567 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-pss 3623 df-nul 3949 df-if 4120 df-pw 4193 df-sn 4211 df-pr 4213 df-tp 4215 df-op 4217 df-uni 4469 df-iun 4554 df-br 4686 df-opab 4746 df-mpt 4763 df-tr 4786 df-id 5053 df-eprel 5058 df-po 5064 df-so 5065 df-fr 5102 df-we 5104 df-xp 5149 df-rel 5150 df-cnv 5151 df-co 5152 df-dm 5153 df-rn 5154 df-res 5155 df-ima 5156 df-pred 5718 df-ord 5764 df-on 5765 df-lim 5766 df-suc 5767 df-iota 5889 df-fun 5928 df-fn 5929 df-f 5930 df-f1 5931 df-fo 5932 df-f1o 5933 df-fv 5934 df-riota 6651 df-ov 6693 df-oprab 6694 df-mpt2 6695 df-om 7108 df-2nd 7211 df-wrecs 7452 df-recs 7513 df-rdg 7551 df-1o 7605 df-2o 7606 df-er 7787 df-en 7998 df-dom 7999 df-sdom 8000 df-fin 8001 df-sup 8389 df-pnf 10114 df-mnf 10115 df-xr 10116 df-ltxr 10117 df-le 10118 df-sub 10306 df-neg 10307 df-div 10723 df-nn 11059 df-2 11117 df-3 11118 df-n0 11331 df-z 11416 df-uz 11726 df-rp 11871 df-seq 12842 df-exp 12901 df-cj 13883 df-re 13884 df-im 13885 df-sqrt 14019 df-abs 14020 df-dvds 15028 df-prm 15433 |
This theorem is referenced by: prmn2uzge3OLD 15460 gausslemma2dlem0i 25134 numclwwlk5 27375 lighneallem2 41848 oddprmuzge3 41950 |
Copyright terms: Public domain | W3C validator |