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 26522. (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 26520 | . 2 ⊢ (𝜑 → ((!‘𝐻) mod 𝑃) = ((((-1↑𝑁) · (2↑𝐻)) · (!‘𝐻)) mod 𝑃)) |
7 | 1, 2 | gausslemma2dlem0b 26505 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝐻 ∈ ℕ) |
8 | 7 | nnnn0d 12293 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐻 ∈ ℕ0) |
9 | 8 | faccld 13998 | . . . . . . . . 9 ⊢ (𝜑 → (!‘𝐻) ∈ ℕ) |
10 | 9 | nncnd 11989 | . . . . . . . 8 ⊢ (𝜑 → (!‘𝐻) ∈ ℂ) |
11 | 10 | mulid2d 10993 | . . . . . . 7 ⊢ (𝜑 → (1 · (!‘𝐻)) = (!‘𝐻)) |
12 | 11 | eqcomd 2744 | . . . . . 6 ⊢ (𝜑 → (!‘𝐻) = (1 · (!‘𝐻))) |
13 | 12 | oveq1d 7290 | . . . . 5 ⊢ (𝜑 → ((!‘𝐻) mod 𝑃) = ((1 · (!‘𝐻)) mod 𝑃)) |
14 | 13 | eqeq1d 2740 | . . . 4 ⊢ (𝜑 → (((!‘𝐻) mod 𝑃) = ((((-1↑𝑁) · (2↑𝐻)) · (!‘𝐻)) mod 𝑃) ↔ ((1 · (!‘𝐻)) mod 𝑃) = ((((-1↑𝑁) · (2↑𝐻)) · (!‘𝐻)) mod 𝑃))) |
15 | 1zzd 12351 | . . . . 5 ⊢ (𝜑 → 1 ∈ ℤ) | |
16 | neg1z 12356 | . . . . . . 7 ⊢ -1 ∈ ℤ | |
17 | 1, 4, 2, 5 | gausslemma2dlem0h 26511 | . . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
18 | zexpcl 13797 | . . . . . . 7 ⊢ ((-1 ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (-1↑𝑁) ∈ ℤ) | |
19 | 16, 17, 18 | sylancr 587 | . . . . . 6 ⊢ (𝜑 → (-1↑𝑁) ∈ ℤ) |
20 | 2z 12352 | . . . . . . 7 ⊢ 2 ∈ ℤ | |
21 | zexpcl 13797 | . . . . . . 7 ⊢ ((2 ∈ ℤ ∧ 𝐻 ∈ ℕ0) → (2↑𝐻) ∈ ℤ) | |
22 | 20, 8, 21 | sylancr 587 | . . . . . 6 ⊢ (𝜑 → (2↑𝐻) ∈ ℤ) |
23 | 19, 22 | zmulcld 12432 | . . . . 5 ⊢ (𝜑 → ((-1↑𝑁) · (2↑𝐻)) ∈ ℤ) |
24 | 9 | nnzd 12425 | . . . . 5 ⊢ (𝜑 → (!‘𝐻) ∈ ℤ) |
25 | eldifi 4061 | . . . . . 6 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ ℙ) | |
26 | prmnn 16379 | . . . . . 6 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
27 | 1, 25, 26 | 3syl 18 | . . . . 5 ⊢ (𝜑 → 𝑃 ∈ ℕ) |
28 | 1, 2 | gausslemma2dlem0c 26506 | . . . . 5 ⊢ (𝜑 → ((!‘𝐻) gcd 𝑃) = 1) |
29 | cncongrcoprm 16375 | . . . . 5 ⊢ (((1 ∈ ℤ ∧ ((-1↑𝑁) · (2↑𝐻)) ∈ ℤ ∧ (!‘𝐻) ∈ ℤ) ∧ (𝑃 ∈ ℕ ∧ ((!‘𝐻) gcd 𝑃) = 1)) → (((1 · (!‘𝐻)) mod 𝑃) = ((((-1↑𝑁) · (2↑𝐻)) · (!‘𝐻)) mod 𝑃) ↔ (1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃))) | |
30 | 15, 23, 24, 27, 28, 29 | syl32anc 1377 | . . . 4 ⊢ (𝜑 → (((1 · (!‘𝐻)) mod 𝑃) = ((((-1↑𝑁) · (2↑𝐻)) · (!‘𝐻)) mod 𝑃) ↔ (1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃))) |
31 | 14, 30 | bitrd 278 | . . 3 ⊢ (𝜑 → (((!‘𝐻) mod 𝑃) = ((((-1↑𝑁) · (2↑𝐻)) · (!‘𝐻)) mod 𝑃) ↔ (1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃))) |
32 | simpr 485 | . . . . 5 ⊢ ((𝜑 ∧ (1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃)) → (1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃)) | |
33 | 26 | nnred 11988 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℝ) |
34 | prmgt1 16402 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → 1 < 𝑃) | |
35 | 33, 34 | jca 512 | . . . . . . . 8 ⊢ (𝑃 ∈ ℙ → (𝑃 ∈ ℝ ∧ 1 < 𝑃)) |
36 | 25, 35 | syl 17 | . . . . . . 7 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → (𝑃 ∈ ℝ ∧ 1 < 𝑃)) |
37 | 1mod 13623 | . . . . . . 7 ⊢ ((𝑃 ∈ ℝ ∧ 1 < 𝑃) → (1 mod 𝑃) = 1) | |
38 | 1, 36, 37 | 3syl 18 | . . . . . 6 ⊢ (𝜑 → (1 mod 𝑃) = 1) |
39 | 38 | adantr 481 | . . . . 5 ⊢ ((𝜑 ∧ (1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃)) → (1 mod 𝑃) = 1) |
40 | 32, 39 | eqtr3d 2780 | . . . 4 ⊢ ((𝜑 ∧ (1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃)) → (((-1↑𝑁) · (2↑𝐻)) mod 𝑃) = 1) |
41 | 40 | ex 413 | . . 3 ⊢ (𝜑 → ((1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃) → (((-1↑𝑁) · (2↑𝐻)) mod 𝑃) = 1)) |
42 | 31, 41 | sylbid 239 | . 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 205 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ∖ cdif 3884 ifcif 4459 {csn 4561 class class class wbr 5074 ↦ cmpt 5157 ‘cfv 6433 (class class class)co 7275 ℝcr 10870 1c1 10872 · cmul 10876 < clt 11009 − cmin 11205 -cneg 11206 / cdiv 11632 ℕcn 11973 2c2 12028 4c4 12030 ℕ0cn0 12233 ℤcz 12319 ...cfz 13239 ⌊cfl 13510 mod cmo 13589 ↑cexp 13782 !cfa 13987 gcd cgcd 16201 ℙcprime 16376 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-inf2 9399 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 ax-pre-sup 10949 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4840 df-int 4880 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-se 5545 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-isom 6442 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-2o 8298 df-er 8498 df-en 8734 df-dom 8735 df-sdom 8736 df-fin 8737 df-sup 9201 df-inf 9202 df-oi 9269 df-card 9697 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-div 11633 df-nn 11974 df-2 12036 df-3 12037 df-4 12038 df-5 12039 df-6 12040 df-n0 12234 df-z 12320 df-uz 12583 df-rp 12731 df-ioo 13083 df-fz 13240 df-fzo 13383 df-fl 13512 df-mod 13590 df-seq 13722 df-exp 13783 df-fac 13988 df-hash 14045 df-cj 14810 df-re 14811 df-im 14812 df-sqrt 14946 df-abs 14947 df-clim 15197 df-prod 15616 df-dvds 15964 df-gcd 16202 df-prm 16377 |
This theorem is referenced by: gausslemma2d 26522 |
Copyright terms: Public domain | W3C validator |