Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > gausslemma2dlem7 | Structured version Visualization version GIF version |
Description: Lemma 7 for gausslemma2d 25949. (Contributed by AV, 13-Jul-2021.) |
Ref | Expression |
---|---|
gausslemma2d.p | ⊢ (𝜑 → 𝑃 ∈ (ℙ ∖ {2})) |
gausslemma2d.h | ⊢ 𝐻 = ((𝑃 − 1) / 2) |
gausslemma2d.r | ⊢ 𝑅 = (𝑥 ∈ (1...𝐻) ↦ if((𝑥 · 2) < (𝑃 / 2), (𝑥 · 2), (𝑃 − (𝑥 · 2)))) |
gausslemma2d.m | ⊢ 𝑀 = (⌊‘(𝑃 / 4)) |
gausslemma2d.n | ⊢ 𝑁 = (𝐻 − 𝑀) |
Ref | Expression |
---|---|
gausslemma2dlem7 | ⊢ (𝜑 → (((-1↑𝑁) · (2↑𝐻)) mod 𝑃) = 1) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | gausslemma2d.p | . . 3 ⊢ (𝜑 → 𝑃 ∈ (ℙ ∖ {2})) | |
2 | gausslemma2d.h | . . 3 ⊢ 𝐻 = ((𝑃 − 1) / 2) | |
3 | gausslemma2d.r | . . 3 ⊢ 𝑅 = (𝑥 ∈ (1...𝐻) ↦ if((𝑥 · 2) < (𝑃 / 2), (𝑥 · 2), (𝑃 − (𝑥 · 2)))) | |
4 | gausslemma2d.m | . . 3 ⊢ 𝑀 = (⌊‘(𝑃 / 4)) | |
5 | gausslemma2d.n | . . 3 ⊢ 𝑁 = (𝐻 − 𝑀) | |
6 | 1, 2, 3, 4, 5 | gausslemma2dlem6 25947 | . 2 ⊢ (𝜑 → ((!‘𝐻) mod 𝑃) = ((((-1↑𝑁) · (2↑𝐻)) · (!‘𝐻)) mod 𝑃)) |
7 | 1, 2 | gausslemma2dlem0b 25932 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝐻 ∈ ℕ) |
8 | 7 | nnnn0d 11954 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐻 ∈ ℕ0) |
9 | 8 | faccld 13643 | . . . . . . . . 9 ⊢ (𝜑 → (!‘𝐻) ∈ ℕ) |
10 | 9 | nncnd 11653 | . . . . . . . 8 ⊢ (𝜑 → (!‘𝐻) ∈ ℂ) |
11 | 10 | mulid2d 10658 | . . . . . . 7 ⊢ (𝜑 → (1 · (!‘𝐻)) = (!‘𝐻)) |
12 | 11 | eqcomd 2827 | . . . . . 6 ⊢ (𝜑 → (!‘𝐻) = (1 · (!‘𝐻))) |
13 | 12 | oveq1d 7170 | . . . . 5 ⊢ (𝜑 → ((!‘𝐻) mod 𝑃) = ((1 · (!‘𝐻)) mod 𝑃)) |
14 | 13 | eqeq1d 2823 | . . . 4 ⊢ (𝜑 → (((!‘𝐻) mod 𝑃) = ((((-1↑𝑁) · (2↑𝐻)) · (!‘𝐻)) mod 𝑃) ↔ ((1 · (!‘𝐻)) mod 𝑃) = ((((-1↑𝑁) · (2↑𝐻)) · (!‘𝐻)) mod 𝑃))) |
15 | 1zzd 12012 | . . . . 5 ⊢ (𝜑 → 1 ∈ ℤ) | |
16 | neg1z 12017 | . . . . . . 7 ⊢ -1 ∈ ℤ | |
17 | 1, 4, 2, 5 | gausslemma2dlem0h 25938 | . . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
18 | zexpcl 13443 | . . . . . . 7 ⊢ ((-1 ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (-1↑𝑁) ∈ ℤ) | |
19 | 16, 17, 18 | sylancr 589 | . . . . . 6 ⊢ (𝜑 → (-1↑𝑁) ∈ ℤ) |
20 | 2z 12013 | . . . . . . 7 ⊢ 2 ∈ ℤ | |
21 | zexpcl 13443 | . . . . . . 7 ⊢ ((2 ∈ ℤ ∧ 𝐻 ∈ ℕ0) → (2↑𝐻) ∈ ℤ) | |
22 | 20, 8, 21 | sylancr 589 | . . . . . 6 ⊢ (𝜑 → (2↑𝐻) ∈ ℤ) |
23 | 19, 22 | zmulcld 12092 | . . . . 5 ⊢ (𝜑 → ((-1↑𝑁) · (2↑𝐻)) ∈ ℤ) |
24 | 9 | nnzd 12085 | . . . . 5 ⊢ (𝜑 → (!‘𝐻) ∈ ℤ) |
25 | eldifi 4102 | . . . . . 6 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ ℙ) | |
26 | prmnn 16017 | . . . . . 6 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
27 | 1, 25, 26 | 3syl 18 | . . . . 5 ⊢ (𝜑 → 𝑃 ∈ ℕ) |
28 | 1, 2 | gausslemma2dlem0c 25933 | . . . . 5 ⊢ (𝜑 → ((!‘𝐻) gcd 𝑃) = 1) |
29 | cncongrcoprm 16013 | . . . . 5 ⊢ (((1 ∈ ℤ ∧ ((-1↑𝑁) · (2↑𝐻)) ∈ ℤ ∧ (!‘𝐻) ∈ ℤ) ∧ (𝑃 ∈ ℕ ∧ ((!‘𝐻) gcd 𝑃) = 1)) → (((1 · (!‘𝐻)) mod 𝑃) = ((((-1↑𝑁) · (2↑𝐻)) · (!‘𝐻)) mod 𝑃) ↔ (1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃))) | |
30 | 15, 23, 24, 27, 28, 29 | syl32anc 1374 | . . . 4 ⊢ (𝜑 → (((1 · (!‘𝐻)) mod 𝑃) = ((((-1↑𝑁) · (2↑𝐻)) · (!‘𝐻)) mod 𝑃) ↔ (1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃))) |
31 | 14, 30 | bitrd 281 | . . 3 ⊢ (𝜑 → (((!‘𝐻) mod 𝑃) = ((((-1↑𝑁) · (2↑𝐻)) · (!‘𝐻)) mod 𝑃) ↔ (1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃))) |
32 | simpr 487 | . . . . 5 ⊢ ((𝜑 ∧ (1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃)) → (1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃)) | |
33 | 26 | nnred 11652 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℝ) |
34 | prmgt1 16040 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → 1 < 𝑃) | |
35 | 33, 34 | jca 514 | . . . . . . . 8 ⊢ (𝑃 ∈ ℙ → (𝑃 ∈ ℝ ∧ 1 < 𝑃)) |
36 | 25, 35 | syl 17 | . . . . . . 7 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → (𝑃 ∈ ℝ ∧ 1 < 𝑃)) |
37 | 1mod 13270 | . . . . . . 7 ⊢ ((𝑃 ∈ ℝ ∧ 1 < 𝑃) → (1 mod 𝑃) = 1) | |
38 | 1, 36, 37 | 3syl 18 | . . . . . 6 ⊢ (𝜑 → (1 mod 𝑃) = 1) |
39 | 38 | adantr 483 | . . . . 5 ⊢ ((𝜑 ∧ (1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃)) → (1 mod 𝑃) = 1) |
40 | 32, 39 | eqtr3d 2858 | . . . 4 ⊢ ((𝜑 ∧ (1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃)) → (((-1↑𝑁) · (2↑𝐻)) mod 𝑃) = 1) |
41 | 40 | ex 415 | . . 3 ⊢ (𝜑 → ((1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃) → (((-1↑𝑁) · (2↑𝐻)) mod 𝑃) = 1)) |
42 | 31, 41 | sylbid 242 | . 2 ⊢ (𝜑 → (((!‘𝐻) mod 𝑃) = ((((-1↑𝑁) · (2↑𝐻)) · (!‘𝐻)) mod 𝑃) → (((-1↑𝑁) · (2↑𝐻)) mod 𝑃) = 1)) |
43 | 6, 42 | mpd 15 | 1 ⊢ (𝜑 → (((-1↑𝑁) · (2↑𝐻)) mod 𝑃) = 1) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 ∈ wcel 2110 ∖ cdif 3932 ifcif 4466 {csn 4566 class class class wbr 5065 ↦ cmpt 5145 ‘cfv 6354 (class class class)co 7155 ℝcr 10535 1c1 10537 · cmul 10541 < clt 10674 − cmin 10869 -cneg 10870 / cdiv 11296 ℕcn 11637 2c2 11691 4c4 11693 ℕ0cn0 11896 ℤcz 11980 ...cfz 12891 ⌊cfl 13159 mod cmo 13236 ↑cexp 13428 !cfa 13632 gcd cgcd 15842 ℙcprime 16014 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5189 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-inf2 9103 ax-cnex 10592 ax-resscn 10593 ax-1cn 10594 ax-icn 10595 ax-addcl 10596 ax-addrcl 10597 ax-mulcl 10598 ax-mulrcl 10599 ax-mulcom 10600 ax-addass 10601 ax-mulass 10602 ax-distr 10603 ax-i2m1 10604 ax-1ne0 10605 ax-1rid 10606 ax-rnegex 10607 ax-rrecex 10608 ax-cnre 10609 ax-pre-lttri 10610 ax-pre-lttrn 10611 ax-pre-ltadd 10612 ax-pre-mulgt0 10613 ax-pre-sup 10614 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-fal 1546 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4838 df-int 4876 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-tr 5172 df-id 5459 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-se 5514 df-we 5515 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-pred 6147 df-ord 6193 df-on 6194 df-lim 6195 df-suc 6196 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-isom 6363 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-om 7580 df-1st 7688 df-2nd 7689 df-wrecs 7946 df-recs 8007 df-rdg 8045 df-1o 8101 df-2o 8102 df-oadd 8105 df-er 8288 df-en 8509 df-dom 8510 df-sdom 8511 df-fin 8512 df-sup 8905 df-inf 8906 df-oi 8973 df-card 9367 df-pnf 10676 df-mnf 10677 df-xr 10678 df-ltxr 10679 df-le 10680 df-sub 10871 df-neg 10872 df-div 11297 df-nn 11638 df-2 11699 df-3 11700 df-4 11701 df-5 11702 df-6 11703 df-n0 11897 df-z 11981 df-uz 12243 df-rp 12389 df-ioo 12741 df-fz 12892 df-fzo 13033 df-fl 13161 df-mod 13237 df-seq 13369 df-exp 13429 df-fac 13633 df-hash 13690 df-cj 14457 df-re 14458 df-im 14459 df-sqrt 14593 df-abs 14594 df-clim 14844 df-prod 15259 df-dvds 15607 df-gcd 15843 df-prm 16015 |
This theorem is referenced by: gausslemma2d 25949 |
Copyright terms: Public domain | W3C validator |