| 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 4085 | . . 3 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ ℙ) | |
| 2 | oddprmgt2 16640 | . . 3 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 2 < 𝑃) | |
| 3 | 3z 12538 | . . . . 5 ⊢ 3 ∈ ℤ | |
| 4 | 3 | a1i 11 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 2 < 𝑃) → 3 ∈ ℤ) |
| 5 | prmz 16616 | . . . . 5 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ) | |
| 6 | 5 | adantr 480 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 2 < 𝑃) → 𝑃 ∈ ℤ) |
| 7 | df-3 12223 | . . . . 5 ⊢ 3 = (2 + 1) | |
| 8 | 2z 12537 | . . . . . . 7 ⊢ 2 ∈ ℤ | |
| 9 | zltp1le 12555 | . . . . . . 7 ⊢ ((2 ∈ ℤ ∧ 𝑃 ∈ ℤ) → (2 < 𝑃 ↔ (2 + 1) ≤ 𝑃)) | |
| 10 | 8, 5, 9 | sylancr 588 | . . . . . 6 ⊢ (𝑃 ∈ ℙ → (2 < 𝑃 ↔ (2 + 1) ≤ 𝑃)) |
| 11 | 10 | biimpa 476 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 2 < 𝑃) → (2 + 1) ≤ 𝑃) |
| 12 | 7, 11 | eqbrtrid 5135 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 2 < 𝑃) → 3 ≤ 𝑃) |
| 13 | 4, 6, 12 | 3jca 1129 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 2 < 𝑃) → (3 ∈ ℤ ∧ 𝑃 ∈ ℤ ∧ 3 ≤ 𝑃)) |
| 14 | 1, 2, 13 | syl2anc 585 | . 2 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → (3 ∈ ℤ ∧ 𝑃 ∈ ℤ ∧ 3 ≤ 𝑃)) |
| 15 | eluz2 12771 | . 2 ⊢ (𝑃 ∈ (ℤ≥‘3) ↔ (3 ∈ ℤ ∧ 𝑃 ∈ ℤ ∧ 3 ≤ 𝑃)) | |
| 16 | 14, 15 | sylibr 234 | 1 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ (ℤ≥‘3)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 ∈ wcel 2114 ∖ cdif 3900 {csn 4582 class class class wbr 5100 ‘cfv 6502 (class class class)co 7370 1c1 11041 + caddc 11043 < clt 11180 ≤ cle 11181 2c2 12214 3c3 12215 ℤcz 12502 ℤ≥cuz 12765 ℙcprime 16612 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 ax-cnex 11096 ax-resscn 11097 ax-1cn 11098 ax-icn 11099 ax-addcl 11100 ax-addrcl 11101 ax-mulcl 11102 ax-mulrcl 11103 ax-mulcom 11104 ax-addass 11105 ax-mulass 11106 ax-distr 11107 ax-i2m1 11108 ax-1ne0 11109 ax-1rid 11110 ax-rnegex 11111 ax-rrecex 11112 ax-cnre 11113 ax-pre-lttri 11114 ax-pre-lttrn 11115 ax-pre-ltadd 11116 ax-pre-mulgt0 11117 ax-pre-sup 11118 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5529 df-eprel 5534 df-po 5542 df-so 5543 df-fr 5587 df-we 5589 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6269 df-ord 6330 df-on 6331 df-lim 6332 df-suc 6333 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-riota 7327 df-ov 7373 df-oprab 7374 df-mpo 7375 df-om 7821 df-2nd 7946 df-frecs 8235 df-wrecs 8266 df-recs 8315 df-rdg 8353 df-1o 8409 df-2o 8410 df-er 8647 df-en 8898 df-dom 8899 df-sdom 8900 df-fin 8901 df-sup 9359 df-pnf 11182 df-mnf 11183 df-xr 11184 df-ltxr 11185 df-le 11186 df-sub 11380 df-neg 11381 df-div 11809 df-nn 12160 df-2 12222 df-3 12223 df-n0 12416 df-z 12503 df-uz 12766 df-rp 12920 df-seq 13939 df-exp 13999 df-cj 15036 df-re 15037 df-im 15038 df-sqrt 15172 df-abs 15173 df-dvds 16194 df-prm 16613 |
| This theorem is referenced by: gausslemma2dlem0i 27348 numclwwlk5 30481 lighneallem2 47995 oddprmuzge3 48105 |
| Copyright terms: Public domain | W3C validator |