| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 2lgslem3a1 | Structured version Visualization version GIF version | ||
| Description: Lemma 1 for 2lgslem3 27790. (Contributed by AV, 15-Jul-2021.) |
| Ref | Expression |
|---|---|
| 2lgslem2.n | ⊢ 𝑁 = (((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))) |
| Ref | Expression |
|---|---|
| 2lgslem3a1 | ⊢ ((𝑃 ∈ ℕ ∧ (𝑃 mod 8) = 1) → (𝑁 mod 2) = 0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnnn0 12652 | . . . 4 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℕ0) | |
| 2 | 8nn 12477 | . . . . 5 ⊢ 8 ∈ ℕ | |
| 3 | nnrp 13171 | . . . . 5 ⊢ (8 ∈ ℕ → 8 ∈ ℝ+) | |
| 4 | 2, 3 | ax-mp 5 | . . . 4 ⊢ 8 ∈ ℝ+ |
| 5 | modmuladdnn0 14097 | . . . 4 ⊢ ((𝑃 ∈ ℕ0 ∧ 8 ∈ ℝ+) → ((𝑃 mod 8) = 1 → ∃𝑘 ∈ ℕ0 𝑃 = ((𝑘 · 8) + 1))) | |
| 6 | 1, 4, 5 | sylancl 598 | . . 3 ⊢ (𝑃 ∈ ℕ → ((𝑃 mod 8) = 1 → ∃𝑘 ∈ ℕ0 𝑃 = ((𝑘 · 8) + 1))) |
| 7 | simpr 490 | . . . . 5 ⊢ ((𝑃 ∈ ℕ ∧ 𝑘 ∈ ℕ0) → 𝑘 ∈ ℕ0) | |
| 8 | nn0cn 12655 | . . . . . . . . . . 11 ⊢ (𝑘 ∈ ℕ0 → 𝑘 ∈ ℂ) | |
| 9 | 8cn 12479 | . . . . . . . . . . . 12 ⊢ 8 ∈ ℂ | |
| 10 | 9 | a1i 11 | . . . . . . . . . . 11 ⊢ (𝑘 ∈ ℕ0 → 8 ∈ ℂ) |
| 11 | 8, 10 | mulcomd 11368 | . . . . . . . . . 10 ⊢ (𝑘 ∈ ℕ0 → (𝑘 · 8) = (8 · 𝑘)) |
| 12 | 11 | adantl 487 | . . . . . . . . 9 ⊢ ((𝑃 ∈ ℕ ∧ 𝑘 ∈ ℕ0) → (𝑘 · 8) = (8 · 𝑘)) |
| 13 | 12 | oveq1d 7465 | . . . . . . . 8 ⊢ ((𝑃 ∈ ℕ ∧ 𝑘 ∈ ℕ0) → ((𝑘 · 8) + 1) = ((8 · 𝑘) + 1)) |
| 14 | 13 | eqeq2d 2777 | . . . . . . 7 ⊢ ((𝑃 ∈ ℕ ∧ 𝑘 ∈ ℕ0) → (𝑃 = ((𝑘 · 8) + 1) ↔ 𝑃 = ((8 · 𝑘) + 1))) |
| 15 | 14 | biimpa 482 | . . . . . 6 ⊢ (((𝑃 ∈ ℕ ∧ 𝑘 ∈ ℕ0) ∧ 𝑃 = ((𝑘 · 8) + 1)) → 𝑃 = ((8 · 𝑘) + 1)) |
| 16 | 2lgslem2.n | . . . . . . 7 ⊢ 𝑁 = (((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))) | |
| 17 | 16 | 2lgslem3a 27782 | . . . . . 6 ⊢ ((𝑘 ∈ ℕ0 ∧ 𝑃 = ((8 · 𝑘) + 1)) → 𝑁 = (2 · 𝑘)) |
| 18 | 7, 15, 17 | syl2an2r 698 | . . . . 5 ⊢ (((𝑃 ∈ ℕ ∧ 𝑘 ∈ ℕ0) ∧ 𝑃 = ((𝑘 · 8) + 1)) → 𝑁 = (2 · 𝑘)) |
| 19 | oveq1 7457 | . . . . . 6 ⊢ (𝑁 = (2 · 𝑘) → (𝑁 mod 2) = ((2 · 𝑘) mod 2)) | |
| 20 | 2cnd 12460 | . . . . . . . . 9 ⊢ (𝑘 ∈ ℕ0 → 2 ∈ ℂ) | |
| 21 | 20, 8 | mulcomd 11368 | . . . . . . . 8 ⊢ (𝑘 ∈ ℕ0 → (2 · 𝑘) = (𝑘 · 2)) |
| 22 | 21 | oveq1d 7465 | . . . . . . 7 ⊢ (𝑘 ∈ ℕ0 → ((2 · 𝑘) mod 2) = ((𝑘 · 2) mod 2)) |
| 23 | nn0z 12756 | . . . . . . . 8 ⊢ (𝑘 ∈ ℕ0 → 𝑘 ∈ ℤ) | |
| 24 | 2rp 13164 | . . . . . . . 8 ⊢ 2 ∈ ℝ+ | |
| 25 | mulmod0 14056 | . . . . . . . 8 ⊢ ((𝑘 ∈ ℤ ∧ 2 ∈ ℝ+) → ((𝑘 · 2) mod 2) = 0) | |
| 26 | 23, 24, 25 | sylancl 598 | . . . . . . 7 ⊢ (𝑘 ∈ ℕ0 → ((𝑘 · 2) mod 2) = 0) |
| 27 | 22, 26 | eqtrd 2801 | . . . . . 6 ⊢ (𝑘 ∈ ℕ0 → ((2 · 𝑘) mod 2) = 0) |
| 28 | 19, 27 | sylan9eqr 2823 | . . . . 5 ⊢ ((𝑘 ∈ ℕ0 ∧ 𝑁 = (2 · 𝑘)) → (𝑁 mod 2) = 0) |
| 29 | 7, 18, 28 | syl2an2r 698 | . . . 4 ⊢ (((𝑃 ∈ ℕ ∧ 𝑘 ∈ ℕ0) ∧ 𝑃 = ((𝑘 · 8) + 1)) → (𝑁 mod 2) = 0) |
| 30 | 29 | rexlimdva2 3172 | . . 3 ⊢ (𝑃 ∈ ℕ → (∃𝑘 ∈ ℕ0 𝑃 = ((𝑘 · 8) + 1) → (𝑁 mod 2) = 0)) |
| 31 | 6, 30 | syld 48 | . 2 ⊢ (𝑃 ∈ ℕ → ((𝑃 mod 8) = 1 → (𝑁 mod 2) = 0)) |
| 32 | 31 | imp 412 | 1 ⊢ ((𝑃 ∈ ℕ ∧ (𝑃 mod 8) = 1) → (𝑁 mod 2) = 0) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1572 ∈ wcel 2150 ∃wrex 3093 ‘cfv 6565 (class class class)co 7450 ℂcc 11236 0cc0 11238 1c1 11239 + caddc 11241 · cmul 11243 − cmin 11579 / cdiv 12012 ℕcn 12374 2c2 12436 4c4 12438 8c8 12442 ℕ0cn0 12645 ℤcz 12732 ℝ+crp 13159 ⌊cfl 13969 mod cmo 14048 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 ax-pre-sup 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-er 8754 df-en 9011 df-dom 9012 df-sdom 9013 df-sup 9470 df-inf 9471 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-div 12013 df-nn 12375 df-2 12444 df-3 12445 df-4 12446 df-5 12447 df-6 12448 df-7 12449 df-8 12450 df-n0 12646 df-z 12733 df-uz 13005 df-rp 13160 df-ico 13521 df-fl 13971 df-mod 14049 |
| This theorem is used by: 2lgslem3 27790 |
| Copyright terms: Public domain | W3C validator |