Theorem mertensabs 11544

Description: Mertens' theorem. If 𝐴(𝑗) is an absolutely convergent series and 𝐵(𝑘) is convergent, then (Σ𝑗 ∈ ℕ₀𝐴(𝑗) · Σ𝑘 ∈ ℕ₀𝐵(𝑘)) = Σ𝑘 ∈ ℕ₀Σ𝑗 ∈ (0...𝑘)(𝐴(𝑗) · 𝐵(𝑘 − 𝑗)) (and this latter series is convergent). This latter sum is commonly known as the Cauchy product of the sequences. The proof follows the outline at http://en.wikipedia.org/wiki/Cauchy_product#Proof_of_Mertens.27_theorem. (Contributed by Mario Carneiro, 29-Apr-2014.) (Revised by Jim Kingdon, 8-Dec-2022.)

Hypotheses

Ref	Expression
mertens.1	⊢ ((𝜑 ∧ 𝑗 ∈ ℕ0) → (𝐹‘𝑗) = 𝐴)
mertens.2	⊢ ((𝜑 ∧ 𝑗 ∈ ℕ0) → (𝐾‘𝑗) = (abs‘𝐴))
mertens.3	⊢ ((𝜑 ∧ 𝑗 ∈ ℕ0) → 𝐴 ∈ ℂ)
mertens.4	⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐺‘𝑘) = 𝐵)
mertens.5	⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → 𝐵 ∈ ℂ)
mertens.6	⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐻‘𝑘) = Σ𝑗 ∈ (0...𝑘)(𝐴 · (𝐺‘(𝑘 − 𝑗))))
mertens.7	⊢ (𝜑 → seq0( + , 𝐾) ∈ dom ⇝ )
mertens.8	⊢ (𝜑 → seq0( + , 𝐺) ∈ dom ⇝ )
mertens.f	⊢ (𝜑 → seq0( + , 𝐹) ∈ dom ⇝ )

Assertion

Ref	Expression
mertensabs	⊢ (𝜑 → seq0( + , 𝐻) ⇝ (Σ𝑗 ∈ ℕ0 𝐴 · Σ𝑘 ∈ ℕ0 𝐵))

Distinct variable groups:   𝐵,𝑗   𝑗,𝑘,𝐺   𝜑,𝑗,𝑘   𝐴,𝑘   𝑗,𝐾,𝑘   𝑗,𝐹   𝑘,𝐻

Allowed substitution hints:   𝐴(𝑗)   𝐵(𝑘)   𝐹(𝑘)   𝐻(𝑗)

Proof of Theorem mertensabs

