| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > oddprm | Structured version Visualization version GIF version | ||
| Description: A prime not equal to 2 is odd. (Contributed by Mario Carneiro, 4-Feb-2015.) (Proof shortened by AV, 10-Jul-2022.) |
| Ref | Expression |
|---|---|
| oddprm | ⊢ (𝑁 ∈ (ℙ ∖ {2}) → ((𝑁 − 1) / 2) ∈ ℕ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eldifi 4085 | . . . . 5 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → 𝑁 ∈ ℙ) | |
| 2 | prmz 16728 | . . . . 5 ⊢ (𝑁 ∈ ℙ → 𝑁 ∈ ℤ) | |
| 3 | 1, 2 | syl 18 | . . . 4 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → 𝑁 ∈ ℤ) |
| 4 | eldifsni 4758 | . . . . . . 7 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → 𝑁 ≠ 2) | |
| 5 | 4 | necomd 3013 | . . . . . 6 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → 2 ≠ 𝑁) |
| 6 | 5 | neneqd 2963 | . . . . 5 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → ¬ 2 = 𝑁) |
| 7 | 2z 12621 | . . . . . . 7 ⊢ 2 ∈ ℤ | |
| 8 | uzid 12872 | . . . . . . 7 ⊢ (2 ∈ ℤ → 2 ∈ (ℤ≥‘2)) | |
| 9 | 7, 8 | ax-mp 5 | . . . . . 6 ⊢ 2 ∈ (ℤ≥‘2) |
| 10 | dvdsprm 16757 | . . . . . 6 ⊢ ((2 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℙ) → (2 ∥ 𝑁 ↔ 2 = 𝑁)) | |
| 11 | 9, 1, 10 | sylancr 598 | . . . . 5 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → (2 ∥ 𝑁 ↔ 2 = 𝑁)) |
| 12 | 6, 11 | mtbird 328 | . . . 4 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → ¬ 2 ∥ 𝑁) |
| 13 | 1z 12619 | . . . . 5 ⊢ 1 ∈ ℤ | |
| 14 | n2dvds1 16421 | . . . . 5 ⊢ ¬ 2 ∥ 1 | |
| 15 | omoe 16417 | . . . . 5 ⊢ (((𝑁 ∈ ℤ ∧ ¬ 2 ∥ 𝑁) ∧ (1 ∈ ℤ ∧ ¬ 2 ∥ 1)) → 2 ∥ (𝑁 − 1)) | |
| 16 | 13, 14, 15 | mpanr12 717 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ ¬ 2 ∥ 𝑁) → 2 ∥ (𝑁 − 1)) |
| 17 | 3, 12, 16 | syl2anc 595 | . . 3 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → 2 ∥ (𝑁 − 1)) |
| 18 | prmnn 16727 | . . . . 5 ⊢ (𝑁 ∈ ℙ → 𝑁 ∈ ℕ) | |
| 19 | nnm1nn0 12540 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (𝑁 − 1) ∈ ℕ0) | |
| 20 | 1, 18, 19 | 3syl 19 | . . . 4 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → (𝑁 − 1) ∈ ℕ0) |
| 21 | nn0z 12610 | . . . 4 ⊢ ((𝑁 − 1) ∈ ℕ0 → (𝑁 − 1) ∈ ℤ) | |
| 22 | evend2 16410 | . . . 4 ⊢ ((𝑁 − 1) ∈ ℤ → (2 ∥ (𝑁 − 1) ↔ ((𝑁 − 1) / 2) ∈ ℤ)) | |
| 23 | 20, 21, 22 | 3syl 19 | . . 3 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → (2 ∥ (𝑁 − 1) ↔ ((𝑁 − 1) / 2) ∈ ℤ)) |
| 24 | 17, 23 | mpbid 235 | . 2 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → ((𝑁 − 1) / 2) ∈ ℤ) |
| 25 | prmuz2 16749 | . . 3 ⊢ (𝑁 ∈ ℙ → 𝑁 ∈ (ℤ≥‘2)) | |
| 26 | uz2m1nn 12942 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 − 1) ∈ ℕ) | |
| 27 | nngt0 12262 | . . . 4 ⊢ ((𝑁 − 1) ∈ ℕ → 0 < (𝑁 − 1)) | |
| 28 | nnre 12235 | . . . . 5 ⊢ ((𝑁 − 1) ∈ ℕ → (𝑁 − 1) ∈ ℝ) | |
| 29 | 2rp 13016 | . . . . . 6 ⊢ 2 ∈ ℝ+ | |
| 30 | 29 | a1i 11 | . . . . 5 ⊢ ((𝑁 − 1) ∈ ℕ → 2 ∈ ℝ+) |
| 31 | 28, 30 | gt0divd 13092 | . . . 4 ⊢ ((𝑁 − 1) ∈ ℕ → (0 < (𝑁 − 1) ↔ 0 < ((𝑁 − 1) / 2))) |
| 32 | 27, 31 | mpbid 235 | . . 3 ⊢ ((𝑁 − 1) ∈ ℕ → 0 < ((𝑁 − 1) / 2)) |
| 33 | 1, 25, 26, 32 | 4syl 20 | . 2 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → 0 < ((𝑁 − 1) / 2)) |
| 34 | elnnz 12596 | . 2 ⊢ (((𝑁 − 1) / 2) ∈ ℕ ↔ (((𝑁 − 1) / 2) ∈ ℤ ∧ 0 < ((𝑁 − 1) / 2))) | |
| 35 | 24, 33, 34 | sylanbrc 594 | 1 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → ((𝑁 − 1) / 2) ∈ ℕ) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ∖ cdif 3902 {csn 4589 class class class wbr 5109 ‘cfv 6536 (class class class)co 7410 0cc0 11095 1c1 11096 < clt 11238 − cmin 11436 / cdiv 11866 ℕcn 12228 2c2 12290 ℕ0cn0 12499 ℤcz 12586 ℤ≥cuz 12857 ℝ+crp 13011 ∥ cdvds 16305 ℙcprime 16724 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172 ax-pre-sup 11173 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-2o 8450 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-sup 9398 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-div 11867 df-nn 12229 df-2 12298 df-3 12299 df-n0 12500 df-z 12587 df-uz 12858 df-rp 13012 df-seq 14034 df-exp 14094 df-cj 15146 df-re 15147 df-im 15148 df-sqrt 15282 df-abs 15283 df-dvds 16306 df-prm 16725 |
| This theorem is referenced by: nnoddn2prm 16866 4sqlem19 17018 lgslem1 27461 lgslem4 27464 lgsval2lem 27471 lgsvalmod 27480 lgsmod 27487 lgsdirprm 27495 lgsne0 27499 lgsqrlem1 27510 lgsqrlem2 27511 lgsqrlem3 27512 lgsqrlem4 27513 gausslemma2dlem4 27533 lgseisenlem1 27539 lgseisenlem2 27540 lgseisenlem4 27542 lgseisen 27543 m1lgs 27552 2lgslem2 27559 fmtnoprmfac2 48319 |
| Copyright terms: Public domain | W3C validator |