2lgslem1a1 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > 2lgslem1a1		Structured version Visualization version GIF version

Theorem 2lgslem1a1 27354

Description: Lemma 1 for 2lgslem1a 27356. (Contributed by AV, 16-Jun-2021.)

**Assertion**
Ref	Expression
2lgslem1a1	⊢ ((𝑃 ∈ ℕ ∧ ¬ 2 ∥ 𝑃) → ∀𝑖 ∈ (1...((𝑃 − 1) / 2))(𝑖 · 2) = ((𝑖 · 2) mod 𝑃))

Distinct variable group: 𝑃,𝑖

**Proof of Theorem 2lgslem1a1**
Step	Hyp	Ref	Expression
1		nnrp 12915	. . . . . 6 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℝ⁺)
2	1	adantr 480	. . . . 5 ⊢ ((𝑃 ∈ ℕ ∧ ¬ 2 ∥ 𝑃) → 𝑃 ∈ ℝ⁺)
3		elfzelz 13438	. . . . . 6 ⊢ (𝑖 ∈ (1...((𝑃 − 1) / 2)) → 𝑖 ∈ ℤ)
4		zre 12490	. . . . . . 7 ⊢ (𝑖 ∈ ℤ → 𝑖 ∈ ℝ)
5		2re 12217	. . . . . . . 8 ⊢ 2 ∈ ℝ
6	5	a1i 11	. . . . . . 7 ⊢ (𝑖 ∈ ℤ → 2 ∈ ℝ)
7	4, 6	remulcld 11160	. . . . . 6 ⊢ (𝑖 ∈ ℤ → (𝑖 · 2) ∈ ℝ)
8	3, 7	syl 17	. . . . 5 ⊢ (𝑖 ∈ (1...((𝑃 − 1) / 2)) → (𝑖 · 2) ∈ ℝ)
9	2, 8	anim12ci 614	. . . 4 ⊢ (((𝑃 ∈ ℕ ∧ ¬ 2 ∥ 𝑃) ∧ 𝑖 ∈ (1...((𝑃 − 1) / 2))) → ((𝑖 · 2) ∈ ℝ ∧ 𝑃 ∈ ℝ⁺))
10		elfznn 13467	. . . . . 6 ⊢ (𝑖 ∈ (1...((𝑃 − 1) / 2)) → 𝑖 ∈ ℕ)
11		nnre 12150	. . . . . . 7 ⊢ (𝑖 ∈ ℕ → 𝑖 ∈ ℝ)
12		nnnn0 12406	. . . . . . . 8 ⊢ (𝑖 ∈ ℕ → 𝑖 ∈ ℕ₀)
13	12	nn0ge0d 12463	. . . . . . 7 ⊢ (𝑖 ∈ ℕ → 0 ≤ 𝑖)
14		0le2 12245	. . . . . . . . 9 ⊢ 0 ≤ 2
15	5, 14	pm3.2i 470	. . . . . . . 8 ⊢ (2 ∈ ℝ ∧ 0 ≤ 2)
16	15	a1i 11	. . . . . . 7 ⊢ (𝑖 ∈ ℕ → (2 ∈ ℝ ∧ 0 ≤ 2))
17		mulge0 11653	. . . . . . 7 ⊢ (((𝑖 ∈ ℝ ∧ 0 ≤ 𝑖) ∧ (2 ∈ ℝ ∧ 0 ≤ 2)) → 0 ≤ (𝑖 · 2))
18	11, 13, 16, 17	syl21anc 837	. . . . . 6 ⊢ (𝑖 ∈ ℕ → 0 ≤ (𝑖 · 2))
19	10, 18	syl 17	. . . . 5 ⊢ (𝑖 ∈ (1...((𝑃 − 1) / 2)) → 0 ≤ (𝑖 · 2))
20	19	adantl 481	. . . 4 ⊢ (((𝑃 ∈ ℕ ∧ ¬ 2 ∥ 𝑃) ∧ 𝑖 ∈ (1...((𝑃 − 1) / 2))) → 0 ≤ (𝑖 · 2))
21		elfz2 13428	. . . . . 6 ⊢ (𝑖 ∈ (1...((𝑃 − 1) / 2)) ↔ ((1 ∈ ℤ ∧ ((𝑃 − 1) / 2) ∈ ℤ ∧ 𝑖 ∈ ℤ) ∧ (1 ≤ 𝑖 ∧ 𝑖 ≤ ((𝑃 − 1) / 2))))
22	4	3ad2ant3 1135	. . . . . . . . . 10 ⊢ ((1 ∈ ℤ ∧ ((𝑃 − 1) / 2) ∈ ℤ ∧ 𝑖 ∈ ℤ) → 𝑖 ∈ ℝ)
23		zre 12490	. . . . . . . . . . 11 ⊢ (((𝑃 − 1) / 2) ∈ ℤ → ((𝑃 − 1) / 2) ∈ ℝ)
24	23	3ad2ant2 1134	. . . . . . . . . 10 ⊢ ((1 ∈ ℤ ∧ ((𝑃 − 1) / 2) ∈ ℤ ∧ 𝑖 ∈ ℤ) → ((𝑃 − 1) / 2) ∈ ℝ)
25		2pos 12246	. . . . . . . . . . . 12 ⊢ 0 < 2
26	5, 25	pm3.2i 470	. . . . . . . . . . 11 ⊢ (2 ∈ ℝ ∧ 0 < 2)
27	26	a1i 11	. . . . . . . . . 10 ⊢ ((1 ∈ ℤ ∧ ((𝑃 − 1) / 2) ∈ ℤ ∧ 𝑖 ∈ ℤ) → (2 ∈ ℝ ∧ 0 < 2))
28		lemul1 11991	. . . . . . . . . 10 ⊢ ((𝑖 ∈ ℝ ∧ ((𝑃 − 1) / 2) ∈ ℝ ∧ (2 ∈ ℝ ∧ 0 < 2)) → (𝑖 ≤ ((𝑃 − 1) / 2) ↔ (𝑖 · 2) ≤ (((𝑃 − 1) / 2) · 2)))
29	22, 24, 27, 28	syl3anc 1373	. . . . . . . . 9 ⊢ ((1 ∈ ℤ ∧ ((𝑃 − 1) / 2) ∈ ℤ ∧ 𝑖 ∈ ℤ) → (𝑖 ≤ ((𝑃 − 1) / 2) ↔ (𝑖 · 2) ≤ (((𝑃 − 1) / 2) · 2)))
30		nncn 12151	. . . . . . . . . . . . . . . . 17 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℂ)
31		peano2cnm 11445	. . . . . . . . . . . . . . . . 17 ⊢ (𝑃 ∈ ℂ → (𝑃 − 1) ∈ ℂ)
32	30, 31	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) ∈ ℂ)
33		2cnd 12221	. . . . . . . . . . . . . . . 16 ⊢ (𝑃 ∈ ℕ → 2 ∈ ℂ)
34		2ne0 12247	. . . . . . . . . . . . . . . . 17 ⊢ 2 ≠ 0
35	34	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ (𝑃 ∈ ℕ → 2 ≠ 0)
36	32, 33, 35	divcan1d 11916	. . . . . . . . . . . . . . 15 ⊢ (𝑃 ∈ ℕ → (((𝑃 − 1) / 2) · 2) = (𝑃 − 1))
37	36	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝑃 ∈ ℕ ∧ ¬ 2 ∥ 𝑃) → (((𝑃 − 1) / 2) · 2) = (𝑃 − 1))
38	37	adantl 481	. . . . . . . . . . . . 13 ⊢ (((1 ∈ ℤ ∧ ((𝑃 − 1) / 2) ∈ ℤ ∧ 𝑖 ∈ ℤ) ∧ (𝑃 ∈ ℕ ∧ ¬ 2 ∥ 𝑃)) → (((𝑃 − 1) / 2) · 2) = (𝑃 − 1))
39	38	breq2d 5108	. . . . . . . . . . . 12 ⊢ (((1 ∈ ℤ ∧ ((𝑃 − 1) / 2) ∈ ℤ ∧ 𝑖 ∈ ℤ) ∧ (𝑃 ∈ ℕ ∧ ¬ 2 ∥ 𝑃)) → ((𝑖 · 2) ≤ (((𝑃 − 1) / 2) · 2) ↔ (𝑖 · 2) ≤ (𝑃 − 1)))
40		id 22	. . . . . . . . . . . . . . . 16 ⊢ (𝑖 ∈ ℤ → 𝑖 ∈ ℤ)
41		2z 12521	. . . . . . . . . . . . . . . . 17 ⊢ 2 ∈ ℤ
42	41	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ (𝑖 ∈ ℤ → 2 ∈ ℤ)
43	40, 42	zmulcld 12600	. . . . . . . . . . . . . . 15 ⊢ (𝑖 ∈ ℤ → (𝑖 · 2) ∈ ℤ)
44	43	3ad2ant3 1135	. . . . . . . . . . . . . 14 ⊢ ((1 ∈ ℤ ∧ ((𝑃 − 1) / 2) ∈ ℤ ∧ 𝑖 ∈ ℤ) → (𝑖 · 2) ∈ ℤ)
45		nnz 12507	. . . . . . . . . . . . . . 15 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℤ)
46	45	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝑃 ∈ ℕ ∧ ¬ 2 ∥ 𝑃) → 𝑃 ∈ ℤ)
47		zltlem1 12542	. . . . . . . . . . . . . 14 ⊢ (((𝑖 · 2) ∈ ℤ ∧ 𝑃 ∈ ℤ) → ((𝑖 · 2) < 𝑃 ↔ (𝑖 · 2) ≤ (𝑃 − 1)))
48	44, 46, 47	syl2an 596	. . . . . . . . . . . . 13 ⊢ (((1 ∈ ℤ ∧ ((𝑃 − 1) / 2) ∈ ℤ ∧ 𝑖 ∈ ℤ) ∧ (𝑃 ∈ ℕ ∧ ¬ 2 ∥ 𝑃)) → ((𝑖 · 2) < 𝑃 ↔ (𝑖 · 2) ≤ (𝑃 − 1)))
49	48	biimprd 248	. . . . . . . . . . . 12 ⊢ (((1 ∈ ℤ ∧ ((𝑃 − 1) / 2) ∈ ℤ ∧ 𝑖 ∈ ℤ) ∧ (𝑃 ∈ ℕ ∧ ¬ 2 ∥ 𝑃)) → ((𝑖 · 2) ≤ (𝑃 − 1) → (𝑖 · 2) < 𝑃))
50	39, 49	sylbid 240	. . . . . . . . . . 11 ⊢ (((1 ∈ ℤ ∧ ((𝑃 − 1) / 2) ∈ ℤ ∧ 𝑖 ∈ ℤ) ∧ (𝑃 ∈ ℕ ∧ ¬ 2 ∥ 𝑃)) → ((𝑖 · 2) ≤ (((𝑃 − 1) / 2) · 2) → (𝑖 · 2) < 𝑃))
51	50	ex 412	. . . . . . . . . 10 ⊢ ((1 ∈ ℤ ∧ ((𝑃 − 1) / 2) ∈ ℤ ∧ 𝑖 ∈ ℤ) → ((𝑃 ∈ ℕ ∧ ¬ 2 ∥ 𝑃) → ((𝑖 · 2) ≤ (((𝑃 − 1) / 2) · 2) → (𝑖 · 2) < 𝑃)))
52	51	com23 86	. . . . . . . . 9 ⊢ ((1 ∈ ℤ ∧ ((𝑃 − 1) / 2) ∈ ℤ ∧ 𝑖 ∈ ℤ) → ((𝑖 · 2) ≤ (((𝑃 − 1) / 2) · 2) → ((𝑃 ∈ ℕ ∧ ¬ 2 ∥ 𝑃) → (𝑖 · 2) < 𝑃)))
53	29, 52	sylbid 240	. . . . . . . 8 ⊢ ((1 ∈ ℤ ∧ ((𝑃 − 1) / 2) ∈ ℤ ∧ 𝑖 ∈ ℤ) → (𝑖 ≤ ((𝑃 − 1) / 2) → ((𝑃 ∈ ℕ ∧ ¬ 2 ∥ 𝑃) → (𝑖 · 2) < 𝑃)))
54	53	a1d 25	. . . . . . 7 ⊢ ((1 ∈ ℤ ∧ ((𝑃 − 1) / 2) ∈ ℤ ∧ 𝑖 ∈ ℤ) → (1 ≤ 𝑖 → (𝑖 ≤ ((𝑃 − 1) / 2) → ((𝑃 ∈ ℕ ∧ ¬ 2 ∥ 𝑃) → (𝑖 · 2) < 𝑃))))
55	54	imp32 418	. . . . . 6 ⊢ (((1 ∈ ℤ ∧ ((𝑃 − 1) / 2) ∈ ℤ ∧ 𝑖 ∈ ℤ) ∧ (1 ≤ 𝑖 ∧ 𝑖 ≤ ((𝑃 − 1) / 2))) → ((𝑃 ∈ ℕ ∧ ¬ 2 ∥ 𝑃) → (𝑖 · 2) < 𝑃))
56	21, 55	sylbi 217	. . . . 5 ⊢ (𝑖 ∈ (1...((𝑃 − 1) / 2)) → ((𝑃 ∈ ℕ ∧ ¬ 2 ∥ 𝑃) → (𝑖 · 2) < 𝑃))
57	56	impcom 407	. . . 4 ⊢ (((𝑃 ∈ ℕ ∧ ¬ 2 ∥ 𝑃) ∧ 𝑖 ∈ (1...((𝑃 − 1) / 2))) → (𝑖 · 2) < 𝑃)
58		modid 13814	. . . 4 ⊢ ((((𝑖 · 2) ∈ ℝ ∧ 𝑃 ∈ ℝ⁺) ∧ (0 ≤ (𝑖 · 2) ∧ (𝑖 · 2) < 𝑃)) → ((𝑖 · 2) mod 𝑃) = (𝑖 · 2))
59	9, 20, 57, 58	syl12anc 836	. . 3 ⊢ (((𝑃 ∈ ℕ ∧ ¬ 2 ∥ 𝑃) ∧ 𝑖 ∈ (1...((𝑃 − 1) / 2))) → ((𝑖 · 2) mod 𝑃) = (𝑖 · 2))
60	59	eqcomd 2740	. 2 ⊢ (((𝑃 ∈ ℕ ∧ ¬ 2 ∥ 𝑃) ∧ 𝑖 ∈ (1...((𝑃 − 1) / 2))) → (𝑖 · 2) = ((𝑖 · 2) mod 𝑃))
61	60	ralrimiva 3126	1 ⊢ ((𝑃 ∈ ℕ ∧ ¬ 2 ∥ 𝑃) → ∀𝑖 ∈ (1...((𝑃 − 1) / 2))(𝑖 · 2) = ((𝑖 · 2) mod 𝑃))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ≠ wne 2930 ∀wral 3049 class class class wbr 5096 (class class class)co 7356 ℂcc 11022 ℝcr 11023 0cc0 11024 1c1 11025 · cmul 11029 < clt 11164 ≤ cle 11165 − cmin 11362 / cdiv 11792 ℕcn 12143 2c2 12198 ℤcz 12486 ℝ⁺crp 12903 ...cfz 13421 mod cmo 13787 ∥ cdvds 16177

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101 ax-pre-sup 11102

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8633 df-en 8882 df-dom 8883 df-sdom 8884 df-sup 9343 df-inf 9344 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-div 11793 df-nn 12144 df-2 12206 df-n0 12400 df-z 12487 df-uz 12750 df-rp 12904 df-fz 13422 df-fl 13710 df-mod 13788

This theorem is referenced by: 2lgslem1a 27356

W3C validator