dchrisum0flblem1 - Metamath Proof Explorer

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

Theorem dchrisum0flblem1 27648

Description: Lemma for dchrisum0flb 27650. Base case, prime power. (Contributed by Mario Carneiro, 5-May-2016.)

**Hypotheses**
Ref	Expression
rpvmasum.z	⊢ 𝑍 = (ℤ/nℤ‘𝑁)
rpvmasum.l	⊢ 𝐿 = (ℤRHom‘𝑍)
rpvmasum.a	⊢ (𝜑 → 𝑁 ∈ ℕ)
rpvmasum2.g	⊢ 𝐺 = (DChr‘𝑁)
rpvmasum2.d	⊢ 𝐷 = (Base‘𝐺)
rpvmasum2.1	⊢ 1 = (0_g‘𝐺)
dchrisum0f.f	⊢ 𝐹 = (𝑏 ∈ ℕ ↦ Σ𝑣 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝑏} (𝑋‘(𝐿‘𝑣)))
dchrisum0f.x	⊢ (𝜑 → 𝑋 ∈ 𝐷)
dchrisum0flb.r	⊢ (𝜑 → 𝑋:(Base‘𝑍)⟶ℝ)
dchrisum0flblem1.1	⊢ (𝜑 → 𝑃 ∈ ℙ)
dchrisum0flblem1.2	⊢ (𝜑 → 𝐴 ∈ ℕ₀)

**Assertion**
Ref	Expression
dchrisum0flblem1	⊢ (𝜑 → if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) ≤ (𝐹‘(𝑃↑𝐴)))

Distinct variable groups: 𝑞,𝑏,𝑣,𝐴 𝑁,𝑞 𝑃,𝑏,𝑞,𝑣 𝐿,𝑏,𝑣 𝑋,𝑏,𝑣 Allowed substitution hints: 𝜑(𝑣,𝑞,𝑏) 𝐷(𝑣,𝑞,𝑏) 1 (𝑣,𝑞,𝑏) 𝐹(𝑣,𝑞,𝑏) 𝐺(𝑣,𝑞,𝑏) 𝐿(𝑞) 𝑁(𝑣,𝑏) 𝑋(𝑞) 𝑍(𝑣,𝑞,𝑏)

