gausslemma2dlem7 - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > gausslemma2dlem7		GIF version

Theorem gausslemma2dlem7 16199

Description: Lemma 7 for gausslemma2d 16200. (Contributed by AV, 13-Jul-2021.)

**Hypotheses**
Ref	Expression
gausslemma2d.p	⊢ (𝜑 → 𝑃 ∈ (ℙ ∖ {2}))
gausslemma2d.h	⊢ 𝐻 = ((𝑃 − 1) / 2)
gausslemma2d.r	⊢ 𝑅 = (𝑥 ∈ (1...𝐻) ↦ if((𝑥 · 2) < (𝑃 / 2), (𝑥 · 2), (𝑃 − (𝑥 · 2))))
gausslemma2d.m	⊢ 𝑀 = (⌊‘(𝑃 / 4))
gausslemma2d.n	⊢ 𝑁 = (𝐻 − 𝑀)

**Assertion**
Ref	Expression
gausslemma2dlem7	⊢ (𝜑 → (((-1↑𝑁) · (2↑𝐻)) mod 𝑃) = 1)

Distinct variable groups: 𝑥,𝐻 𝑥,𝑃 𝜑,𝑥 𝑥,𝑀 Allowed substitution hints: 𝑅(𝑥) 𝑁(𝑥)

**Proof of Theorem gausslemma2dlem7**
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 16198	. 2 ⊢ (𝜑 → ((!‘𝐻) mod 𝑃) = ((((-1↑𝑁) · (2↑𝐻)) · (!‘𝐻)) mod 𝑃))
7	1, 2	gausslemma2dlem0b 16181	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐻 ∈ ℕ)
8	7	nnnn0d 9622	. . . . . . . . . 10 ⊢ (𝜑 → 𝐻 ∈ ℕ₀)
9	8	faccld 11176	. . . . . . . . 9 ⊢ (𝜑 → (!‘𝐻) ∈ ℕ)
10	9	nncnd 9319	. . . . . . . 8 ⊢ (𝜑 → (!‘𝐻) ∈ ℂ)
11	10	mullidd 8344	. . . . . . 7 ⊢ (𝜑 → (1 · (!‘𝐻)) = (!‘𝐻))
12	11	eqcomd 2244	. . . . . 6 ⊢ (𝜑 → (!‘𝐻) = (1 · (!‘𝐻)))
13	12	oveq1d 6100	. . . . 5 ⊢ (𝜑 → ((!‘𝐻) mod 𝑃) = ((1 · (!‘𝐻)) mod 𝑃))
14	13	eqeq1d 2247	. . . 4 ⊢ (𝜑 → (((!‘𝐻) mod 𝑃) = ((((-1↑𝑁) · (2↑𝐻)) · (!‘𝐻)) mod 𝑃) ↔ ((1 · (!‘𝐻)) mod 𝑃) = ((((-1↑𝑁) · (2↑𝐻)) · (!‘𝐻)) mod 𝑃)))
15		1zzd 9673	. . . . 5 ⊢ (𝜑 → 1 ∈ ℤ)
16		neg1z 9678	. . . . . . 7 ⊢ -1 ∈ ℤ
17	1, 4, 2, 5	gausslemma2dlem0h 16187	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
18		zexpcl 10993	. . . . . . 7 ⊢ ((-1 ∈ ℤ ∧ 𝑁 ∈ ℕ₀) → (-1↑𝑁) ∈ ℤ)
19	16, 17, 18	sylancr 418	. . . . . 6 ⊢ (𝜑 → (-1↑𝑁) ∈ ℤ)
20		2z 9674	. . . . . . 7 ⊢ 2 ∈ ℤ
21		zexpcl 10993	. . . . . . 7 ⊢ ((2 ∈ ℤ ∧ 𝐻 ∈ ℕ₀) → (2↑𝐻) ∈ ℤ)
22	20, 8, 21	sylancr 418	. . . . . 6 ⊢ (𝜑 → (2↑𝐻) ∈ ℤ)
23	19, 22	zmulcld 9776	. . . . 5 ⊢ (𝜑 → ((-1↑𝑁) · (2↑𝐻)) ∈ ℤ)
24	9	nnzd 9769	. . . . 5 ⊢ (𝜑 → (!‘𝐻) ∈ ℤ)
25	1	gausslemma2dlem0a 16180	. . . . 5 ⊢ (𝜑 → 𝑃 ∈ ℕ)
26	1, 2	gausslemma2dlem0c 16182	. . . . 5 ⊢ (𝜑 → ((!‘𝐻) gcd 𝑃) = 1)
27		cncongrcoprm 12886	. . . . 5 ⊢ (((1 ∈ ℤ ∧ ((-1↑𝑁) · (2↑𝐻)) ∈ ℤ ∧ (!‘𝐻) ∈ ℤ) ∧ (𝑃 ∈ ℕ ∧ ((!‘𝐻) gcd 𝑃) = 1)) → (((1 · (!‘𝐻)) mod 𝑃) = ((((-1↑𝑁) · (2↑𝐻)) · (!‘𝐻)) mod 𝑃) ↔ (1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃)))
28	15, 23, 24, 25, 26, 27	syl32anc 1286	. . . 4 ⊢ (𝜑 → (((1 · (!‘𝐻)) mod 𝑃) = ((((-1↑𝑁) · (2↑𝐻)) · (!‘𝐻)) mod 𝑃) ↔ (1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃)))
29	14, 28	bitrd 188	. . 3 ⊢ (𝜑 → (((!‘𝐻) mod 𝑃) = ((((-1↑𝑁) · (2↑𝐻)) · (!‘𝐻)) mod 𝑃) ↔ (1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃)))
30		simpr 110	. . . . 5 ⊢ ((𝜑 ∧ (1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃)) → (1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃))
31		nnq 10035	. . . . . . . 8 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℚ)
32	25, 31	syl 14	. . . . . . 7 ⊢ (𝜑 → 𝑃 ∈ ℚ)
33	1	eldifad 3231	. . . . . . . 8 ⊢ (𝜑 → 𝑃 ∈ ℙ)
34		prmgt1 12912	. . . . . . . 8 ⊢ (𝑃 ∈ ℙ → 1 < 𝑃)
35	33, 34	syl 14	. . . . . . 7 ⊢ (𝜑 → 1 < 𝑃)
36		q1mod 10795	. . . . . . 7 ⊢ ((𝑃 ∈ ℚ ∧ 1 < 𝑃) → (1 mod 𝑃) = 1)
37	32, 35, 36	syl2anc 415	. . . . . 6 ⊢ (𝜑 → (1 mod 𝑃) = 1)
38	37	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ (1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃)) → (1 mod 𝑃) = 1)
39	30, 38	eqtr3d 2273	. . . 4 ⊢ ((𝜑 ∧ (1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃)) → (((-1↑𝑁) · (2↑𝐻)) mod 𝑃) = 1)
40	39	ex 115	. . 3 ⊢ (𝜑 → ((1 mod 𝑃) = (((-1↑𝑁) · (2↑𝐻)) mod 𝑃) → (((-1↑𝑁) · (2↑𝐻)) mod 𝑃) = 1))
41	29, 40	sylbid 150	. 2 ⊢ (𝜑 → (((!‘𝐻) mod 𝑃) = ((((-1↑𝑁) · (2↑𝐻)) · (!‘𝐻)) mod 𝑃) → (((-1↑𝑁) · (2↑𝐻)) mod 𝑃) = 1))
42	6, 41	mpd 13	1 ⊢ (𝜑 → (((-1↑𝑁) · (2↑𝐻)) mod 𝑃) = 1)

