| 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 16614 | . . . . 5 ⊢ (𝑁 ∈ ℙ → 𝑁 ∈ ℤ) | |
| 3 | 1, 2 | syl 17 | . . . 4 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → 𝑁 ∈ ℤ) |
| 4 | eldifsni 4748 | . . . . . . 7 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → 𝑁 ≠ 2) | |
| 5 | 4 | necomd 2988 | . . . . . 6 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → 2 ≠ 𝑁) |
| 6 | 5 | neneqd 2938 | . . . . 5 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → ¬ 2 = 𝑁) |
| 7 | 2z 12535 | . . . . . . 7 ⊢ 2 ∈ ℤ | |
| 8 | uzid 12778 | . . . . . . 7 ⊢ (2 ∈ ℤ → 2 ∈ (ℤ≥‘2)) | |
| 9 | 7, 8 | ax-mp 5 | . . . . . 6 ⊢ 2 ∈ (ℤ≥‘2) |
| 10 | dvdsprm 16642 | . . . . . 6 ⊢ ((2 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℙ) → (2 ∥ 𝑁 ↔ 2 = 𝑁)) | |
| 11 | 9, 1, 10 | sylancr 588 | . . . . 5 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → (2 ∥ 𝑁 ↔ 2 = 𝑁)) |
| 12 | 6, 11 | mtbird 325 | . . . 4 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → ¬ 2 ∥ 𝑁) |
| 13 | 1z 12533 | . . . . 5 ⊢ 1 ∈ ℤ | |
| 14 | n2dvds1 16307 | . . . . 5 ⊢ ¬ 2 ∥ 1 | |
| 15 | omoe 16303 | . . . . 5 ⊢ (((𝑁 ∈ ℤ ∧ ¬ 2 ∥ 𝑁) ∧ (1 ∈ ℤ ∧ ¬ 2 ∥ 1)) → 2 ∥ (𝑁 − 1)) | |
| 16 | 13, 14, 15 | mpanr12 706 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ ¬ 2 ∥ 𝑁) → 2 ∥ (𝑁 − 1)) |
| 17 | 3, 12, 16 | syl2anc 585 | . . 3 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → 2 ∥ (𝑁 − 1)) |
| 18 | prmnn 16613 | . . . . 5 ⊢ (𝑁 ∈ ℙ → 𝑁 ∈ ℕ) | |
| 19 | nnm1nn0 12454 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (𝑁 − 1) ∈ ℕ0) | |
| 20 | 1, 18, 19 | 3syl 18 | . . . 4 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → (𝑁 − 1) ∈ ℕ0) |
| 21 | nn0z 12524 | . . . 4 ⊢ ((𝑁 − 1) ∈ ℕ0 → (𝑁 − 1) ∈ ℤ) | |
| 22 | evend2 16296 | . . . 4 ⊢ ((𝑁 − 1) ∈ ℤ → (2 ∥ (𝑁 − 1) ↔ ((𝑁 − 1) / 2) ∈ ℤ)) | |
| 23 | 20, 21, 22 | 3syl 18 | . . 3 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → (2 ∥ (𝑁 − 1) ↔ ((𝑁 − 1) / 2) ∈ ℤ)) |
| 24 | 17, 23 | mpbid 232 | . 2 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → ((𝑁 − 1) / 2) ∈ ℤ) |
| 25 | prmuz2 16635 | . . 3 ⊢ (𝑁 ∈ ℙ → 𝑁 ∈ (ℤ≥‘2)) | |
| 26 | uz2m1nn 12848 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 − 1) ∈ ℕ) | |
| 27 | nngt0 12188 | . . . 4 ⊢ ((𝑁 − 1) ∈ ℕ → 0 < (𝑁 − 1)) | |
| 28 | nnre 12164 | . . . . 5 ⊢ ((𝑁 − 1) ∈ ℕ → (𝑁 − 1) ∈ ℝ) | |
| 29 | 2rp 12922 | . . . . . 6 ⊢ 2 ∈ ℝ+ | |
| 30 | 29 | a1i 11 | . . . . 5 ⊢ ((𝑁 − 1) ∈ ℕ → 2 ∈ ℝ+) |
| 31 | 28, 30 | gt0divd 12998 | . . . 4 ⊢ ((𝑁 − 1) ∈ ℕ → (0 < (𝑁 − 1) ↔ 0 < ((𝑁 − 1) / 2))) |
| 32 | 27, 31 | mpbid 232 | . . 3 ⊢ ((𝑁 − 1) ∈ ℕ → 0 < ((𝑁 − 1) / 2)) |
| 33 | 1, 25, 26, 32 | 4syl 19 | . 2 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → 0 < ((𝑁 − 1) / 2)) |
| 34 | elnnz 12510 | . 2 ⊢ (((𝑁 − 1) / 2) ∈ ℕ ↔ (((𝑁 − 1) / 2) ∈ ℤ ∧ 0 < ((𝑁 − 1) / 2))) | |
| 35 | 24, 33, 34 | sylanbrc 584 | 1 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → ((𝑁 − 1) / 2) ∈ ℕ) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∖ cdif 3900 {csn 4582 class class class wbr 5100 ‘cfv 6500 (class class class)co 7368 0cc0 11038 1c1 11039 < clt 11178 − cmin 11376 / cdiv 11806 ℕcn 12157 2c2 12212 ℕ0cn0 12413 ℤcz 12500 ℤ≥cuz 12763 ℝ+crp 12917 ∥ cdvds 16191 ℙcprime 16610 |
| 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 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 |
| 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 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-2o 8408 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-sup 9357 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-div 11807 df-nn 12158 df-2 12220 df-3 12221 df-n0 12414 df-z 12501 df-uz 12764 df-rp 12918 df-seq 13937 df-exp 13997 df-cj 15034 df-re 15035 df-im 15036 df-sqrt 15170 df-abs 15171 df-dvds 16192 df-prm 16611 |
| This theorem is referenced by: nnoddn2prm 16751 4sqlem19 16903 lgslem1 27276 lgslem4 27279 lgsval2lem 27286 lgsvalmod 27295 lgsmod 27302 lgsdirprm 27310 lgsne0 27314 lgsqrlem1 27325 lgsqrlem2 27326 lgsqrlem3 27327 lgsqrlem4 27328 gausslemma2dlem4 27348 lgseisenlem1 27354 lgseisenlem2 27355 lgseisenlem4 27357 lgseisen 27358 m1lgs 27367 2lgslem2 27374 fmtnoprmfac2 47927 |
| Copyright terms: Public domain | W3C validator |