Proof of Theorem dchrisum0flblem1 Dummy variables 𝑘 𝑖 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		1red 11208	. . . . 5 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) = 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → 1 ∈ ℝ)
2		0red 11210	. . . . 5 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) = 1) ∧ ¬ (√‘(𝑃↑𝐴)) ∈ ℕ) → 0 ∈ ℝ)
3	1, 2	ifclda 4522	. . . 4 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) = 1) → if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) ∈ ℝ)
4		1red 11208	. . . 4 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) = 1) → 1 ∈ ℝ)
5		fzfid 14008	. . . . . 6 ⊢ (𝜑 → (0...𝐴) ∈ Fin)
6		dchrisum0flb.r	. . . . . . . 8 ⊢ (𝜑 → 𝑋:(Base‘𝑍)⟶ℝ)
7		rpvmasum.a	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑁 ∈ ℕ)
8	7	nnnn0d 12564	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
9		rpvmasum.z	. . . . . . . . . . 11 ⊢ 𝑍 = (ℤ/nℤ‘𝑁)
10		eqid 2761	. . . . . . . . . . 11 ⊢ (Base‘𝑍) = (Base‘𝑍)
11		rpvmasum.l	. . . . . . . . . . 11 ⊢ 𝐿 = (ℤRHom‘𝑍)
12	9, 10, 11	znzrhfo 21676	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ₀ → 𝐿:ℤ–onto→(Base‘𝑍))
13		fof 6792	. . . . . . . . . 10 ⊢ (𝐿:ℤ–onto→(Base‘𝑍) → 𝐿:ℤ⟶(Base‘𝑍))
14	8, 12, 13	3syl 19	. . . . . . . . 9 ⊢ (𝜑 → 𝐿:ℤ⟶(Base‘𝑍))
15		dchrisum0flblem1.1	. . . . . . . . . 10 ⊢ (𝜑 → 𝑃 ∈ ℙ)
16		prmz 16732	. . . . . . . . . 10 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ)
17	15, 16	syl 18	. . . . . . . . 9 ⊢ (𝜑 → 𝑃 ∈ ℤ)
18	14, 17	ffvelcdmd 7080	. . . . . . . 8 ⊢ (𝜑 → (𝐿‘𝑃) ∈ (Base‘𝑍))
19	6, 18	ffvelcdmd 7080	. . . . . . 7 ⊢ (𝜑 → (𝑋‘(𝐿‘𝑃)) ∈ ℝ)
20		elfznn0 13647	. . . . . . 7 ⊢ (𝑖 ∈ (0...𝐴) → 𝑖 ∈ ℕ₀)
21		reexpcl 14113	. . . . . . 7 ⊢ (((𝑋‘(𝐿‘𝑃)) ∈ ℝ ∧ 𝑖 ∈ ℕ₀) → ((𝑋‘(𝐿‘𝑃))↑𝑖) ∈ ℝ)
22	19, 20, 21	syl2an 607	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (0...𝐴)) → ((𝑋‘(𝐿‘𝑃))↑𝑖) ∈ ℝ)
23	5, 22	fsumrecl 15784	. . . . 5 ⊢ (𝜑 → Σ𝑖 ∈ (0...𝐴)((𝑋‘(𝐿‘𝑃))↑𝑖) ∈ ℝ)
24	23	adantr 485	. . . 4 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) = 1) → Σ𝑖 ∈ (0...𝐴)((𝑋‘(𝐿‘𝑃))↑𝑖) ∈ ℝ)
25		breq1 5111	. . . . . 6 ⊢ (1 = if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) → (1 ≤ 1 ↔ if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) ≤ 1))
26		breq1 5111	. . . . . 6 ⊢ (0 = if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) → (0 ≤ 1 ↔ if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) ≤ 1))
27		1le1 11841	. . . . . 6 ⊢ 1 ≤ 1
28		0le1 11736	. . . . . 6 ⊢ 0 ≤ 1
29	25, 26, 27, 28	keephyp 4558	. . . . 5 ⊢ if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) ≤ 1
30	29	a1i 11	. . . 4 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) = 1) → if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) ≤ 1)
31		dchrisum0flblem1.2	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ ℕ₀)
32		nn0uz 12899	. . . . . . . . . 10 ⊢ ℕ₀ = (ℤ_≥‘0)
33	31, 32	eleqtrdi 2871	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ (ℤ_≥‘0))
34		fzn0 13565	. . . . . . . . 9 ⊢ ((0...𝐴) ≠ ∅ ↔ 𝐴 ∈ (ℤ_≥‘0))
35	33, 34	sylibr 237	. . . . . . . 8 ⊢ (𝜑 → (0...𝐴) ≠ ∅)
36		hashnncl 14401	. . . . . . . . 9 ⊢ ((0...𝐴) ∈ Fin → ((♯‘(0...𝐴)) ∈ ℕ ↔ (0...𝐴) ≠ ∅))
37	5, 36	syl 18	. . . . . . . 8 ⊢ (𝜑 → ((♯‘(0...𝐴)) ∈ ℕ ↔ (0...𝐴) ≠ ∅))
38	35, 37	mpbird 260	. . . . . . 7 ⊢ (𝜑 → (♯‘(0...𝐴)) ∈ ℕ)
39	38	adantr 485	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) = 1) → (♯‘(0...𝐴)) ∈ ℕ)
40	39	nnge1d 12283	. . . . 5 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) = 1) → 1 ≤ (♯‘(0...𝐴)))
41		simpr 489	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) = 1) → (𝑋‘(𝐿‘𝑃)) = 1)
42	41	oveq1d 7425	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) = 1) → ((𝑋‘(𝐿‘𝑃))↑𝑖) = (1↑𝑖))
43		elfzelz 13551	. . . . . . . . 9 ⊢ (𝑖 ∈ (0...𝐴) → 𝑖 ∈ ℤ)
44		1exp 14126	. . . . . . . . 9 ⊢ (𝑖 ∈ ℤ → (1↑𝑖) = 1)
45	43, 44	syl 18	. . . . . . . 8 ⊢ (𝑖 ∈ (0...𝐴) → (1↑𝑖) = 1)
46	42, 45	sylan9eq 2816	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) = 1) ∧ 𝑖 ∈ (0...𝐴)) → ((𝑋‘(𝐿‘𝑃))↑𝑖) = 1)
47	46	sumeq2dv 15752	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) = 1) → Σ𝑖 ∈ (0...𝐴)((𝑋‘(𝐿‘𝑃))↑𝑖) = Σ𝑖 ∈ (0...𝐴)1)
48		fzfid 14008	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) = 1) → (0...𝐴) ∈ Fin)
49		ax-1cn 11157	. . . . . . 7 ⊢ 1 ∈ ℂ
50		fsumconst 15840	. . . . . . 7 ⊢ (((0...𝐴) ∈ Fin ∧ 1 ∈ ℂ) → Σ𝑖 ∈ (0...𝐴)1 = ((♯‘(0...𝐴)) · 1))
51	48, 49, 50	sylancl 597	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) = 1) → Σ𝑖 ∈ (0...𝐴)1 = ((♯‘(0...𝐴)) · 1))
52	39	nncnd 12248	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) = 1) → (♯‘(0...𝐴)) ∈ ℂ)
53	52	mulridd 11225	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) = 1) → ((♯‘(0...𝐴)) · 1) = (♯‘(0...𝐴)))
54	47, 51, 53	3eqtrd 2800	. . . . 5 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) = 1) → Σ𝑖 ∈ (0...𝐴)((𝑋‘(𝐿‘𝑃))↑𝑖) = (♯‘(0...𝐴)))
55	40, 54	breqtrrd 5138	. . . 4 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) = 1) → 1 ≤ Σ𝑖 ∈ (0...𝐴)((𝑋‘(𝐿‘𝑃))↑𝑖))
56	3, 4, 24, 30, 55	letrd 11366	. . 3 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) = 1) → if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) ≤ Σ𝑖 ∈ (0...𝐴)((𝑋‘(𝐿‘𝑃))↑𝑖))
57		oveq1 7417	. . . . . . 7 ⊢ (1 = if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) → (1 · (1 − (𝑋‘(𝐿‘𝑃)))) = (if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) · (1 − (𝑋‘(𝐿‘𝑃)))))
58	57	breq1d 5118	. . . . . 6 ⊢ (1 = if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) → ((1 · (1 − (𝑋‘(𝐿‘𝑃)))) ≤ (1 − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))) ↔ (if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) · (1 − (𝑋‘(𝐿‘𝑃)))) ≤ (1 − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1)))))
59		oveq1 7417	. . . . . . 7 ⊢ (0 = if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) → (0 · (1 − (𝑋‘(𝐿‘𝑃)))) = (if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) · (1 − (𝑋‘(𝐿‘𝑃)))))
60	59	breq1d 5118	. . . . . 6 ⊢ (0 = if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) → ((0 · (1 − (𝑋‘(𝐿‘𝑃)))) ≤ (1 − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))) ↔ (if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) · (1 − (𝑋‘(𝐿‘𝑃)))) ≤ (1 − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1)))))
61		1re 11207	. . . . . . . . . 10 ⊢ 1 ∈ ℝ
62	19	adantr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → (𝑋‘(𝐿‘𝑃)) ∈ ℝ)
63		resubcl 11521	. . . . . . . . . 10 ⊢ ((1 ∈ ℝ ∧ (𝑋‘(𝐿‘𝑃)) ∈ ℝ) → (1 − (𝑋‘(𝐿‘𝑃))) ∈ ℝ)
64	61, 62, 63	sylancr 598	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → (1 − (𝑋‘(𝐿‘𝑃))) ∈ ℝ)
65	64	adantr 485	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → (1 − (𝑋‘(𝐿‘𝑃))) ∈ ℝ)
66	65	leidd 11779	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → (1 − (𝑋‘(𝐿‘𝑃))) ≤ (1 − (𝑋‘(𝐿‘𝑃))))
67	64	recnd 11236	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → (1 − (𝑋‘(𝐿‘𝑃))) ∈ ℂ)
68	67	adantr 485	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → (1 − (𝑋‘(𝐿‘𝑃))) ∈ ℂ)
69	68	mullidd 11226	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → (1 · (1 − (𝑋‘(𝐿‘𝑃)))) = (1 − (𝑋‘(𝐿‘𝑃))))
70		nn0p1nn 12542	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ ℕ₀ → (𝐴 + 1) ∈ ℕ)
71	31, 70	syl 18	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐴 + 1) ∈ ℕ)
72	71	ad3antrrr 742	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) = 0) → (𝐴 + 1) ∈ ℕ)
73	72	0expd 14174	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) = 0) → (0↑(𝐴 + 1)) = 0)
74		simpr 489	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) = 0) → (𝑋‘(𝐿‘𝑃)) = 0)
75	74	oveq1d 7425	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) = 0) → ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1)) = (0↑(𝐴 + 1)))
76	73, 75, 74	3eqtr4d 2806	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) = 0) → ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1)) = (𝑋‘(𝐿‘𝑃)))
77		neg1cn 12202	. . . . . . . . . . . . 13 ⊢ -1 ∈ ℂ
78	31	ad2antrr 738	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → 𝐴 ∈ ℕ₀)
79		expp1 14103	. . . . . . . . . . . . 13 ⊢ ((-1 ∈ ℂ ∧ 𝐴 ∈ ℕ₀) → (-1↑(𝐴 + 1)) = ((-1↑𝐴) · -1))
80	77, 78, 79	sylancr 598	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → (-1↑(𝐴 + 1)) = ((-1↑𝐴) · -1))
81		prmnn 16731	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ)
82	15, 81	syl 18	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → 𝑃 ∈ ℕ)
83	82, 31	nnexpcld 14280	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → (𝑃↑𝐴) ∈ ℕ)
84	83	nncnd 12248	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → (𝑃↑𝐴) ∈ ℂ)
85	84	ad2antrr 738	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → (𝑃↑𝐴) ∈ ℂ)
86	85	sqsqrtd 15492	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → ((√‘(𝑃↑𝐴))↑2) = (𝑃↑𝐴))
87	86	oveq2d 7426	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → (𝑃 pCnt ((√‘(𝑃↑𝐴))↑2)) = (𝑃 pCnt (𝑃↑𝐴)))
88	15	ad2antrr 738	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → 𝑃 ∈ ℙ)
89		nnq 12985	. . . . . . . . . . . . . . . . . . 19 ⊢ ((√‘(𝑃↑𝐴)) ∈ ℕ → (√‘(𝑃↑𝐴)) ∈ ℚ)
90	89	adantl 486	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → (√‘(𝑃↑𝐴)) ∈ ℚ)
91		nnne0 12269	. . . . . . . . . . . . . . . . . . 19 ⊢ ((√‘(𝑃↑𝐴)) ∈ ℕ → (√‘(𝑃↑𝐴)) ≠ 0)
92	91	adantl 486	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → (√‘(𝑃↑𝐴)) ≠ 0)
93		2z 12625	. . . . . . . . . . . . . . . . . . 19 ⊢ 2 ∈ ℤ
94	93	a1i 11	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → 2 ∈ ℤ)
95		pcexp 16918	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑃 ∈ ℙ ∧ ((√‘(𝑃↑𝐴)) ∈ ℚ ∧ (√‘(𝑃↑𝐴)) ≠ 0) ∧ 2 ∈ ℤ) → (𝑃 pCnt ((√‘(𝑃↑𝐴))↑2)) = (2 · (𝑃 pCnt (√‘(𝑃↑𝐴)))))
96	88, 90, 92, 94, 95	syl121anc 1400	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → (𝑃 pCnt ((√‘(𝑃↑𝐴))↑2)) = (2 · (𝑃 pCnt (√‘(𝑃↑𝐴)))))
97	78	nn0zd 12615	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → 𝐴 ∈ ℤ)
98		pcid 16932	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 pCnt (𝑃↑𝐴)) = 𝐴)
99	88, 97, 98	syl2anc 595	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → (𝑃 pCnt (𝑃↑𝐴)) = 𝐴)
100	87, 96, 99	3eqtr3rd 2805	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → 𝐴 = (2 · (𝑃 pCnt (√‘(𝑃↑𝐴)))))
101	100	oveq2d 7426	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → (-1↑𝐴) = (-1↑(2 · (𝑃 pCnt (√‘(𝑃↑𝐴))))))
102	77	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → -1 ∈ ℂ)
103		simpr 489	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → (√‘(𝑃↑𝐴)) ∈ ℕ)
104	88, 103	pccld 16909	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → (𝑃 pCnt (√‘(𝑃↑𝐴))) ∈ ℕ₀)
105		2nn0 12520	. . . . . . . . . . . . . . . . 17 ⊢ 2 ∈ ℕ₀
106	105	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → 2 ∈ ℕ₀)
107	102, 104, 106	expmuld 14184	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → (-1↑(2 · (𝑃 pCnt (√‘(𝑃↑𝐴))))) = ((-1↑2)↑(𝑃 pCnt (√‘(𝑃↑𝐴)))))
108		neg1sqe1 14231	. . . . . . . . . . . . . . . . 17 ⊢ (-1↑2) = 1
109	108	oveq1i 7420	. . . . . . . . . . . . . . . 16 ⊢ ((-1↑2)↑(𝑃 pCnt (√‘(𝑃↑𝐴)))) = (1↑(𝑃 pCnt (√‘(𝑃↑𝐴))))
110	104	nn0zd 12615	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → (𝑃 pCnt (√‘(𝑃↑𝐴))) ∈ ℤ)
111		1exp 14126	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑃 pCnt (√‘(𝑃↑𝐴))) ∈ ℤ → (1↑(𝑃 pCnt (√‘(𝑃↑𝐴)))) = 1)
112	110, 111	syl 18	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → (1↑(𝑃 pCnt (√‘(𝑃↑𝐴)))) = 1)
113	109, 112	eqtrid 2808	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → ((-1↑2)↑(𝑃 pCnt (√‘(𝑃↑𝐴)))) = 1)
114	101, 107, 113	3eqtrd 2800	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → (-1↑𝐴) = 1)
115	114	oveq1d 7425	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → ((-1↑𝐴) · -1) = (1 · -1))
116	77	mullidi 11213	. . . . . . . . . . . . 13 ⊢ (1 · -1) = -1
117	115, 116	eqtrdi 2812	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → ((-1↑𝐴) · -1) = -1)
118	80, 117	eqtrd 2796	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → (-1↑(𝐴 + 1)) = -1)
119	118	adantr 485	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) ≠ 0) → (-1↑(𝐴 + 1)) = -1)
120	19	recnd 11236	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑋‘(𝐿‘𝑃)) ∈ ℂ)
121	120	adantr 485	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → (𝑋‘(𝐿‘𝑃)) ∈ ℂ)
122	121	ad2antrr 738	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) ≠ 0) → (𝑋‘(𝐿‘𝑃)) ∈ ℂ)
123	122	negnegd 11559	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) ≠ 0) → --(𝑋‘(𝐿‘𝑃)) = (𝑋‘(𝐿‘𝑃)))
124		simpr 489	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → (𝑋‘(𝐿‘𝑃)) ≠ 1)
125	124	ad2antrr 738	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) ≠ 0) → (𝑋‘(𝐿‘𝑃)) ≠ 1)
126		rpvmasum2.g	. . . . . . . . . . . . . . . . . . 19 ⊢ 𝐺 = (DChr‘𝑁)
127		rpvmasum2.d	. . . . . . . . . . . . . . . . . . 19 ⊢ 𝐷 = (Base‘𝐺)
128		dchrisum0f.x	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → 𝑋 ∈ 𝐷)
129	128	ad3antrrr 742	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) ≠ 0) → 𝑋 ∈ 𝐷)
130		eqid 2761	. . . . . . . . . . . . . . . . . . 19 ⊢ (Unit‘𝑍) = (Unit‘𝑍)
131	126, 9, 127, 10, 130, 128, 18	dchrn0 27390	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → ((𝑋‘(𝐿‘𝑃)) ≠ 0 ↔ (𝐿‘𝑃) ∈ (Unit‘𝑍)))
132	131	ad2antrr 738	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → ((𝑋‘(𝐿‘𝑃)) ≠ 0 ↔ (𝐿‘𝑃) ∈ (Unit‘𝑍)))
133	132	biimpa 481	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) ≠ 0) → (𝐿‘𝑃) ∈ (Unit‘𝑍))
134	126, 127, 129, 9, 130, 133	dchrabs 27400	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) ≠ 0) → (abs‘(𝑋‘(𝐿‘𝑃))) = 1)
135		eqeq1 2765	. . . . . . . . . . . . . . . . . 18 ⊢ ((abs‘(𝑋‘(𝐿‘𝑃))) = (𝑋‘(𝐿‘𝑃)) → ((abs‘(𝑋‘(𝐿‘𝑃))) = 1 ↔ (𝑋‘(𝐿‘𝑃)) = 1))
136	134, 135	syl5ibcom 248	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) ≠ 0) → ((abs‘(𝑋‘(𝐿‘𝑃))) = (𝑋‘(𝐿‘𝑃)) → (𝑋‘(𝐿‘𝑃)) = 1))
137	136	necon3ad 2969	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) ≠ 0) → ((𝑋‘(𝐿‘𝑃)) ≠ 1 → ¬ (abs‘(𝑋‘(𝐿‘𝑃))) = (𝑋‘(𝐿‘𝑃))))
138	125, 137	mpd 16	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) ≠ 0) → ¬ (abs‘(𝑋‘(𝐿‘𝑃))) = (𝑋‘(𝐿‘𝑃)))
139	62	ad2antrr 738	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) ≠ 0) → (𝑋‘(𝐿‘𝑃)) ∈ ℝ)
140	139	absord 15466	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) ≠ 0) → ((abs‘(𝑋‘(𝐿‘𝑃))) = (𝑋‘(𝐿‘𝑃)) ∨ (abs‘(𝑋‘(𝐿‘𝑃))) = -(𝑋‘(𝐿‘𝑃))))
141	140	ord 877	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) ≠ 0) → (¬ (abs‘(𝑋‘(𝐿‘𝑃))) = (𝑋‘(𝐿‘𝑃)) → (abs‘(𝑋‘(𝐿‘𝑃))) = -(𝑋‘(𝐿‘𝑃))))
142	138, 141	mpd 16	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) ≠ 0) → (abs‘(𝑋‘(𝐿‘𝑃))) = -(𝑋‘(𝐿‘𝑃)))
143	142, 134	eqtr3d 2798	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) ≠ 0) → -(𝑋‘(𝐿‘𝑃)) = 1)
144	143	negeqd 11450	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) ≠ 0) → --(𝑋‘(𝐿‘𝑃)) = -1)
145	123, 144	eqtr3d 2798	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) ≠ 0) → (𝑋‘(𝐿‘𝑃)) = -1)
146	145	oveq1d 7425	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) ≠ 0) → ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1)) = (-1↑(𝐴 + 1)))
147	119, 146, 145	3eqtr4d 2806	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) ∧ (𝑋‘(𝐿‘𝑃)) ≠ 0) → ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1)) = (𝑋‘(𝐿‘𝑃)))
148	76, 147	pm2.61dane 3043	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1)) = (𝑋‘(𝐿‘𝑃)))
149	148	oveq2d 7426	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → (1 − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))) = (1 − (𝑋‘(𝐿‘𝑃))))
150	66, 69, 149	3brtr4d 5142	. . . . . 6 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ (√‘(𝑃↑𝐴)) ∈ ℕ) → (1 · (1 − (𝑋‘(𝐿‘𝑃)))) ≤ (1 − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))))
151	67	mul02d 11407	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → (0 · (1 − (𝑋‘(𝐿‘𝑃)))) = 0)
152		peano2nn0 12543	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ ℕ₀ → (𝐴 + 1) ∈ ℕ₀)
153	31, 152	syl 18	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐴 + 1) ∈ ℕ₀)
154	19, 153	reexpcld 14198	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1)) ∈ ℝ)
155	154	adantr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1)) ∈ ℝ)
156	155	recnd 11236	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1)) ∈ ℂ)
157	156	abscld 15489	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → (abs‘((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))) ∈ ℝ)
158		1red 11208	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → 1 ∈ ℝ)
159	155	leabsd 15465	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1)) ≤ (abs‘((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))))
160	153	adantr 485	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → (𝐴 + 1) ∈ ℕ₀)
161	121, 160	absexpd 15505	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → (abs‘((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))) = ((abs‘(𝑋‘(𝐿‘𝑃)))↑(𝐴 + 1)))
162	121	abscld 15489	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → (abs‘(𝑋‘(𝐿‘𝑃))) ∈ ℝ)
163	121	absge0d 15497	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → 0 ≤ (abs‘(𝑋‘(𝐿‘𝑃))))
164	126, 127, 9, 10, 128, 18	dchrabs2 27402	. . . . . . . . . . . . 13 ⊢ (𝜑 → (abs‘(𝑋‘(𝐿‘𝑃))) ≤ 1)
165	164	adantr 485	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → (abs‘(𝑋‘(𝐿‘𝑃))) ≤ 1)
166		exple1 14212	. . . . . . . . . . . 12 ⊢ ((((abs‘(𝑋‘(𝐿‘𝑃))) ∈ ℝ ∧ 0 ≤ (abs‘(𝑋‘(𝐿‘𝑃))) ∧ (abs‘(𝑋‘(𝐿‘𝑃))) ≤ 1) ∧ (𝐴 + 1) ∈ ℕ₀) → ((abs‘(𝑋‘(𝐿‘𝑃)))↑(𝐴 + 1)) ≤ 1)
167	162, 163, 165, 160, 166	syl31anc 1398	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → ((abs‘(𝑋‘(𝐿‘𝑃)))↑(𝐴 + 1)) ≤ 1)
168	161, 167	eqbrtrd 5132	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → (abs‘((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))) ≤ 1)
169	155, 157, 158, 159, 168	letrd 11366	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1)) ≤ 1)
170		subge0 11726	. . . . . . . . . 10 ⊢ ((1 ∈ ℝ ∧ ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1)) ∈ ℝ) → (0 ≤ (1 − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))) ↔ ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1)) ≤ 1))
171	61, 155, 170	sylancr 598	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → (0 ≤ (1 − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))) ↔ ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1)) ≤ 1))
172	169, 171	mpbird 260	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → 0 ≤ (1 − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))))
173	151, 172	eqbrtrd 5132	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → (0 · (1 − (𝑋‘(𝐿‘𝑃)))) ≤ (1 − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))))
174	173	adantr 485	. . . . . 6 ⊢ (((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) ∧ ¬ (√‘(𝑃↑𝐴)) ∈ ℕ) → (0 · (1 − (𝑋‘(𝐿‘𝑃)))) ≤ (1 − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))))
175	58, 60, 150, 174	ifbothda 4525	. . . . 5 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → (if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) · (1 − (𝑋‘(𝐿‘𝑃)))) ≤ (1 − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))))
176		0re 11209	. . . . . . . 8 ⊢ 0 ∈ ℝ
177	61, 176	ifcli 4534	. . . . . . 7 ⊢ if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) ∈ ℝ
178	177	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) ∈ ℝ)
179		resubcl 11521	. . . . . . 7 ⊢ ((1 ∈ ℝ ∧ ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1)) ∈ ℝ) → (1 − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))) ∈ ℝ)
180	61, 155, 179	sylancr 598	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → (1 − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))) ∈ ℝ)
181	62	leabsd 15465	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → (𝑋‘(𝐿‘𝑃)) ≤ (abs‘(𝑋‘(𝐿‘𝑃))))
182	62, 162, 158, 181, 165	letrd 11366	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → (𝑋‘(𝐿‘𝑃)) ≤ 1)
183	124	necomd 3011	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → 1 ≠ (𝑋‘(𝐿‘𝑃)))
184	62, 158, 182, 183	leneltd 11363	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → (𝑋‘(𝐿‘𝑃)) < 1)
185		posdif 11706	. . . . . . . 8 ⊢ (((𝑋‘(𝐿‘𝑃)) ∈ ℝ ∧ 1 ∈ ℝ) → ((𝑋‘(𝐿‘𝑃)) < 1 ↔ 0 < (1 − (𝑋‘(𝐿‘𝑃)))))
186	62, 61, 185	sylancl 597	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → ((𝑋‘(𝐿‘𝑃)) < 1 ↔ 0 < (1 − (𝑋‘(𝐿‘𝑃)))))
187	184, 186	mpbid 235	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → 0 < (1 − (𝑋‘(𝐿‘𝑃))))
188		lemuldiv 12094	. . . . . 6 ⊢ ((if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) ∈ ℝ ∧ (1 − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))) ∈ ℝ ∧ ((1 − (𝑋‘(𝐿‘𝑃))) ∈ ℝ ∧ 0 < (1 − (𝑋‘(𝐿‘𝑃))))) → ((if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) · (1 − (𝑋‘(𝐿‘𝑃)))) ≤ (1 − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))) ↔ if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) ≤ ((1 − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))) / (1 − (𝑋‘(𝐿‘𝑃))))))
189	178, 180, 64, 187, 188	syl112anc 1399	. . . . 5 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → ((if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) · (1 − (𝑋‘(𝐿‘𝑃)))) ≤ (1 − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))) ↔ if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) ≤ ((1 − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))) / (1 − (𝑋‘(𝐿‘𝑃))))))
190	175, 189	mpbid 235	. . . 4 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) ≤ ((1 − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))) / (1 − (𝑋‘(𝐿‘𝑃)))))
191	31	nn0zd 12615	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℤ)
192		fzval3 13762	. . . . . . . 8 ⊢ (𝐴 ∈ ℤ → (0...𝐴) = (0..^(𝐴 + 1)))
193	191, 192	syl 18	. . . . . . 7 ⊢ (𝜑 → (0...𝐴) = (0..^(𝐴 + 1)))
194	193	adantr 485	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → (0...𝐴) = (0..^(𝐴 + 1)))
195	194	sumeq1d 15750	. . . . 5 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → Σ𝑖 ∈ (0...𝐴)((𝑋‘(𝐿‘𝑃))↑𝑖) = Σ𝑖 ∈ (0..^(𝐴 + 1))((𝑋‘(𝐿‘𝑃))↑𝑖))
196		0nn0 12518	. . . . . . 7 ⊢ 0 ∈ ℕ₀
197	196	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → 0 ∈ ℕ₀)
198	153, 32	eleqtrdi 2871	. . . . . . 7 ⊢ (𝜑 → (𝐴 + 1) ∈ (ℤ_≥‘0))
199	198	adantr 485	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → (𝐴 + 1) ∈ (ℤ_≥‘0))
200	121, 124, 197, 199	geoserg 15919	. . . . 5 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → Σ𝑖 ∈ (0..^(𝐴 + 1))((𝑋‘(𝐿‘𝑃))↑𝑖) = ((((𝑋‘(𝐿‘𝑃))↑0) − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))) / (1 − (𝑋‘(𝐿‘𝑃)))))
201	121	exp0d 14175	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → ((𝑋‘(𝐿‘𝑃))↑0) = 1)
202	201	oveq1d 7425	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → (((𝑋‘(𝐿‘𝑃))↑0) − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))) = (1 − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))))
203	202	oveq1d 7425	. . . . 5 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → ((((𝑋‘(𝐿‘𝑃))↑0) − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))) / (1 − (𝑋‘(𝐿‘𝑃)))) = ((1 − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))) / (1 − (𝑋‘(𝐿‘𝑃)))))
204	195, 200, 203	3eqtrd 2800	. . . 4 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → Σ𝑖 ∈ (0...𝐴)((𝑋‘(𝐿‘𝑃))↑𝑖) = ((1 − ((𝑋‘(𝐿‘𝑃))↑(𝐴 + 1))) / (1 − (𝑋‘(𝐿‘𝑃)))))
205	190, 204	breqtrrd 5138	. . 3 ⊢ ((𝜑 ∧ (𝑋‘(𝐿‘𝑃)) ≠ 1) → if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) ≤ Σ𝑖 ∈ (0...𝐴)((𝑋‘(𝐿‘𝑃))↑𝑖))
206	56, 205	pm2.61dane 3043	. 2 ⊢ (𝜑 → if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) ≤ Σ𝑖 ∈ (0...𝐴)((𝑋‘(𝐿‘𝑃))↑𝑖))
207		rpvmasum2.1	. . . . 5 ⊢ 1 = (0_g‘𝐺)
208		dchrisum0f.f	. . . . 5 ⊢ 𝐹 = (𝑏 ∈ ℕ ↦ Σ𝑣 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝑏} (𝑋‘(𝐿‘𝑣)))
209	9, 11, 7, 126, 127, 207, 208	dchrisum0fval 27645	. . . 4 ⊢ ((𝑃↑𝐴) ∈ ℕ → (𝐹‘(𝑃↑𝐴)) = Σ𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝑃↑𝐴)} (𝑋‘(𝐿‘𝑘)))
210	83, 209	syl 18	. . 3 ⊢ (𝜑 → (𝐹‘(𝑃↑𝐴)) = Σ𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝑃↑𝐴)} (𝑋‘(𝐿‘𝑘)))
211		2fveq3 6886	. . . 4 ⊢ (𝑘 = (𝑃↑𝑖) → (𝑋‘(𝐿‘𝑘)) = (𝑋‘(𝐿‘(𝑃↑𝑖))))
212		eqid 2761	. . . . . 6 ⊢ (𝑏 ∈ (0...𝐴) ↦ (𝑃↑𝑏)) = (𝑏 ∈ (0...𝐴) ↦ (𝑃↑𝑏))
213	212	dvdsppwf1o 27326	. . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ₀) → (𝑏 ∈ (0...𝐴) ↦ (𝑃↑𝑏)):(0...𝐴)–1-1-onto→{𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝑃↑𝐴)})
214	15, 31, 213	syl2anc 595	. . . 4 ⊢ (𝜑 → (𝑏 ∈ (0...𝐴) ↦ (𝑃↑𝑏)):(0...𝐴)–1-1-onto→{𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝑃↑𝐴)})
215		oveq2 7418	. . . . . 6 ⊢ (𝑏 = 𝑖 → (𝑃↑𝑏) = (𝑃↑𝑖))
216		ovex 7443	. . . . . 6 ⊢ (𝑃↑𝑏) ∈ V
217	215, 212, 216	fvmpt3i 6995	. . . . 5 ⊢ (𝑖 ∈ (0...𝐴) → ((𝑏 ∈ (0...𝐴) ↦ (𝑃↑𝑏))‘𝑖) = (𝑃↑𝑖))
218	217	adantl 486	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ (0...𝐴)) → ((𝑏 ∈ (0...𝐴) ↦ (𝑃↑𝑏))‘𝑖) = (𝑃↑𝑖))
219	6	adantr 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝑃↑𝐴)}) → 𝑋:(Base‘𝑍)⟶ℝ)
220		elrabi 3645	. . . . . . . 8 ⊢ (𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝑃↑𝐴)} → 𝑘 ∈ ℕ)
221	220	nnzd 12616	. . . . . . 7 ⊢ (𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝑃↑𝐴)} → 𝑘 ∈ ℤ)
222		ffvelcdm 7076	. . . . . . 7 ⊢ ((𝐿:ℤ⟶(Base‘𝑍) ∧ 𝑘 ∈ ℤ) → (𝐿‘𝑘) ∈ (Base‘𝑍))
223	14, 221, 222	syl2an 607	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝑃↑𝐴)}) → (𝐿‘𝑘) ∈ (Base‘𝑍))
224	219, 223	ffvelcdmd 7080	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝑃↑𝐴)}) → (𝑋‘(𝐿‘𝑘)) ∈ ℝ)
225	224	recnd 11236	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝑃↑𝐴)}) → (𝑋‘(𝐿‘𝑘)) ∈ ℂ)
226	211, 5, 214, 218, 225	fsumf1o 15773	. . 3 ⊢ (𝜑 → Σ𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝑃↑𝐴)} (𝑋‘(𝐿‘𝑘)) = Σ𝑖 ∈ (0...𝐴)(𝑋‘(𝐿‘(𝑃↑𝑖))))
227		zsubrg 21549	. . . . . . . . . . 11 ⊢ ℤ ∈ (SubRing‘ℂ_fld)
228		eqid 2761	. . . . . . . . . . . 12 ⊢ (mulGrp‘ℂ_fld) = (mulGrp‘ℂ_fld)
229	228	subrgsubm 20669	. . . . . . . . . . 11 ⊢ (ℤ ∈ (SubRing‘ℂ_fld) → ℤ ∈ (SubMnd‘(mulGrp‘ℂ_fld)))
230	227, 229	mp1i 14	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (0...𝐴)) → ℤ ∈ (SubMnd‘(mulGrp‘ℂ_fld)))
231	20	adantl 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (0...𝐴)) → 𝑖 ∈ ℕ₀)
232	17	adantr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (0...𝐴)) → 𝑃 ∈ ℤ)
233		eqid 2761	. . . . . . . . . . 11 ⊢ (._g‘(mulGrp‘ℂ_fld)) = (._g‘(mulGrp‘ℂ_fld))
234		zringmpg 21600	. . . . . . . . . . . 12 ⊢ ((mulGrp‘ℂ_fld) ↾_s ℤ) = (mulGrp‘ℤ_ring)
235	234	eqcomi 2770	. . . . . . . . . . 11 ⊢ (mulGrp‘ℤ_ring) = ((mulGrp‘ℂ_fld) ↾_s ℤ)
236		eqid 2761	. . . . . . . . . . 11 ⊢ (._g‘(mulGrp‘ℤ_ring)) = (._g‘(mulGrp‘ℤ_ring))
237	233, 235, 236	submmulg 19183	. . . . . . . . . 10 ⊢ ((ℤ ∈ (SubMnd‘(mulGrp‘ℂ_fld)) ∧ 𝑖 ∈ ℕ₀ ∧ 𝑃 ∈ ℤ) → (𝑖(._g‘(mulGrp‘ℂ_fld))𝑃) = (𝑖(._g‘(mulGrp‘ℤ_ring))𝑃))
238	230, 231, 232, 237	syl3anc 1396	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (0...𝐴)) → (𝑖(._g‘(mulGrp‘ℂ_fld))𝑃) = (𝑖(._g‘(mulGrp‘ℤ_ring))𝑃))
239	82	nncnd 12248	. . . . . . . . . 10 ⊢ (𝜑 → 𝑃 ∈ ℂ)
240		cnfldexp 21534	. . . . . . . . . 10 ⊢ ((𝑃 ∈ ℂ ∧ 𝑖 ∈ ℕ₀) → (𝑖(._g‘(mulGrp‘ℂ_fld))𝑃) = (𝑃↑𝑖))
241	239, 20, 240	syl2an 607	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (0...𝐴)) → (𝑖(._g‘(mulGrp‘ℂ_fld))𝑃) = (𝑃↑𝑖))
242	238, 241	eqtr3d 2798	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (0...𝐴)) → (𝑖(._g‘(mulGrp‘ℤ_ring))𝑃) = (𝑃↑𝑖))
243	242	fveq2d 6885	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (0...𝐴)) → (𝐿‘(𝑖(._g‘(mulGrp‘ℤ_ring))𝑃)) = (𝐿‘(𝑃↑𝑖)))
244	9	zncrng 21673	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ₀ → 𝑍 ∈ CRing)
245		crngring 20326	. . . . . . . . . . 11 ⊢ (𝑍 ∈ CRing → 𝑍 ∈ Ring)
246	8, 244, 245	3syl 19	. . . . . . . . . 10 ⊢ (𝜑 → 𝑍 ∈ Ring)
247	11	zrhrhm 21640	. . . . . . . . . 10 ⊢ (𝑍 ∈ Ring → 𝐿 ∈ (ℤ_ring RingHom 𝑍))
248		eqid 2761	. . . . . . . . . . 11 ⊢ (mulGrp‘ℤ_ring) = (mulGrp‘ℤ_ring)
249		eqid 2761	. . . . . . . . . . 11 ⊢ (mulGrp‘𝑍) = (mulGrp‘𝑍)
250	248, 249	rhmmhm 20560	. . . . . . . . . 10 ⊢ (𝐿 ∈ (ℤ_ring RingHom 𝑍) → 𝐿 ∈ ((mulGrp‘ℤ_ring) MndHom (mulGrp‘𝑍)))
251	246, 247, 250	3syl 19	. . . . . . . . 9 ⊢ (𝜑 → 𝐿 ∈ ((mulGrp‘ℤ_ring) MndHom (mulGrp‘𝑍)))
252	251	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (0...𝐴)) → 𝐿 ∈ ((mulGrp‘ℤ_ring) MndHom (mulGrp‘𝑍)))
253		zringbas 21582	. . . . . . . . . 10 ⊢ ℤ = (Base‘ℤ_ring)
254	248, 253	mgpbas 20220	. . . . . . . . 9 ⊢ ℤ = (Base‘(mulGrp‘ℤ_ring))
255		eqid 2761	. . . . . . . . 9 ⊢ (._g‘(mulGrp‘𝑍)) = (._g‘(mulGrp‘𝑍))
256	254, 236, 255	mhmmulg 19180	. . . . . . . 8 ⊢ ((𝐿 ∈ ((mulGrp‘ℤ_ring) MndHom (mulGrp‘𝑍)) ∧ 𝑖 ∈ ℕ₀ ∧ 𝑃 ∈ ℤ) → (𝐿‘(𝑖(._g‘(mulGrp‘ℤ_ring))𝑃)) = (𝑖(._g‘(mulGrp‘𝑍))(𝐿‘𝑃)))
257	252, 231, 232, 256	syl3anc 1396	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (0...𝐴)) → (𝐿‘(𝑖(._g‘(mulGrp‘ℤ_ring))𝑃)) = (𝑖(._g‘(mulGrp‘𝑍))(𝐿‘𝑃)))
258	243, 257	eqtr3d 2798	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (0...𝐴)) → (𝐿‘(𝑃↑𝑖)) = (𝑖(._g‘(mulGrp‘𝑍))(𝐿‘𝑃)))
259	258	fveq2d 6885	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ (0...𝐴)) → (𝑋‘(𝐿‘(𝑃↑𝑖))) = (𝑋‘(𝑖(._g‘(mulGrp‘𝑍))(𝐿‘𝑃))))
260	126, 9, 127	dchrmhm 27381	. . . . . . . 8 ⊢ 𝐷 ⊆ ((mulGrp‘𝑍) MndHom (mulGrp‘ℂ_fld))
261	260, 128	sselid 3934	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ ((mulGrp‘𝑍) MndHom (mulGrp‘ℂ_fld)))
262	261	adantr 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (0...𝐴)) → 𝑋 ∈ ((mulGrp‘𝑍) MndHom (mulGrp‘ℂ_fld)))
263	18	adantr 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (0...𝐴)) → (𝐿‘𝑃) ∈ (Base‘𝑍))
264	249, 10	mgpbas 20220	. . . . . . 7 ⊢ (Base‘𝑍) = (Base‘(mulGrp‘𝑍))
265	264, 255, 233	mhmmulg 19180	. . . . . 6 ⊢ ((𝑋 ∈ ((mulGrp‘𝑍) MndHom (mulGrp‘ℂ_fld)) ∧ 𝑖 ∈ ℕ₀ ∧ (𝐿‘𝑃) ∈ (Base‘𝑍)) → (𝑋‘(𝑖(._g‘(mulGrp‘𝑍))(𝐿‘𝑃))) = (𝑖(._g‘(mulGrp‘ℂ_fld))(𝑋‘(𝐿‘𝑃))))
266	262, 231, 263, 265	syl3anc 1396	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ (0...𝐴)) → (𝑋‘(𝑖(._g‘(mulGrp‘𝑍))(𝐿‘𝑃))) = (𝑖(._g‘(mulGrp‘ℂ_fld))(𝑋‘(𝐿‘𝑃))))
267		cnfldexp 21534	. . . . . 6 ⊢ (((𝑋‘(𝐿‘𝑃)) ∈ ℂ ∧ 𝑖 ∈ ℕ₀) → (𝑖(._g‘(mulGrp‘ℂ_fld))(𝑋‘(𝐿‘𝑃))) = ((𝑋‘(𝐿‘𝑃))↑𝑖))
268	120, 20, 267	syl2an 607	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ (0...𝐴)) → (𝑖(._g‘(mulGrp‘ℂ_fld))(𝑋‘(𝐿‘𝑃))) = ((𝑋‘(𝐿‘𝑃))↑𝑖))
269	259, 266, 268	3eqtrd 2800	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ (0...𝐴)) → (𝑋‘(𝐿‘(𝑃↑𝑖))) = ((𝑋‘(𝐿‘𝑃))↑𝑖))
270	269	sumeq2dv 15752	. . 3 ⊢ (𝜑 → Σ𝑖 ∈ (0...𝐴)(𝑋‘(𝐿‘(𝑃↑𝑖))) = Σ𝑖 ∈ (0...𝐴)((𝑋‘(𝐿‘𝑃))↑𝑖))
271	210, 226, 270	3eqtrd 2800	. 2 ⊢ (𝜑 → (𝐹‘(𝑃↑𝐴)) = Σ𝑖 ∈ (0...𝐴)((𝑋‘(𝐿‘𝑃))↑𝑖))
272	206, 271	breqtrrd 5138	1 ⊢ (𝜑 → if((√‘(𝑃↑𝐴)) ∈ ℕ, 1, 0) ≤ (𝐹‘(𝑃↑𝐴)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1568 ∈ wcel 2141 ≠ wne 2956 {crab 3414 ∅c0 4285 ifcif 4486 class class class wbr 5108 ↦ cmpt 5191 ⟶wf 6532 –onto→wfo 6534 –1-1-onto→wf1o 6535 ‘cfv 6536 (class class class)co 7410 Fincfn 8942 ℂcc 11097 ℝcr 11098 0cc0 11099 1c1 11100 + caddc 11102 · cmul 11104 < clt 11242 ≤ cle 11243 − cmin 11440 -cneg 11441 / cdiv 11870 ℕcn 12232 2c2 12294 ℕ₀cn0 12503 ℤcz 12590 ℤ_≥cuz 12861 ℚcq 12971 ...cfz 13534 ..^cfzo 13681 ↑cexp 14096 ♯chash 14365 √csqrt 15283 abscabs 15284 Σcsu 15736 ∥ cdvds 16309 ℙcprime 16728 pCnt cpc 16895 Basecbs 17268 ↾_s cress 17289 0_gc0g 17491 MndHom cmhm 18838 SubMndcsubmnd 18839 ._gcmg 19132 mulGrpcmgp 20215 Ringcrg 20314 CRingccrg 20315 Unitcui 20436 RingHom crh 20550 SubRingcsubrg 20653 ℂ_fldccnfld 21501 ℤ_ringczring 21575 ℤRHomczrh 21628 ℤ/nℤczn 21631 DChrcdchr 27372

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-inf2 9609 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 ax-pre-sup 11177 ax-addf 11178 ax-mulf 11179

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4595 df-uni 4872 df-int 4912 df-iun 4957 df-iin 4958 df-disj 5076 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-se 5615 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-isom 6545 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-of 7674 df-om 7862 df-1st 7985 df-2nd 7986 df-supp 8156 df-tpos 8221 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-1o 8452 df-2o 8453 df-oadd 8456 df-omul 8457 df-er 8693 df-ec 8695 df-qs 8699 df-map 8825 df-pm 8826 df-ixp 8895 df-en 8943 df-dom 8944 df-sdom 8945 df-fin 8946 df-fsupp 9321 df-fi 9370 df-sup 9401 df-inf 9402 df-oi 9471 df-card 9924 df-acn 9927 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-div 11871 df-nn 12233 df-2 12302 df-3 12303 df-4 12304 df-5 12305 df-6 12306 df-7 12307 df-8 12308 df-9 12309 df-n0 12504 df-z 12591 df-dec 12711 df-uz 12862 df-q 12972 df-rp 13016 df-xneg 13136 df-xadd 13137 df-xmul 13138 df-ioo 13375 df-ioc 13376 df-ico 13377 df-icc 13378 df-fz 13535 df-fzo 13682 df-fl 13824 df-mod 13902 df-seq 14037 df-exp 14097 df-fac 14309 df-bc 14338 df-hash 14366 df-shft 15103 df-cj 15149 df-re 15150 df-im 15151 df-sqrt 15285 df-abs 15286 df-limsup 15521 df-clim 15538 df-rlim 15539 df-sum 15737 df-ef 16120 df-sin 16122 df-cos 16123 df-pi 16125 df-dvds 16310 df-gcd 16552 df-prm 16729 df-pc 16896 df-struct 17206 df-sets 17223 df-slot 17241 df-ndx 17253 df-base 17269 df-ress 17290 df-plusg 17322 df-mulr 17323 df-starv 17324 df-sca 17325 df-vsca 17326 df-ip 17327 df-tset 17328 df-ple 17329 df-ds 17331 df-unif 17332 df-hom 17333 df-cco 17334 df-rest 17474 df-topn 17475 df-0g 17493 df-gsum 17494 df-topgen 17495 df-pt 17496 df-prds 17499 df-xrs 17555 df-qtop 17560 df-imas 17561 df-qus 17562 df-xps 17563 df-mre 17637 df-mrc 17638 df-acs 17640 df-mgm 18697 df-sgrp 18776 df-mnd 18792 df-mhm 18840 df-submnd 18841 df-grp 19002 df-minusg 19003 df-sbg 19004 df-mulg 19133 df-subg 19188 df-nsg 19189 df-eqg 19190 df-ghm 19283 df-cntz 19386 df-od 19597 df-cmn 19851 df-abl 19852 df-mgp 20216 df-rng 20230 df-ur 20263 df-ring 20316 df-cring 20317 df-oppr 20418 df-dvdsr 20438 df-unit 20439 df-invr 20469 df-dvr 20482 df-rhm 20553 df-subrng 20630 df-subrg 20654 df-drng 20814 df-lmod 20962 df-lss 21032 df-lsp 21072 df-sra 21273 df-rgmod 21274 df-lidl 21311 df-rsp 21312 df-2idl 21368 df-psmet 21493 df-xmet 21494 df-met 21495 df-bl 21496 df-mopn 21497 df-fbas 21498 df-fg 21499 df-cnfld 21502 df-zring 21576 df-zrh 21632 df-zn 21635 df-top 23030 df-topon 23047 df-topsp 23069 df-bases 23082 df-cld 23155 df-ntr 23156 df-cls 23157 df-nei 23234 df-lp 23272 df-perf 23273 df-cn 23363 df-cnp 23364 df-haus 23451 df-tx 23698 df-hmeo 23891 df-fil 23982 df-fm 24074 df-flim 24075 df-flf 24076 df-xms 24456 df-ms 24457 df-tms 24458 df-cncf 25016 df-limc 26004 df-dv 26005 df-log 26697 df-cxp 26698 df-dchr 27373

This theorem is referenced by: dchrisum0flblem2 27649 dchrisum0flb 27650

W3C validator