| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 2lgslem3c1 | Structured version Visualization version GIF version | ||
| Description: Lemma 3 for 2lgslem3 27348. (Contributed by AV, 16-Jul-2021.) |
| Ref | Expression |
|---|---|
| 2lgslem2.n | ⊢ 𝑁 = (((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))) |
| Ref | Expression |
|---|---|
| 2lgslem3c1 | ⊢ ((𝑃 ∈ ℕ ∧ (𝑃 mod 8) = 5) → (𝑁 mod 2) = 1) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnnn0 12425 | . . . 4 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℕ0) | |
| 2 | 8nn 12257 | . . . . 5 ⊢ 8 ∈ ℕ | |
| 3 | nnrp 12939 | . . . . 5 ⊢ (8 ∈ ℕ → 8 ∈ ℝ+) | |
| 4 | 2, 3 | ax-mp 5 | . . . 4 ⊢ 8 ∈ ℝ+ |
| 5 | modmuladdnn0 13856 | . . . 4 ⊢ ((𝑃 ∈ ℕ0 ∧ 8 ∈ ℝ+) → ((𝑃 mod 8) = 5 → ∃𝑘 ∈ ℕ0 𝑃 = ((𝑘 · 8) + 5))) | |
| 6 | 1, 4, 5 | sylancl 586 | . . 3 ⊢ (𝑃 ∈ ℕ → ((𝑃 mod 8) = 5 → ∃𝑘 ∈ ℕ0 𝑃 = ((𝑘 · 8) + 5))) |
| 7 | simpr 484 | . . . . 5 ⊢ ((𝑃 ∈ ℕ ∧ 𝑘 ∈ ℕ0) → 𝑘 ∈ ℕ0) | |
| 8 | nn0cn 12428 | . . . . . . . . . . 11 ⊢ (𝑘 ∈ ℕ0 → 𝑘 ∈ ℂ) | |
| 9 | 8cn 12259 | . . . . . . . . . . . 12 ⊢ 8 ∈ ℂ | |
| 10 | 9 | a1i 11 | . . . . . . . . . . 11 ⊢ (𝑘 ∈ ℕ0 → 8 ∈ ℂ) |
| 11 | 8, 10 | mulcomd 11171 | . . . . . . . . . 10 ⊢ (𝑘 ∈ ℕ0 → (𝑘 · 8) = (8 · 𝑘)) |
| 12 | 11 | adantl 481 | . . . . . . . . 9 ⊢ ((𝑃 ∈ ℕ ∧ 𝑘 ∈ ℕ0) → (𝑘 · 8) = (8 · 𝑘)) |
| 13 | 12 | oveq1d 7384 | . . . . . . . 8 ⊢ ((𝑃 ∈ ℕ ∧ 𝑘 ∈ ℕ0) → ((𝑘 · 8) + 5) = ((8 · 𝑘) + 5)) |
| 14 | 13 | eqeq2d 2740 | . . . . . . 7 ⊢ ((𝑃 ∈ ℕ ∧ 𝑘 ∈ ℕ0) → (𝑃 = ((𝑘 · 8) + 5) ↔ 𝑃 = ((8 · 𝑘) + 5))) |
| 15 | 14 | biimpa 476 | . . . . . 6 ⊢ (((𝑃 ∈ ℕ ∧ 𝑘 ∈ ℕ0) ∧ 𝑃 = ((𝑘 · 8) + 5)) → 𝑃 = ((8 · 𝑘) + 5)) |
| 16 | 2lgslem2.n | . . . . . . 7 ⊢ 𝑁 = (((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))) | |
| 17 | 16 | 2lgslem3c 27342 | . . . . . 6 ⊢ ((𝑘 ∈ ℕ0 ∧ 𝑃 = ((8 · 𝑘) + 5)) → 𝑁 = ((2 · 𝑘) + 1)) |
| 18 | 7, 15, 17 | syl2an2r 685 | . . . . 5 ⊢ (((𝑃 ∈ ℕ ∧ 𝑘 ∈ ℕ0) ∧ 𝑃 = ((𝑘 · 8) + 5)) → 𝑁 = ((2 · 𝑘) + 1)) |
| 19 | oveq1 7376 | . . . . . 6 ⊢ (𝑁 = ((2 · 𝑘) + 1) → (𝑁 mod 2) = (((2 · 𝑘) + 1) mod 2)) | |
| 20 | nn0z 12530 | . . . . . . . 8 ⊢ (𝑘 ∈ ℕ0 → 𝑘 ∈ ℤ) | |
| 21 | eqidd 2730 | . . . . . . . 8 ⊢ (𝑘 ∈ ℕ0 → ((2 · 𝑘) + 1) = ((2 · 𝑘) + 1)) | |
| 22 | 2tp1odd 16298 | . . . . . . . 8 ⊢ ((𝑘 ∈ ℤ ∧ ((2 · 𝑘) + 1) = ((2 · 𝑘) + 1)) → ¬ 2 ∥ ((2 · 𝑘) + 1)) | |
| 23 | 20, 21, 22 | syl2anc 584 | . . . . . . 7 ⊢ (𝑘 ∈ ℕ0 → ¬ 2 ∥ ((2 · 𝑘) + 1)) |
| 24 | 2z 12541 | . . . . . . . . . . 11 ⊢ 2 ∈ ℤ | |
| 25 | 24 | a1i 11 | . . . . . . . . . 10 ⊢ (𝑘 ∈ ℕ0 → 2 ∈ ℤ) |
| 26 | 25, 20 | zmulcld 12620 | . . . . . . . . 9 ⊢ (𝑘 ∈ ℕ0 → (2 · 𝑘) ∈ ℤ) |
| 27 | 26 | peano2zd 12617 | . . . . . . . 8 ⊢ (𝑘 ∈ ℕ0 → ((2 · 𝑘) + 1) ∈ ℤ) |
| 28 | mod2eq1n2dvds 16293 | . . . . . . . 8 ⊢ (((2 · 𝑘) + 1) ∈ ℤ → ((((2 · 𝑘) + 1) mod 2) = 1 ↔ ¬ 2 ∥ ((2 · 𝑘) + 1))) | |
| 29 | 27, 28 | syl 17 | . . . . . . 7 ⊢ (𝑘 ∈ ℕ0 → ((((2 · 𝑘) + 1) mod 2) = 1 ↔ ¬ 2 ∥ ((2 · 𝑘) + 1))) |
| 30 | 23, 29 | mpbird 257 | . . . . . 6 ⊢ (𝑘 ∈ ℕ0 → (((2 · 𝑘) + 1) mod 2) = 1) |
| 31 | 19, 30 | sylan9eqr 2786 | . . . . 5 ⊢ ((𝑘 ∈ ℕ0 ∧ 𝑁 = ((2 · 𝑘) + 1)) → (𝑁 mod 2) = 1) |
| 32 | 7, 18, 31 | syl2an2r 685 | . . . 4 ⊢ (((𝑃 ∈ ℕ ∧ 𝑘 ∈ ℕ0) ∧ 𝑃 = ((𝑘 · 8) + 5)) → (𝑁 mod 2) = 1) |
| 33 | 32 | rexlimdva2 3136 | . . 3 ⊢ (𝑃 ∈ ℕ → (∃𝑘 ∈ ℕ0 𝑃 = ((𝑘 · 8) + 5) → (𝑁 mod 2) = 1)) |
| 34 | 6, 33 | syld 47 | . 2 ⊢ (𝑃 ∈ ℕ → ((𝑃 mod 8) = 5 → (𝑁 mod 2) = 1)) |
| 35 | 34 | imp 406 | 1 ⊢ ((𝑃 ∈ ℕ ∧ (𝑃 mod 8) = 5) → (𝑁 mod 2) = 1) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∃wrex 3053 class class class wbr 5102 ‘cfv 6499 (class class class)co 7369 ℂcc 11042 1c1 11045 + caddc 11047 · cmul 11049 − cmin 11381 / cdiv 11811 ℕcn 12162 2c2 12217 4c4 12219 5c5 12220 8c8 12223 ℕ0cn0 12418 ℤcz 12505 ℝ+crp 12927 ⌊cfl 13728 mod cmo 13807 ∥ cdvds 16198 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 ax-pre-sup 11122 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-om 7823 df-2nd 7948 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-er 8648 df-en 8896 df-dom 8897 df-sdom 8898 df-sup 9369 df-inf 9370 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-div 11812 df-nn 12163 df-2 12225 df-3 12226 df-4 12227 df-5 12228 df-6 12229 df-7 12230 df-8 12231 df-n0 12419 df-z 12506 df-uz 12770 df-rp 12928 df-ico 13288 df-fl 13730 df-mod 13808 df-dvds 16199 |
| This theorem is referenced by: 2lgslem3 27348 |
| Copyright terms: Public domain | W3C validator |