Dummy variables 𝑚 𝑛 𝑠 𝑥 𝑦 𝑧 𝑖 𝑙 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nn0uz 9561	. 2 ⊢ ℕ0 = (ℤ≥‘0)
2		0zd 9264	. 2 ⊢ (𝜑 → 0 ∈ ℤ)
3		seqex 10446	. . 3 ⊢ seq0( + , 𝐻) ∈ V
4	3	a1i 9	. 2 ⊢ (𝜑 → seq0( + , 𝐻) ∈ V)
5		mertens.6	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐻‘𝑘) = Σ𝑗 ∈ (0...𝑘)(𝐴 · (𝐺‘(𝑘 − 𝑗))))
6		0zd 9264	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → 0 ∈ ℤ)
7		nn0z 9272	. . . . . . . 8 ⊢ (𝑘 ∈ ℕ0 → 𝑘 ∈ ℤ)
8	7	adantl 277	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → 𝑘 ∈ ℤ)
9	6, 8	fzfigd 10430	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (0...𝑘) ∈ Fin)
10		simpl 109	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → 𝜑)
11		elfznn0 10113	. . . . . . . 8 ⊢ (𝑗 ∈ (0...𝑘) → 𝑗 ∈ ℕ0)
12		mertens.3	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ0) → 𝐴 ∈ ℂ)
13	10, 11, 12	syl2an 289	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑘)) → 𝐴 ∈ ℂ)
14		fveq2 5515	. . . . . . . . 9 ⊢ (𝑖 = (𝑘 − 𝑗) → (𝐺‘𝑖) = (𝐺‘(𝑘 − 𝑗)))
15	14	eleq1d 2246	. . . . . . . 8 ⊢ (𝑖 = (𝑘 − 𝑗) → ((𝐺‘𝑖) ∈ ℂ ↔ (𝐺‘(𝑘 − 𝑗)) ∈ ℂ))
16		mertens.4	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐺‘𝑘) = 𝐵)
17		mertens.5	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → 𝐵 ∈ ℂ)
18	16, 17	eqeltrd 2254	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐺‘𝑘) ∈ ℂ)
19	18	ralrimiva 2550	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑘 ∈ ℕ0 (𝐺‘𝑘) ∈ ℂ)
20		fveq2 5515	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝑖 → (𝐺‘𝑘) = (𝐺‘𝑖))
21	20	eleq1d 2246	. . . . . . . . . . 11 ⊢ (𝑘 = 𝑖 → ((𝐺‘𝑘) ∈ ℂ ↔ (𝐺‘𝑖) ∈ ℂ))
22	21	cbvralv 2703	. . . . . . . . . 10 ⊢ (∀𝑘 ∈ ℕ0 (𝐺‘𝑘) ∈ ℂ ↔ ∀𝑖 ∈ ℕ0 (𝐺‘𝑖) ∈ ℂ)
23	19, 22	sylib 122	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑖 ∈ ℕ0 (𝐺‘𝑖) ∈ ℂ)
24	23	ad2antrr 488	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑘)) → ∀𝑖 ∈ ℕ0 (𝐺‘𝑖) ∈ ℂ)
25		fznn0sub 10056	. . . . . . . . 9 ⊢ (𝑗 ∈ (0...𝑘) → (𝑘 − 𝑗) ∈ ℕ0)
26	25	adantl 277	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑘)) → (𝑘 − 𝑗) ∈ ℕ0)
27	15, 24, 26	rspcdva 2846	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑘)) → (𝐺‘(𝑘 − 𝑗)) ∈ ℂ)
28	13, 27	mulcld 7977	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑘)) → (𝐴 · (𝐺‘(𝑘 − 𝑗))) ∈ ℂ)
29	9, 28	fsumcl 11407	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → Σ𝑗 ∈ (0...𝑘)(𝐴 · (𝐺‘(𝑘 − 𝑗))) ∈ ℂ)
30	5, 29	eqeltrd 2254	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐻‘𝑘) ∈ ℂ)
31	1, 2, 30	serf 10473	. . 3 ⊢ (𝜑 → seq0( + , 𝐻):ℕ0⟶ℂ)
32	31	ffvelcdmda 5651	. 2 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → (seq0( + , 𝐻)‘𝑚) ∈ ℂ)
33		mertens.1	. . . . . 6 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ0) → (𝐹‘𝑗) = 𝐴)
34	33	adantlr 477	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ 𝑗 ∈ ℕ0) → (𝐹‘𝑗) = 𝐴)
35		mertens.2	. . . . . 6 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ0) → (𝐾‘𝑗) = (abs‘𝐴))
36	35	adantlr 477	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ 𝑗 ∈ ℕ0) → (𝐾‘𝑗) = (abs‘𝐴))
37	12	adantlr 477	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ 𝑗 ∈ ℕ0) → 𝐴 ∈ ℂ)
38	16	adantlr 477	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ 𝑘 ∈ ℕ0) → (𝐺‘𝑘) = 𝐵)
39	17	adantlr 477	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ 𝑘 ∈ ℕ0) → 𝐵 ∈ ℂ)
40	5	adantlr 477	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ 𝑘 ∈ ℕ0) → (𝐻‘𝑘) = Σ𝑗 ∈ (0...𝑘)(𝐴 · (𝐺‘(𝑘 − 𝑗))))
41		mertens.7	. . . . . 6 ⊢ (𝜑 → seq0( + , 𝐾) ∈ dom ⇝ )
42	41	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ+) → seq0( + , 𝐾) ∈ dom ⇝ )
43		mertens.8	. . . . . 6 ⊢ (𝜑 → seq0( + , 𝐺) ∈ dom ⇝ )
44	43	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ+) → seq0( + , 𝐺) ∈ dom ⇝ )
45		simpr 110	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ+) → 𝑥 ∈ ℝ+)
46		fveq2 5515	. . . . . . . . . . . 12 ⊢ (𝑙 = 𝑘 → (𝐺‘𝑙) = (𝐺‘𝑘))
47	46	cbvsumv 11368	. . . . . . . . . . 11 ⊢ Σ𝑙 ∈ (ℤ≥‘(𝑖 + 1))(𝐺‘𝑙) = Σ𝑘 ∈ (ℤ≥‘(𝑖 + 1))(𝐺‘𝑘)
48		fvoveq1 5897	. . . . . . . . . . . 12 ⊢ (𝑖 = 𝑛 → (ℤ≥‘(𝑖 + 1)) = (ℤ≥‘(𝑛 + 1)))
49	48	sumeq1d 11373	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑛 → Σ𝑘 ∈ (ℤ≥‘(𝑖 + 1))(𝐺‘𝑘) = Σ𝑘 ∈ (ℤ≥‘(𝑛 + 1))(𝐺‘𝑘))
50	47, 49	eqtrid 2222	. . . . . . . . . 10 ⊢ (𝑖 = 𝑛 → Σ𝑙 ∈ (ℤ≥‘(𝑖 + 1))(𝐺‘𝑙) = Σ𝑘 ∈ (ℤ≥‘(𝑛 + 1))(𝐺‘𝑘))
51	50	fveq2d 5519	. . . . . . . . 9 ⊢ (𝑖 = 𝑛 → (abs‘Σ𝑙 ∈ (ℤ≥‘(𝑖 + 1))(𝐺‘𝑙)) = (abs‘Σ𝑘 ∈ (ℤ≥‘(𝑛 + 1))(𝐺‘𝑘)))
52	51	eqeq2d 2189	. . . . . . . 8 ⊢ (𝑖 = 𝑛 → (𝑢 = (abs‘Σ𝑙 ∈ (ℤ≥‘(𝑖 + 1))(𝐺‘𝑙)) ↔ 𝑢 = (abs‘Σ𝑘 ∈ (ℤ≥‘(𝑛 + 1))(𝐺‘𝑘))))
53	52	cbvrexv 2704	. . . . . . 7 ⊢ (∃𝑖 ∈ (0...(𝑠 − 1))𝑢 = (abs‘Σ𝑙 ∈ (ℤ≥‘(𝑖 + 1))(𝐺‘𝑙)) ↔ ∃𝑛 ∈ (0...(𝑠 − 1))𝑢 = (abs‘Σ𝑘 ∈ (ℤ≥‘(𝑛 + 1))(𝐺‘𝑘)))
54		eqeq1 2184	. . . . . . . 8 ⊢ (𝑢 = 𝑧 → (𝑢 = (abs‘Σ𝑘 ∈ (ℤ≥‘(𝑛 + 1))(𝐺‘𝑘)) ↔ 𝑧 = (abs‘Σ𝑘 ∈ (ℤ≥‘(𝑛 + 1))(𝐺‘𝑘))))
55	54	rexbidv 2478	. . . . . . 7 ⊢ (𝑢 = 𝑧 → (∃𝑛 ∈ (0...(𝑠 − 1))𝑢 = (abs‘Σ𝑘 ∈ (ℤ≥‘(𝑛 + 1))(𝐺‘𝑘)) ↔ ∃𝑛 ∈ (0...(𝑠 − 1))𝑧 = (abs‘Σ𝑘 ∈ (ℤ≥‘(𝑛 + 1))(𝐺‘𝑘))))
56	53, 55	bitrid 192	. . . . . 6 ⊢ (𝑢 = 𝑧 → (∃𝑖 ∈ (0...(𝑠 − 1))𝑢 = (abs‘Σ𝑙 ∈ (ℤ≥‘(𝑖 + 1))(𝐺‘𝑙)) ↔ ∃𝑛 ∈ (0...(𝑠 − 1))𝑧 = (abs‘Σ𝑘 ∈ (ℤ≥‘(𝑛 + 1))(𝐺‘𝑘))))
57	56	cbvabv 2302	. . . . 5 ⊢ {𝑢 ∣ ∃𝑖 ∈ (0...(𝑠 − 1))𝑢 = (abs‘Σ𝑙 ∈ (ℤ≥‘(𝑖 + 1))(𝐺‘𝑙))} = {𝑧 ∣ ∃𝑛 ∈ (0...(𝑠 − 1))𝑧 = (abs‘Σ𝑘 ∈ (ℤ≥‘(𝑛 + 1))(𝐺‘𝑘))}
58		fveq2 5515	. . . . . . . . . . . 12 ⊢ (𝑖 = 𝑗 → (𝐾‘𝑖) = (𝐾‘𝑗))
59	58	cbvsumv 11368	. . . . . . . . . . 11 ⊢ Σ𝑖 ∈ ℕ0 (𝐾‘𝑖) = Σ𝑗 ∈ ℕ0 (𝐾‘𝑗)
60	59	oveq1i 5884	. . . . . . . . . 10 ⊢ (Σ𝑖 ∈ ℕ0 (𝐾‘𝑖) + 1) = (Σ𝑗 ∈ ℕ0 (𝐾‘𝑗) + 1)
61	60	oveq2i 5885	. . . . . . . . 9 ⊢ ((𝑥 / 2) / (Σ𝑖 ∈ ℕ0 (𝐾‘𝑖) + 1)) = ((𝑥 / 2) / (Σ𝑗 ∈ ℕ0 (𝐾‘𝑗) + 1))
62	61	breq2i 4011	. . . . . . . 8 ⊢ ((abs‘Σ𝑖 ∈ (ℤ≥‘(𝑢 + 1))(𝐺‘𝑖)) < ((𝑥 / 2) / (Σ𝑖 ∈ ℕ0 (𝐾‘𝑖) + 1)) ↔ (abs‘Σ𝑖 ∈ (ℤ≥‘(𝑢 + 1))(𝐺‘𝑖)) < ((𝑥 / 2) / (Σ𝑗 ∈ ℕ0 (𝐾‘𝑗) + 1)))
63		fveq2 5515	. . . . . . . . . . . 12 ⊢ (𝑖 = 𝑘 → (𝐺‘𝑖) = (𝐺‘𝑘))
64	63	cbvsumv 11368	. . . . . . . . . . 11 ⊢ Σ𝑖 ∈ (ℤ≥‘(𝑢 + 1))(𝐺‘𝑖) = Σ𝑘 ∈ (ℤ≥‘(𝑢 + 1))(𝐺‘𝑘)
65		fvoveq1 5897	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑛 → (ℤ≥‘(𝑢 + 1)) = (ℤ≥‘(𝑛 + 1)))
66	65	sumeq1d 11373	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑛 → Σ𝑘 ∈ (ℤ≥‘(𝑢 + 1))(𝐺‘𝑘) = Σ𝑘 ∈ (ℤ≥‘(𝑛 + 1))(𝐺‘𝑘))
67	64, 66	eqtrid 2222	. . . . . . . . . 10 ⊢ (𝑢 = 𝑛 → Σ𝑖 ∈ (ℤ≥‘(𝑢 + 1))(𝐺‘𝑖) = Σ𝑘 ∈ (ℤ≥‘(𝑛 + 1))(𝐺‘𝑘))
68	67	fveq2d 5519	. . . . . . . . 9 ⊢ (𝑢 = 𝑛 → (abs‘Σ𝑖 ∈ (ℤ≥‘(𝑢 + 1))(𝐺‘𝑖)) = (abs‘Σ𝑘 ∈ (ℤ≥‘(𝑛 + 1))(𝐺‘𝑘)))
69	68	breq1d 4013	. . . . . . . 8 ⊢ (𝑢 = 𝑛 → ((abs‘Σ𝑖 ∈ (ℤ≥‘(𝑢 + 1))(𝐺‘𝑖)) < ((𝑥 / 2) / (Σ𝑗 ∈ ℕ0 (𝐾‘𝑗) + 1)) ↔ (abs‘Σ𝑘 ∈ (ℤ≥‘(𝑛 + 1))(𝐺‘𝑘)) < ((𝑥 / 2) / (Σ𝑗 ∈ ℕ0 (𝐾‘𝑗) + 1))))
70	62, 69	bitrid 192	. . . . . . 7 ⊢ (𝑢 = 𝑛 → ((abs‘Σ𝑖 ∈ (ℤ≥‘(𝑢 + 1))(𝐺‘𝑖)) < ((𝑥 / 2) / (Σ𝑖 ∈ ℕ0 (𝐾‘𝑖) + 1)) ↔ (abs‘Σ𝑘 ∈ (ℤ≥‘(𝑛 + 1))(𝐺‘𝑘)) < ((𝑥 / 2) / (Σ𝑗 ∈ ℕ0 (𝐾‘𝑗) + 1))))
71	70	cbvralv 2703	. . . . . 6 ⊢ (∀𝑢 ∈ (ℤ≥‘𝑠)(abs‘Σ𝑖 ∈ (ℤ≥‘(𝑢 + 1))(𝐺‘𝑖)) < ((𝑥 / 2) / (Σ𝑖 ∈ ℕ0 (𝐾‘𝑖) + 1)) ↔ ∀𝑛 ∈ (ℤ≥‘𝑠)(abs‘Σ𝑘 ∈ (ℤ≥‘(𝑛 + 1))(𝐺‘𝑘)) < ((𝑥 / 2) / (Σ𝑗 ∈ ℕ0 (𝐾‘𝑗) + 1)))
72	71	anbi2i 457	. . . . 5 ⊢ ((𝑠 ∈ ℕ ∧ ∀𝑢 ∈ (ℤ≥‘𝑠)(abs‘Σ𝑖 ∈ (ℤ≥‘(𝑢 + 1))(𝐺‘𝑖)) < ((𝑥 / 2) / (Σ𝑖 ∈ ℕ0 (𝐾‘𝑖) + 1))) ↔ (𝑠 ∈ ℕ ∧ ∀𝑛 ∈ (ℤ≥‘𝑠)(abs‘Σ𝑘 ∈ (ℤ≥‘(𝑛 + 1))(𝐺‘𝑘)) < ((𝑥 / 2) / (Σ𝑗 ∈ ℕ0 (𝐾‘𝑗) + 1))))
73	34, 36, 37, 38, 39, 40, 42, 44, 45, 57, 72	mertenslem2 11543	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ+) → ∃𝑦 ∈ ℕ0 ∀𝑚 ∈ (ℤ≥‘𝑦)(abs‘Σ𝑗 ∈ (0...𝑚)(𝐴 · Σ𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))𝐵)) < 𝑥)
74		eluznn0 9598	. . . . . . . . 9 ⊢ ((𝑦 ∈ ℕ0 ∧ 𝑚 ∈ (ℤ≥‘𝑦)) → 𝑚 ∈ ℕ0)
75		0zd 9264	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → 0 ∈ ℤ)
76		nn0z 9272	. . . . . . . . . . . . . . 15 ⊢ (𝑚 ∈ ℕ0 → 𝑚 ∈ ℤ)
77	76	adantl 277	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → 𝑚 ∈ ℤ)
78	75, 77	fzfigd 10430	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → (0...𝑚) ∈ Fin)
79		simpll 527	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → 𝜑)
80		elfznn0 10113	. . . . . . . . . . . . . . 15 ⊢ (𝑗 ∈ (0...𝑚) → 𝑗 ∈ ℕ0)
81	80	adantl 277	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → 𝑗 ∈ ℕ0)
82	1, 2, 16, 17, 43	isumcl 11432	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → Σ𝑘 ∈ ℕ0 𝐵 ∈ ℂ)
83	82	adantr 276	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ0) → Σ𝑘 ∈ ℕ0 𝐵 ∈ ℂ)
84	33, 12	eqeltrd 2254	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ0) → (𝐹‘𝑗) ∈ ℂ)
85	83, 84	mulcld 7977	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ0) → (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑗)) ∈ ℂ)
86	79, 81, 85	syl2anc 411	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑗)) ∈ ℂ)
87		0zd 9264	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → 0 ∈ ℤ)
88	77	adantr 276	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → 𝑚 ∈ ℤ)
89	81	nn0zd 9372	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → 𝑗 ∈ ℤ)
90	88, 89	zsubcld 9379	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → (𝑚 − 𝑗) ∈ ℤ)
91	87, 90	fzfigd 10430	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → (0...(𝑚 − 𝑗)) ∈ Fin)
92		simplll 533	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) ∧ 𝑘 ∈ (0...(𝑚 − 𝑗))) → 𝜑)
93	80	ad2antlr 489	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) ∧ 𝑘 ∈ (0...(𝑚 − 𝑗))) → 𝑗 ∈ ℕ0)
94	92, 93, 12	syl2anc 411	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) ∧ 𝑘 ∈ (0...(𝑚 − 𝑗))) → 𝐴 ∈ ℂ)
95		elfznn0 10113	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ (0...(𝑚 − 𝑗)) → 𝑘 ∈ ℕ0)
96	95	adantl 277	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) ∧ 𝑘 ∈ (0...(𝑚 − 𝑗))) → 𝑘 ∈ ℕ0)
97	92, 96, 18	syl2anc 411	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) ∧ 𝑘 ∈ (0...(𝑚 − 𝑗))) → (𝐺‘𝑘) ∈ ℂ)
98	94, 97	mulcld 7977	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) ∧ 𝑘 ∈ (0...(𝑚 − 𝑗))) → (𝐴 · (𝐺‘𝑘)) ∈ ℂ)
99	91, 98	fsumcl 11407	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐴 · (𝐺‘𝑘)) ∈ ℂ)
100	78, 86, 99	fsumsub 11459	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → Σ𝑗 ∈ (0...𝑚)((Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑗)) − Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐴 · (𝐺‘𝑘))) = (Σ𝑗 ∈ (0...𝑚)(Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑗)) − Σ𝑗 ∈ (0...𝑚)Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐴 · (𝐺‘𝑘))))
101	79, 81, 12	syl2anc 411	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → 𝐴 ∈ ℂ)
102	82	ad2antrr 488	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → Σ𝑘 ∈ ℕ0 𝐵 ∈ ℂ)
103	91, 97	fsumcl 11407	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐺‘𝑘) ∈ ℂ)
104	101, 102, 103	subdid 8370	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → (𝐴 · (Σ𝑘 ∈ ℕ0 𝐵 − Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐺‘𝑘))) = ((𝐴 · Σ𝑘 ∈ ℕ0 𝐵) − (𝐴 · Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐺‘𝑘))))
105		eqid 2177	. . . . . . . . . . . . . . . . . . 19 ⊢ (ℤ≥‘((𝑚 − 𝑗) + 1)) = (ℤ≥‘((𝑚 − 𝑗) + 1))
106		fznn0sub 10056	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑗 ∈ (0...𝑚) → (𝑚 − 𝑗) ∈ ℕ0)
107	106	adantl 277	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → (𝑚 − 𝑗) ∈ ℕ0)
108		peano2nn0 9215	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑚 − 𝑗) ∈ ℕ0 → ((𝑚 − 𝑗) + 1) ∈ ℕ0)
109	107, 108	syl 14	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → ((𝑚 − 𝑗) + 1) ∈ ℕ0)
110	79, 16	sylan 283	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) ∧ 𝑘 ∈ ℕ0) → (𝐺‘𝑘) = 𝐵)
111	79, 17	sylan 283	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) ∧ 𝑘 ∈ ℕ0) → 𝐵 ∈ ℂ)
112	43	ad2antrr 488	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → seq0( + , 𝐺) ∈ dom ⇝ )
113	1, 105, 109, 110, 111, 112	isumsplit 11498	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → Σ𝑘 ∈ ℕ0 𝐵 = (Σ𝑘 ∈ (0...(((𝑚 − 𝑗) + 1) − 1))𝐵 + Σ𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))𝐵))
114	107	nn0cnd 9230	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → (𝑚 − 𝑗) ∈ ℂ)
115		ax-1cn 7903	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ 1 ∈ ℂ
116		pncan 8162	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑚 − 𝑗) ∈ ℂ ∧ 1 ∈ ℂ) → (((𝑚 − 𝑗) + 1) − 1) = (𝑚 − 𝑗))
117	114, 115, 116	sylancl 413	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → (((𝑚 − 𝑗) + 1) − 1) = (𝑚 − 𝑗))
118	117	oveq2d 5890	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → (0...(((𝑚 − 𝑗) + 1) − 1)) = (0...(𝑚 − 𝑗)))
119	118	sumeq1d 11373	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → Σ𝑘 ∈ (0...(((𝑚 − 𝑗) + 1) − 1))𝐵 = Σ𝑘 ∈ (0...(𝑚 − 𝑗))𝐵)
120	92, 96, 16	syl2anc 411	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) ∧ 𝑘 ∈ (0...(𝑚 − 𝑗))) → (𝐺‘𝑘) = 𝐵)
121	120	sumeq2dv 11375	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐺‘𝑘) = Σ𝑘 ∈ (0...(𝑚 − 𝑗))𝐵)
122	119, 121	eqtr4d 2213	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → Σ𝑘 ∈ (0...(((𝑚 − 𝑗) + 1) − 1))𝐵 = Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐺‘𝑘))
123	122	oveq1d 5889	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → (Σ𝑘 ∈ (0...(((𝑚 − 𝑗) + 1) − 1))𝐵 + Σ𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))𝐵) = (Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐺‘𝑘) + Σ𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))𝐵))
124	113, 123	eqtrd 2210	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → Σ𝑘 ∈ ℕ0 𝐵 = (Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐺‘𝑘) + Σ𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))𝐵))
125	124	oveq1d 5889	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → (Σ𝑘 ∈ ℕ0 𝐵 − Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐺‘𝑘)) = ((Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐺‘𝑘) + Σ𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))𝐵) − Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐺‘𝑘)))
126	109	nn0zd 9372	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → ((𝑚 − 𝑗) + 1) ∈ ℤ)
127		simplll 533	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) ∧ 𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))) → 𝜑)
128		eluznn0 9598	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝑚 − 𝑗) + 1) ∈ ℕ0 ∧ 𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))) → 𝑘 ∈ ℕ0)
129	109, 128	sylan 283	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) ∧ 𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))) → 𝑘 ∈ ℕ0)
130	127, 129, 16	syl2anc 411	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) ∧ 𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))) → (𝐺‘𝑘) = 𝐵)
131	127, 129, 17	syl2anc 411	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) ∧ 𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))) → 𝐵 ∈ ℂ)
132	110, 111	eqeltrd 2254	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) ∧ 𝑘 ∈ ℕ0) → (𝐺‘𝑘) ∈ ℂ)
133	1, 109, 132	iserex 11346	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → (seq0( + , 𝐺) ∈ dom ⇝ ↔ seq((𝑚 − 𝑗) + 1)( + , 𝐺) ∈ dom ⇝ ))
134	112, 133	mpbid 147	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → seq((𝑚 − 𝑗) + 1)( + , 𝐺) ∈ dom ⇝ )
135	105, 126, 130, 131, 134	isumcl 11432	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → Σ𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))𝐵 ∈ ℂ)
136	103, 135	pncan2d 8269	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → ((Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐺‘𝑘) + Σ𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))𝐵) − Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐺‘𝑘)) = Σ𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))𝐵)
137	125, 136	eqtrd 2210	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → (Σ𝑘 ∈ ℕ0 𝐵 − Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐺‘𝑘)) = Σ𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))𝐵)
138	137	oveq2d 5890	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → (𝐴 · (Σ𝑘 ∈ ℕ0 𝐵 − Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐺‘𝑘))) = (𝐴 · Σ𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))𝐵))
139	12, 83	mulcomd 7978	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ0) → (𝐴 · Σ𝑘 ∈ ℕ0 𝐵) = (Σ𝑘 ∈ ℕ0 𝐵 · 𝐴))
140	33	oveq2d 5890	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ0) → (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑗)) = (Σ𝑘 ∈ ℕ0 𝐵 · 𝐴))
141	139, 140	eqtr4d 2213	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ0) → (𝐴 · Σ𝑘 ∈ ℕ0 𝐵) = (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑗)))
142	79, 81, 141	syl2anc 411	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → (𝐴 · Σ𝑘 ∈ ℕ0 𝐵) = (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑗)))
143	91, 101, 97	fsummulc2 11455	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → (𝐴 · Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐺‘𝑘)) = Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐴 · (𝐺‘𝑘)))
144	142, 143	oveq12d 5892	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → ((𝐴 · Σ𝑘 ∈ ℕ0 𝐵) − (𝐴 · Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐺‘𝑘))) = ((Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑗)) − Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐴 · (𝐺‘𝑘))))
145	104, 138, 144	3eqtr3rd 2219	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑚)) → ((Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑗)) − Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐴 · (𝐺‘𝑘))) = (𝐴 · Σ𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))𝐵))
146	145	sumeq2dv 11375	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → Σ𝑗 ∈ (0...𝑚)((Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑗)) − Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐴 · (𝐺‘𝑘))) = Σ𝑗 ∈ (0...𝑚)(𝐴 · Σ𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))𝐵))
147		elnn0uz 9564	. . . . . . . . . . . . . . . 16 ⊢ (𝑗 ∈ ℕ0 ↔ 𝑗 ∈ (ℤ≥‘0))
148	147	biimpri 133	. . . . . . . . . . . . . . 15 ⊢ (𝑗 ∈ (ℤ≥‘0) → 𝑗 ∈ ℕ0)
149	82	ad2antrr 488	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (ℤ≥‘0)) → Σ𝑘 ∈ ℕ0 𝐵 ∈ ℂ)
150	148, 84	sylan2 286	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘0)) → (𝐹‘𝑗) ∈ ℂ)
151	150	adantlr 477	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (ℤ≥‘0)) → (𝐹‘𝑗) ∈ ℂ)
152	149, 151	mulcld 7977	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (ℤ≥‘0)) → (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑗)) ∈ ℂ)
153		fveq2 5515	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 = 𝑗 → (𝐹‘𝑛) = (𝐹‘𝑗))
154	153	oveq2d 5890	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 𝑗 → (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑛)) = (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑗)))
155		eqid 2177	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ ℕ0 ↦ (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑛))) = (𝑛 ∈ ℕ0 ↦ (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑛)))
156	154, 155	fvmptg 5592	. . . . . . . . . . . . . . 15 ⊢ ((𝑗 ∈ ℕ0 ∧ (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑗)) ∈ ℂ) → ((𝑛 ∈ ℕ0 ↦ (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑛)))‘𝑗) = (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑗)))
157	148, 152, 156	syl2an2 594	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑗 ∈ (ℤ≥‘0)) → ((𝑛 ∈ ℕ0 ↦ (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑛)))‘𝑗) = (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑗)))
158		simpr 110	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → 𝑚 ∈ ℕ0)
159	158, 1	eleqtrdi 2270	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → 𝑚 ∈ (ℤ≥‘0))
160	157, 159, 152	fsum3ser 11404	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → Σ𝑗 ∈ (0...𝑚)(Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑗)) = (seq0( + , (𝑛 ∈ ℕ0 ↦ (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑛))))‘𝑚))
161		fveq2 5515	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 𝑘 → (𝐺‘𝑛) = (𝐺‘𝑘))
162	161	oveq2d 5890	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = 𝑘 → (𝐴 · (𝐺‘𝑛)) = (𝐴 · (𝐺‘𝑘)))
163		fveq2 5515	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = (𝑘 − 𝑗) → (𝐺‘𝑛) = (𝐺‘(𝑘 − 𝑗)))
164	163	oveq2d 5890	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = (𝑘 − 𝑗) → (𝐴 · (𝐺‘𝑛)) = (𝐴 · (𝐺‘(𝑘 − 𝑗))))
165	98	anasss 399	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑗 ∈ (0...𝑚) ∧ 𝑘 ∈ (0...(𝑚 − 𝑗)))) → (𝐴 · (𝐺‘𝑘)) ∈ ℂ)
166	162, 164, 165, 77	fisum0diag2 11454	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → Σ𝑗 ∈ (0...𝑚)Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐴 · (𝐺‘𝑘)) = Σ𝑘 ∈ (0...𝑚)Σ𝑗 ∈ (0...𝑘)(𝐴 · (𝐺‘(𝑘 − 𝑗))))
167		simpll 527	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑘 ∈ (ℤ≥‘0)) → 𝜑)
168		elnn0uz 9564	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ ℕ0 ↔ 𝑘 ∈ (ℤ≥‘0))
169	168	biimpri 133	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ (ℤ≥‘0) → 𝑘 ∈ ℕ0)
170	169	adantl 277	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑘 ∈ (ℤ≥‘0)) → 𝑘 ∈ ℕ0)
171	167, 170, 5	syl2anc 411	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑘 ∈ (ℤ≥‘0)) → (𝐻‘𝑘) = Σ𝑗 ∈ (0...𝑘)(𝐴 · (𝐺‘(𝑘 − 𝑗))))
172	167, 170, 29	syl2anc 411	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ 𝑘 ∈ (ℤ≥‘0)) → Σ𝑗 ∈ (0...𝑘)(𝐴 · (𝐺‘(𝑘 − 𝑗))) ∈ ℂ)
173	171, 159, 172	fsum3ser 11404	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → Σ𝑘 ∈ (0...𝑚)Σ𝑗 ∈ (0...𝑘)(𝐴 · (𝐺‘(𝑘 − 𝑗))) = (seq0( + , 𝐻)‘𝑚))
174	166, 173	eqtrd 2210	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → Σ𝑗 ∈ (0...𝑚)Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐴 · (𝐺‘𝑘)) = (seq0( + , 𝐻)‘𝑚))
175	160, 174	oveq12d 5892	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → (Σ𝑗 ∈ (0...𝑚)(Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑗)) − Σ𝑗 ∈ (0...𝑚)Σ𝑘 ∈ (0...(𝑚 − 𝑗))(𝐴 · (𝐺‘𝑘))) = ((seq0( + , (𝑛 ∈ ℕ0 ↦ (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑛))))‘𝑚) − (seq0( + , 𝐻)‘𝑚)))
176	100, 146, 175	3eqtr3rd 2219	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → ((seq0( + , (𝑛 ∈ ℕ0 ↦ (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑛))))‘𝑚) − (seq0( + , 𝐻)‘𝑚)) = Σ𝑗 ∈ (0...𝑚)(𝐴 · Σ𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))𝐵))
177	176	fveq2d 5519	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → (abs‘((seq0( + , (𝑛 ∈ ℕ0 ↦ (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑛))))‘𝑚) − (seq0( + , 𝐻)‘𝑚))) = (abs‘Σ𝑗 ∈ (0...𝑚)(𝐴 · Σ𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))𝐵)))
178	177	breq1d 4013	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → ((abs‘((seq0( + , (𝑛 ∈ ℕ0 ↦ (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑛))))‘𝑚) − (seq0( + , 𝐻)‘𝑚))) < 𝑥 ↔ (abs‘Σ𝑗 ∈ (0...𝑚)(𝐴 · Σ𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))𝐵)) < 𝑥))
179	74, 178	sylan2 286	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ ℕ0 ∧ 𝑚 ∈ (ℤ≥‘𝑦))) → ((abs‘((seq0( + , (𝑛 ∈ ℕ0 ↦ (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑛))))‘𝑚) − (seq0( + , 𝐻)‘𝑚))) < 𝑥 ↔ (abs‘Σ𝑗 ∈ (0...𝑚)(𝐴 · Σ𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))𝐵)) < 𝑥))
180	179	anassrs 400	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℕ0) ∧ 𝑚 ∈ (ℤ≥‘𝑦)) → ((abs‘((seq0( + , (𝑛 ∈ ℕ0 ↦ (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑛))))‘𝑚) − (seq0( + , 𝐻)‘𝑚))) < 𝑥 ↔ (abs‘Σ𝑗 ∈ (0...𝑚)(𝐴 · Σ𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))𝐵)) < 𝑥))
181	180	ralbidva 2473	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → (∀𝑚 ∈ (ℤ≥‘𝑦)(abs‘((seq0( + , (𝑛 ∈ ℕ0 ↦ (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑛))))‘𝑚) − (seq0( + , 𝐻)‘𝑚))) < 𝑥 ↔ ∀𝑚 ∈ (ℤ≥‘𝑦)(abs‘Σ𝑗 ∈ (0...𝑚)(𝐴 · Σ𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))𝐵)) < 𝑥))
182	181	rexbidva 2474	. . . . 5 ⊢ (𝜑 → (∃𝑦 ∈ ℕ0 ∀𝑚 ∈ (ℤ≥‘𝑦)(abs‘((seq0( + , (𝑛 ∈ ℕ0 ↦ (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑛))))‘𝑚) − (seq0( + , 𝐻)‘𝑚))) < 𝑥 ↔ ∃𝑦 ∈ ℕ0 ∀𝑚 ∈ (ℤ≥‘𝑦)(abs‘Σ𝑗 ∈ (0...𝑚)(𝐴 · Σ𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))𝐵)) < 𝑥))
183	182	adantr 276	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ+) → (∃𝑦 ∈ ℕ0 ∀𝑚 ∈ (ℤ≥‘𝑦)(abs‘((seq0( + , (𝑛 ∈ ℕ0 ↦ (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑛))))‘𝑚) − (seq0( + , 𝐻)‘𝑚))) < 𝑥 ↔ ∃𝑦 ∈ ℕ0 ∀𝑚 ∈ (ℤ≥‘𝑦)(abs‘Σ𝑗 ∈ (0...𝑚)(𝐴 · Σ𝑘 ∈ (ℤ≥‘((𝑚 − 𝑗) + 1))𝐵)) < 𝑥))
184	73, 183	mpbird 167	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ+) → ∃𝑦 ∈ ℕ0 ∀𝑚 ∈ (ℤ≥‘𝑦)(abs‘((seq0( + , (𝑛 ∈ ℕ0 ↦ (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑛))))‘𝑚) − (seq0( + , 𝐻)‘𝑚))) < 𝑥)
185	184	ralrimiva 2550	. 2 ⊢ (𝜑 → ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ0 ∀𝑚 ∈ (ℤ≥‘𝑦)(abs‘((seq0( + , (𝑛 ∈ ℕ0 ↦ (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑛))))‘𝑚) − (seq0( + , 𝐻)‘𝑚))) < 𝑥)
186		mertens.f	. . . . 5 ⊢ (𝜑 → seq0( + , 𝐹) ∈ dom ⇝ )
187	1, 2, 33, 12, 186	isumclim2 11429	. . . 4 ⊢ (𝜑 → seq0( + , 𝐹) ⇝ Σ𝑗 ∈ ℕ0 𝐴)
188	84	ralrimiva 2550	. . . . 5 ⊢ (𝜑 → ∀𝑗 ∈ ℕ0 (𝐹‘𝑗) ∈ ℂ)
189		fveq2 5515	. . . . . . 7 ⊢ (𝑗 = 𝑚 → (𝐹‘𝑗) = (𝐹‘𝑚))
190	189	eleq1d 2246	. . . . . 6 ⊢ (𝑗 = 𝑚 → ((𝐹‘𝑗) ∈ ℂ ↔ (𝐹‘𝑚) ∈ ℂ))
191	190	rspccva 2840	. . . . 5 ⊢ ((∀𝑗 ∈ ℕ0 (𝐹‘𝑗) ∈ ℂ ∧ 𝑚 ∈ ℕ0) → (𝐹‘𝑚) ∈ ℂ)
192	188, 191	sylan 283	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → (𝐹‘𝑚) ∈ ℂ)
193	82	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → Σ𝑘 ∈ ℕ0 𝐵 ∈ ℂ)
194	193, 192	mulcld 7977	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑚)) ∈ ℂ)
195		fveq2 5515	. . . . . . 7 ⊢ (𝑛 = 𝑚 → (𝐹‘𝑛) = (𝐹‘𝑚))
196	195	oveq2d 5890	. . . . . 6 ⊢ (𝑛 = 𝑚 → (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑛)) = (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑚)))
197	196, 155	fvmptg 5592	. . . . 5 ⊢ ((𝑚 ∈ ℕ0 ∧ (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑚)) ∈ ℂ) → ((𝑛 ∈ ℕ0 ↦ (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑛)))‘𝑚) = (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑚)))
198	158, 194, 197	syl2anc 411	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → ((𝑛 ∈ ℕ0 ↦ (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑛)))‘𝑚) = (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑚)))
199	1, 2, 82, 187, 192, 198	isermulc2 11347	. . 3 ⊢ (𝜑 → seq0( + , (𝑛 ∈ ℕ0 ↦ (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑛)))) ⇝ (Σ𝑘 ∈ ℕ0 𝐵 · Σ𝑗 ∈ ℕ0 𝐴))
200	1, 2, 33, 12, 186	isumcl 11432	. . . 4 ⊢ (𝜑 → Σ𝑗 ∈ ℕ0 𝐴 ∈ ℂ)
201	82, 200	mulcomd 7978	. . 3 ⊢ (𝜑 → (Σ𝑘 ∈ ℕ0 𝐵 · Σ𝑗 ∈ ℕ0 𝐴) = (Σ𝑗 ∈ ℕ0 𝐴 · Σ𝑘 ∈ ℕ0 𝐵))
202	199, 201	breqtrd 4029	. 2 ⊢ (𝜑 → seq0( + , (𝑛 ∈ ℕ0 ↦ (Σ𝑘 ∈ ℕ0 𝐵 · (𝐹‘𝑛)))) ⇝ (Σ𝑗 ∈ ℕ0 𝐴 · Σ𝑘 ∈ ℕ0 𝐵))
203	1, 2, 4, 32, 185, 202	2clim 11308	1 ⊢ (𝜑 → seq0( + , 𝐻) ⇝ (Σ𝑗 ∈ ℕ0 𝐴 · Σ𝑘 ∈ ℕ0 𝐵))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1353   ∈ wcel 2148  {cab 2163  ∀wral 2455  ∃wrex 2456  Vcvv 2737   class class class wbr 4003   ↦ cmpt 4064  dom cdm 4626  ‘cfv 5216  (class class class)co 5874  ℂcc 7808  0cc0 7810  1c1 7811   + caddc 7813   · cmul 7815   < clt 7991   − cmin 8127   / cdiv 8628  ℕcn 8918  2c2 8969  ℕ₀cn0 9175  ℤcz 9252  ℤ_≥cuz 9527  ℝ⁺crp 9652  ...cfz 10007  seqcseq 10444  abscabs 11005   ⇝ cli 11285  Σcsu 11360

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4118  ax-sep 4121  ax-nul 4129  ax-pow 4174  ax-pr 4209  ax-un 4433  ax-setind 4536  ax-iinf 4587  ax-cnex 7901  ax-resscn 7902  ax-1cn 7903  ax-1re 7904  ax-icn 7905  ax-addcl 7906  ax-addrcl 7907  ax-mulcl 7908  ax-mulrcl 7909  ax-addcom 7910  ax-mulcom 7911  ax-addass 7912  ax-mulass 7913  ax-distr 7914  ax-i2m1 7915  ax-0lt1 7916  ax-1rid 7917  ax-0id 7918  ax-rnegex 7919  ax-precex 7920  ax-cnre 7921  ax-pre-ltirr 7922  ax-pre-ltwlin 7923  ax-pre-lttrn 7924  ax-pre-apti 7925  ax-pre-ltadd 7926  ax-pre-mulgt0 7927  ax-pre-mulext 7928  ax-arch 7929  ax-caucvg 7930

This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-if 3535  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-int 3845  df-iun 3888  df-disj 3981  df-br 4004  df-opab 4065  df-mpt 4066  df-tr 4102  df-id 4293  df-po 4296  df-iso 4297  df-iord 4366  df-on 4368  df-ilim 4369  df-suc 4371  df-iom 4590  df-xp 4632  df-rel 4633  df-cnv 4634  df-co 4635  df-dm 4636  df-rn 4637  df-res 4638  df-ima 4639  df-iota 5178  df-fun 5218  df-fn 5219  df-f 5220  df-f1 5221  df-fo 5222  df-f1o 5223  df-fv 5224  df-isom 5225  df-riota 5830  df-ov 5877  df-oprab 5878  df-mpo 5879  df-1st 6140  df-2nd 6141  df-recs 6305  df-irdg 6370  df-frec 6391  df-1o 6416  df-oadd 6420  df-er 6534  df-en 6740  df-dom 6741  df-fin 6742  df-sup 6982  df-pnf 7993  df-mnf 7994  df-xr 7995  df-ltxr 7996  df-le 7997  df-sub 8129  df-neg 8130  df-reap 8531  df-ap 8538  df-div 8629  df-inn 8919  df-2 8977  df-3 8978  df-4 8979  df-n0 9176  df-z 9253  df-uz 9528  df-q 9619  df-rp 9653  df-ico 9893  df-fz 10008  df-fzo 10142  df-seqfrec 10445  df-exp 10519  df-ihash 10755  df-cj 10850  df-re 10851  df-im 10852  df-rsqrt 11006  df-abs 11007  df-clim 11286  df-sumdc 11361

This theorem is referenced by:  efaddlem  11681