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 25944. (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 25942 | . 2 ⊢ (𝜑 → ((!‘𝐻) mod 𝑃) = ((((-1↑𝑁) · (2↑𝐻)) · (!‘𝐻)) mod 𝑃)) |
7 | 1, 2 | gausslemma2dlem0b 25927 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝐻 ∈ ℕ) |
8 | 7 | nnnn0d 11949 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐻 ∈ ℕ0) |
9 | 8 | faccld 13638 | . . . . . . . . 9 ⊢ (𝜑 → (!‘𝐻) ∈ ℕ) |
10 | 9 | nncnd 11648 | . . . . . . . 8 ⊢ (𝜑 → (!‘𝐻) ∈ ℂ) |
11 | 10 | mulid2d 10653 | . . . . . . 7 ⊢ (𝜑 → (1 · (!‘𝐻)) = (!‘𝐻)) |
12 | 11 | eqcomd 2827 | . . . . . 6 ⊢ (𝜑 → (!‘𝐻) = (1 · (!‘𝐻))) |
13 | 12 | oveq1d 7165 | . . . . 5 ⊢ (𝜑 → ((!‘𝐻) mod 𝑃) = ((1 · (!‘𝐻)) mod 𝑃)) |
14 | 13 | eqeq1d 2823 | . . . 4 ⊢ (𝜑 → (((!‘𝐻) mod 𝑃) = ((((-1↑𝑁) · (2↑𝐻)) · (!‘𝐻)) mod 𝑃) ↔ ((1 · (!‘𝐻)) mod 𝑃) = ((((-1↑𝑁) · (2↑𝐻)) · (!‘𝐻)) mod 𝑃))) |
15 | 1zzd 12007 | . . . . 5 ⊢ (𝜑 → 1 ∈ ℤ) | |
16 | neg1z 12012 | . . . . . . 7 ⊢ -1 ∈ ℤ | |
17 | 1, 4, 2, 5 | gausslemma2dlem0h 25933 | . . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
18 | zexpcl 13438 | . . . . . . 7 ⊢ ((-1 ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (-1↑𝑁) ∈ ℤ) | |
19 | 16, 17, 18 | sylancr 589 | . . . . . 6 ⊢ (𝜑 → (-1↑𝑁) ∈ ℤ) |
20 | 2z 12008 | . . . . . . 7 ⊢ 2 ∈ ℤ | |
21 | zexpcl 13438 | . . . . . . 7 ⊢ ((2 ∈ ℤ ∧ 𝐻 ∈ ℕ0) → (2↑𝐻) ∈ ℤ) | |
22 | 20, 8, 21 | sylancr 589 | . . . . . 6 ⊢ (𝜑 → (2↑𝐻) ∈ ℤ) |
23 | 19, 22 | zmulcld 12087 | . . . . 5 ⊢ (𝜑 → ((-1↑𝑁) · (2↑𝐻)) ∈ ℤ) |
24 | 9 | nnzd 12080 | . . . . 5 ⊢ (𝜑 → (!‘𝐻) ∈ ℤ) |
25 | eldifi 4103 | . . . . . 6 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ ℙ) | |
26 | prmnn 16012 | . . . . . 6 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
27 | 1, 25, 26 | 3syl 18 | . . . . 5 ⊢ (𝜑 → 𝑃 ∈ ℕ) |
28 | 1, 2 | gausslemma2dlem0c 25928 | . . . . 5 ⊢ (𝜑 → ((!‘𝐻) gcd 𝑃) = 1) |
29 | cncongrcoprm 16008 | . . . . 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 11647 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℝ) |
34 | prmgt1 16035 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → 1 < 𝑃) | |
35 | 33, 34 | jca 514 | . . . . . . . 8 ⊢ (𝑃 ∈ ℙ → (𝑃 ∈ ℝ ∧ 1 < 𝑃)) |
36 | 25, 35 | syl 17 | . . . . . . 7 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → (𝑃 ∈ ℝ ∧ 1 < 𝑃)) |
37 | 1mod 13265 | . . . . . . 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 3933 ifcif 4467 {csn 4561 class class class wbr 5059 ↦ cmpt 5139 ‘cfv 6350 (class class class)co 7150 ℝcr 10530 1c1 10532 · cmul 10536 < clt 10669 − cmin 10864 -cneg 10865 / cdiv 11291 ℕcn 11632 2c2 11686 4c4 11688 ℕ0cn0 11891 ℤcz 11975 ...cfz 12886 ⌊cfl 13154 mod cmo 13231 ↑cexp 13423 !cfa 13627 gcd cgcd 15837 ℙcprime 16009 |
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 2156 ax-12 2172 ax-ext 2793 ax-rep 5183 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 ax-inf2 9098 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 ax-pre-sup 10609 |
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 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4833 df-int 4870 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-tr 5166 df-id 5455 df-eprel 5460 df-po 5469 df-so 5470 df-fr 5509 df-se 5510 df-we 5511 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-pred 6143 df-ord 6189 df-on 6190 df-lim 6191 df-suc 6192 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-isom 6359 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-1o 8096 df-2o 8097 df-oadd 8100 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-fin 8507 df-sup 8900 df-inf 8901 df-oi 8968 df-card 9362 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-div 11292 df-nn 11633 df-2 11694 df-3 11695 df-4 11696 df-5 11697 df-6 11698 df-n0 11892 df-z 11976 df-uz 12238 df-rp 12384 df-ioo 12736 df-fz 12887 df-fzo 13028 df-fl 13156 df-mod 13232 df-seq 13364 df-exp 13424 df-fac 13628 df-hash 13685 df-cj 14452 df-re 14453 df-im 14454 df-sqrt 14588 df-abs 14589 df-clim 14839 df-prod 15254 df-dvds 15602 df-gcd 15838 df-prm 16010 |
This theorem is referenced by: gausslemma2d 25944 |
Copyright terms: Public domain | W3C validator |