Colors of variables: wff set class

This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 ∖ cdif 3217 ifcif 3638 {csn 3709 class class class wbr 4130 ↦ cmpt 4192 ‘cfv 5377 (class class class)co 6085 1c1 8180 · cmul 8184 < clt 8360 − cmin 8497 -cneg 8498 / cdiv 9003 ℕcn 9305 2c2 9356 4c4 9358 ℕ₀cn0 9565 ℤcz 9646 ℚcq 10021 ...cfz 10413 ⌊cfl 10705 mod cmo 10761 ↑cexp 10977 !cfa 11165 gcd cgcd 12732 ℙcprime 12887

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-mulrcl 8278 ax-addcom 8279 ax-mulcom 8280 ax-addass 8281 ax-mulass 8282 ax-distr 8283 ax-i2m1 8284 ax-0lt1 8285 ax-1rid 8286 ax-0id 8287 ax-rnegex 8288 ax-precex 8289 ax-cnre 8290 ax-pre-ltirr 8291 ax-pre-ltwlin 8292 ax-pre-lttrn 8293 ax-pre-apti 8294 ax-pre-ltadd 8295 ax-pre-mulgt0 8296 ax-pre-mulext 8297 ax-arch 8298 ax-caucvg 8299

This proof depends on definitions: df-bi 117 df-stab 843 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-xor 1425 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-tp 3717 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-po 4441 df-iso 4442 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-isom 5386 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-recs 6576 df-irdg 6641 df-frec 6662 df-1o 6687 df-2o 6688 df-oadd 6691 df-er 6807 df-en 7023 df-dom 7024 df-fin 7025 df-sup 7324 df-pnf 8362 df-mnf 8363 df-xr 8364 df-ltxr 8365 df-le 8366 df-sub 8499 df-neg 8500 df-reap 8904 df-ap 8911 df-div 9004 df-inn 9306 df-2 9364 df-3 9365 df-4 9366 df-5 9367 df-6 9368 df-n0 9566 df-z 9647 df-uz 9924 df-q 10022 df-rp 10057 df-ioo 10296 df-fz 10414 df-fzo 10552 df-fl 10707 df-mod 10762 df-seqfrec 10887 df-exp 10978 df-fac 11166 df-ihash 11217 df-cj 11609 df-re 11610 df-im 11611 df-rsqrt 11766 df-abs 11767 df-clim 12047 df-proddc 12320 df-dvds 12557 df-gcd 12733 df-prm 12888

This theorem is used by: gausslemma2d 16200

W3C validator