Theorem summodclem3 11387

Description: Lemma for summodc 11390. (Contributed by Mario Carneiro, 29-Mar-2014.) (Revised by Jim Kingdon, 9-Apr-2023.)

Hypotheses

Ref	Expression
isummo.1	⊢ 𝐹 = (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 0))
isummo.2	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)
isummolem3.5	⊢ (𝜑 → (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ))
isummolem3.6	⊢ (𝜑 → 𝑓:(1...𝑀)–1-1-onto→𝐴)
isummolem3.7	⊢ (𝜑 → 𝐾:(1...𝑁)–1-1-onto→𝐴)
isummolem3.g	⊢ 𝐺 = (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0))
isummolem3.4	⊢ 𝐻 = (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑁, ⦋(𝐾‘𝑛) / 𝑘⦌𝐵, 0))

Assertion

Ref	Expression
summodclem3	⊢ (𝜑 → (seq1( + , 𝐺)‘𝑀) = (seq1( + , 𝐻)‘𝑁))

Distinct variable groups:   𝑘,𝑛,𝐴   𝑛,𝐹   𝑘,𝑁,𝑛   𝜑,𝑘,𝑛   𝑘,𝑀,𝑛   𝐵,𝑛   𝑘,𝐾,𝑛   𝑓,𝑘,𝑛

Allowed substitution hints:   𝜑(𝑓)   𝐴(𝑓)   𝐵(𝑓,𝑘)   𝐹(𝑓,𝑘)   𝐺(𝑓,𝑘,𝑛)   𝐻(𝑓,𝑘,𝑛)   𝐾(𝑓)   𝑀(𝑓)   𝑁(𝑓)

Proof of Theorem summodclem3

Dummy variables 𝑖 𝑗 𝑚 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		addcl 7935	. . . 4 ⊢ ((𝑚 ∈ ℂ ∧ 𝑗 ∈ ℂ) → (𝑚 + 𝑗) ∈ ℂ)
2	1	adantl 277	. . 3 ⊢ ((𝜑 ∧ (𝑚 ∈ ℂ ∧ 𝑗 ∈ ℂ)) → (𝑚 + 𝑗) ∈ ℂ)
3		addcom 8093	. . . 4 ⊢ ((𝑚 ∈ ℂ ∧ 𝑗 ∈ ℂ) → (𝑚 + 𝑗) = (𝑗 + 𝑚))
4	3	adantl 277	. . 3 ⊢ ((𝜑 ∧ (𝑚 ∈ ℂ ∧ 𝑗 ∈ ℂ)) → (𝑚 + 𝑗) = (𝑗 + 𝑚))
5		addass 7940	. . . 4 ⊢ ((𝑚 ∈ ℂ ∧ 𝑗 ∈ ℂ ∧ 𝑦 ∈ ℂ) → ((𝑚 + 𝑗) + 𝑦) = (𝑚 + (𝑗 + 𝑦)))
6	5	adantl 277	. . 3 ⊢ ((𝜑 ∧ (𝑚 ∈ ℂ ∧ 𝑗 ∈ ℂ ∧ 𝑦 ∈ ℂ)) → ((𝑚 + 𝑗) + 𝑦) = (𝑚 + (𝑗 + 𝑦)))
7		isummolem3.5	. . . . 5 ⊢ (𝜑 → (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ))
8	7	simpld 112	. . . 4 ⊢ (𝜑 → 𝑀 ∈ ℕ)
9		nnuz 9562	. . . 4 ⊢ ℕ = (ℤ≥‘1)
10	8, 9	eleqtrdi 2270	. . 3 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘1))
11		isummolem3.6	. . . . . 6 ⊢ (𝜑 → 𝑓:(1...𝑀)–1-1-onto→𝐴)
12		f1ocnv 5474	. . . . . 6 ⊢ (𝑓:(1...𝑀)–1-1-onto→𝐴 → ◡𝑓:𝐴–1-1-onto→(1...𝑀))
13	11, 12	syl 14	. . . . 5 ⊢ (𝜑 → ◡𝑓:𝐴–1-1-onto→(1...𝑀))
14		isummolem3.7	. . . . 5 ⊢ (𝜑 → 𝐾:(1...𝑁)–1-1-onto→𝐴)
15		f1oco 5484	. . . . 5 ⊢ ((◡𝑓:𝐴–1-1-onto→(1...𝑀) ∧ 𝐾:(1...𝑁)–1-1-onto→𝐴) → (◡𝑓 ∘ 𝐾):(1...𝑁)–1-1-onto→(1...𝑀))
16	13, 14, 15	syl2anc 411	. . . 4 ⊢ (𝜑 → (◡𝑓 ∘ 𝐾):(1...𝑁)–1-1-onto→(1...𝑀))
17	7, 11, 14	nnf1o 11383	. . . . . . 7 ⊢ (𝜑 → 𝑁 = 𝑀)
18	17	eqcomd 2183	. . . . . 6 ⊢ (𝜑 → 𝑀 = 𝑁)
19	18	oveq2d 5890	. . . . 5 ⊢ (𝜑 → (1...𝑀) = (1...𝑁))
20		f1oeq2 5450	. . . . 5 ⊢ ((1...𝑀) = (1...𝑁) → ((◡𝑓 ∘ 𝐾):(1...𝑀)–1-1-onto→(1...𝑀) ↔ (◡𝑓 ∘ 𝐾):(1...𝑁)–1-1-onto→(1...𝑀)))
21	19, 20	syl 14	. . . 4 ⊢ (𝜑 → ((◡𝑓 ∘ 𝐾):(1...𝑀)–1-1-onto→(1...𝑀) ↔ (◡𝑓 ∘ 𝐾):(1...𝑁)–1-1-onto→(1...𝑀)))
22	16, 21	mpbird 167	. . 3 ⊢ (𝜑 → (◡𝑓 ∘ 𝐾):(1...𝑀)–1-1-onto→(1...𝑀))
23		elnnuz 9563	. . . 4 ⊢ (𝑚 ∈ ℕ ↔ 𝑚 ∈ (ℤ≥‘1))
24		isummolem3.g	. . . . . . 7 ⊢ 𝐺 = (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0))
25		breq1 4006	. . . . . . . 8 ⊢ (𝑛 = 𝑚 → (𝑛 ≤ 𝑀 ↔ 𝑚 ≤ 𝑀))
26		fveq2 5515	. . . . . . . . 9 ⊢ (𝑛 = 𝑚 → (𝑓‘𝑛) = (𝑓‘𝑚))
27	26	csbeq1d 3064	. . . . . . . 8 ⊢ (𝑛 = 𝑚 → ⦋(𝑓‘𝑛) / 𝑘⦌𝐵 = ⦋(𝑓‘𝑚) / 𝑘⦌𝐵)
28	25, 27	ifbieq1d 3556	. . . . . . 7 ⊢ (𝑛 = 𝑚 → if(𝑛 ≤ 𝑀, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0) = if(𝑚 ≤ 𝑀, ⦋(𝑓‘𝑚) / 𝑘⦌𝐵, 0))
29		simplr 528	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (1...𝑀)) → 𝑚 ∈ ℕ)
30		elfzle2 10027	. . . . . . . . . 10 ⊢ (𝑚 ∈ (1...𝑀) → 𝑚 ≤ 𝑀)
31	30	adantl 277	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (1...𝑀)) → 𝑚 ≤ 𝑀)
32	31	iftrued 3541	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (1...𝑀)) → if(𝑚 ≤ 𝑀, ⦋(𝑓‘𝑚) / 𝑘⦌𝐵, 0) = ⦋(𝑓‘𝑚) / 𝑘⦌𝐵)
33		f1of 5461	. . . . . . . . . . . 12 ⊢ (𝑓:(1...𝑀)–1-1-onto→𝐴 → 𝑓:(1...𝑀)⟶𝐴)
34	11, 33	syl 14	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑓:(1...𝑀)⟶𝐴)
35	34	ffvelcdmda 5651	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑚 ∈ (1...𝑀)) → (𝑓‘𝑚) ∈ 𝐴)
36		isummo.2	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)
37	36	ralrimiva 2550	. . . . . . . . . . 11 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ)
38	37	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑚 ∈ (1...𝑀)) → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ)
39		nfcsb1v 3090	. . . . . . . . . . . 12 ⊢ Ⅎ𝑘⦋(𝑓‘𝑚) / 𝑘⦌𝐵
40	39	nfel1 2330	. . . . . . . . . . 11 ⊢ Ⅎ𝑘⦋(𝑓‘𝑚) / 𝑘⦌𝐵 ∈ ℂ
41		csbeq1a 3066	. . . . . . . . . . . 12 ⊢ (𝑘 = (𝑓‘𝑚) → 𝐵 = ⦋(𝑓‘𝑚) / 𝑘⦌𝐵)
42	41	eleq1d 2246	. . . . . . . . . . 11 ⊢ (𝑘 = (𝑓‘𝑚) → (𝐵 ∈ ℂ ↔ ⦋(𝑓‘𝑚) / 𝑘⦌𝐵 ∈ ℂ))
43	40, 42	rspc 2835	. . . . . . . . . 10 ⊢ ((𝑓‘𝑚) ∈ 𝐴 → (∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ → ⦋(𝑓‘𝑚) / 𝑘⦌𝐵 ∈ ℂ))
44	35, 38, 43	sylc 62	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑚 ∈ (1...𝑀)) → ⦋(𝑓‘𝑚) / 𝑘⦌𝐵 ∈ ℂ)
45	44	adantlr 477	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (1...𝑀)) → ⦋(𝑓‘𝑚) / 𝑘⦌𝐵 ∈ ℂ)
46	32, 45	eqeltrd 2254	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (1...𝑀)) → if(𝑚 ≤ 𝑀, ⦋(𝑓‘𝑚) / 𝑘⦌𝐵, 0) ∈ ℂ)
47	24, 28, 29, 46	fvmptd3 5609	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (1...𝑀)) → (𝐺‘𝑚) = if(𝑚 ≤ 𝑀, ⦋(𝑓‘𝑚) / 𝑘⦌𝐵, 0))
48	47, 46	eqeltrd 2254	. . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (1...𝑀)) → (𝐺‘𝑚) ∈ ℂ)
49		simplr 528	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (ℤ≥‘(𝑀 + 1))) → 𝑚 ∈ ℕ)
50	8	ad2antrr 488	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (ℤ≥‘(𝑀 + 1))) → 𝑀 ∈ ℕ)
51	50	nnzd 9373	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (ℤ≥‘(𝑀 + 1))) → 𝑀 ∈ ℤ)
52		eluzp1l 9551	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℤ ∧ 𝑚 ∈ (ℤ≥‘(𝑀 + 1))) → 𝑀 < 𝑚)
53	51, 52	sylancom 420	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (ℤ≥‘(𝑀 + 1))) → 𝑀 < 𝑚)
54	49	nnzd 9373	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (ℤ≥‘(𝑀 + 1))) → 𝑚 ∈ ℤ)
55		zltnle 9298	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℤ ∧ 𝑚 ∈ ℤ) → (𝑀 < 𝑚 ↔ ¬ 𝑚 ≤ 𝑀))
56	51, 54, 55	syl2anc 411	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (ℤ≥‘(𝑀 + 1))) → (𝑀 < 𝑚 ↔ ¬ 𝑚 ≤ 𝑀))
57	53, 56	mpbid 147	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (ℤ≥‘(𝑀 + 1))) → ¬ 𝑚 ≤ 𝑀)
58	57	iffalsed 3544	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (ℤ≥‘(𝑀 + 1))) → if(𝑚 ≤ 𝑀, ⦋(𝑓‘𝑚) / 𝑘⦌𝐵, 0) = 0)
59		0cn 7948	. . . . . . . 8 ⊢ 0 ∈ ℂ
60	58, 59	eqeltrdi 2268	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (ℤ≥‘(𝑀 + 1))) → if(𝑚 ≤ 𝑀, ⦋(𝑓‘𝑚) / 𝑘⦌𝐵, 0) ∈ ℂ)
61	24, 28, 49, 60	fvmptd3 5609	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (ℤ≥‘(𝑀 + 1))) → (𝐺‘𝑚) = if(𝑚 ≤ 𝑀, ⦋(𝑓‘𝑚) / 𝑘⦌𝐵, 0))
62	61, 60	eqeltrd 2254	. . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (ℤ≥‘(𝑀 + 1))) → (𝐺‘𝑚) ∈ ℂ)
63		nnsplit 10136	. . . . . . . . 9 ⊢ (𝑀 ∈ ℕ → ℕ = ((1...𝑀) ∪ (ℤ≥‘(𝑀 + 1))))
64	8, 63	syl 14	. . . . . . . 8 ⊢ (𝜑 → ℕ = ((1...𝑀) ∪ (ℤ≥‘(𝑀 + 1))))
65	64	eleq2d 2247	. . . . . . 7 ⊢ (𝜑 → (𝑚 ∈ ℕ ↔ 𝑚 ∈ ((1...𝑀) ∪ (ℤ≥‘(𝑀 + 1)))))
66	65	biimpa 296	. . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ) → 𝑚 ∈ ((1...𝑀) ∪ (ℤ≥‘(𝑀 + 1))))
67		elun 3276	. . . . . 6 ⊢ (𝑚 ∈ ((1...𝑀) ∪ (ℤ≥‘(𝑀 + 1))) ↔ (𝑚 ∈ (1...𝑀) ∨ 𝑚 ∈ (ℤ≥‘(𝑀 + 1))))
68	66, 67	sylib 122	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ) → (𝑚 ∈ (1...𝑀) ∨ 𝑚 ∈ (ℤ≥‘(𝑀 + 1))))
69	48, 62, 68	mpjaodan 798	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ) → (𝐺‘𝑚) ∈ ℂ)
70	23, 69	sylan2br 288	. . 3 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ≥‘1)) → (𝐺‘𝑚) ∈ ℂ)
71	17	oveq2d 5890	. . . . . . . . 9 ⊢ (𝜑 → (1...𝑁) = (1...𝑀))
72	71	eleq2d 2247	. . . . . . . 8 ⊢ (𝜑 → (𝑚 ∈ (1...𝑁) ↔ 𝑚 ∈ (1...𝑀)))
73	72	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ) → (𝑚 ∈ (1...𝑁) ↔ 𝑚 ∈ (1...𝑀)))
74	73	pm5.32i 454	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (1...𝑁)) ↔ ((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (1...𝑀)))
75		isummolem3.4	. . . . . . . 8 ⊢ 𝐻 = (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑁, ⦋(𝐾‘𝑛) / 𝑘⦌𝐵, 0))
76		breq1 4006	. . . . . . . . 9 ⊢ (𝑛 = 𝑚 → (𝑛 ≤ 𝑁 ↔ 𝑚 ≤ 𝑁))
77		fveq2 5515	. . . . . . . . . 10 ⊢ (𝑛 = 𝑚 → (𝐾‘𝑛) = (𝐾‘𝑚))
78	77	csbeq1d 3064	. . . . . . . . 9 ⊢ (𝑛 = 𝑚 → ⦋(𝐾‘𝑛) / 𝑘⦌𝐵 = ⦋(𝐾‘𝑚) / 𝑘⦌𝐵)
79	76, 78	ifbieq1d 3556	. . . . . . . 8 ⊢ (𝑛 = 𝑚 → if(𝑛 ≤ 𝑁, ⦋(𝐾‘𝑛) / 𝑘⦌𝐵, 0) = if(𝑚 ≤ 𝑁, ⦋(𝐾‘𝑚) / 𝑘⦌𝐵, 0))
80		simplr 528	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (1...𝑁)) → 𝑚 ∈ ℕ)
81		elfzle2 10027	. . . . . . . . . . 11 ⊢ (𝑚 ∈ (1...𝑁) → 𝑚 ≤ 𝑁)
82	81	adantl 277	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (1...𝑁)) → 𝑚 ≤ 𝑁)
83	82	iftrued 3541	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (1...𝑁)) → if(𝑚 ≤ 𝑁, ⦋(𝐾‘𝑚) / 𝑘⦌𝐵, 0) = ⦋(𝐾‘𝑚) / 𝑘⦌𝐵)
84		f1of 5461	. . . . . . . . . . . . 13 ⊢ (𝐾:(1...𝑁)–1-1-onto→𝐴 → 𝐾:(1...𝑁)⟶𝐴)
85	14, 84	syl 14	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐾:(1...𝑁)⟶𝐴)
86	85	ffvelcdmda 5651	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑚 ∈ (1...𝑁)) → (𝐾‘𝑚) ∈ 𝐴)
87	37	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑚 ∈ (1...𝑁)) → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ)
88		nfcsb1v 3090	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑘⦋(𝐾‘𝑚) / 𝑘⦌𝐵
89	88	nfel1 2330	. . . . . . . . . . . 12 ⊢ Ⅎ𝑘⦋(𝐾‘𝑚) / 𝑘⦌𝐵 ∈ ℂ
90		csbeq1a 3066	. . . . . . . . . . . . 13 ⊢ (𝑘 = (𝐾‘𝑚) → 𝐵 = ⦋(𝐾‘𝑚) / 𝑘⦌𝐵)
91	90	eleq1d 2246	. . . . . . . . . . . 12 ⊢ (𝑘 = (𝐾‘𝑚) → (𝐵 ∈ ℂ ↔ ⦋(𝐾‘𝑚) / 𝑘⦌𝐵 ∈ ℂ))
92	89, 91	rspc 2835	. . . . . . . . . . 11 ⊢ ((𝐾‘𝑚) ∈ 𝐴 → (∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ → ⦋(𝐾‘𝑚) / 𝑘⦌𝐵 ∈ ℂ))
93	86, 87, 92	sylc 62	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑚 ∈ (1...𝑁)) → ⦋(𝐾‘𝑚) / 𝑘⦌𝐵 ∈ ℂ)
94	93	adantlr 477	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (1...𝑁)) → ⦋(𝐾‘𝑚) / 𝑘⦌𝐵 ∈ ℂ)
95	83, 94	eqeltrd 2254	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (1...𝑁)) → if(𝑚 ≤ 𝑁, ⦋(𝐾‘𝑚) / 𝑘⦌𝐵, 0) ∈ ℂ)
96	75, 79, 80, 95	fvmptd3 5609	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (1...𝑁)) → (𝐻‘𝑚) = if(𝑚 ≤ 𝑁, ⦋(𝐾‘𝑚) / 𝑘⦌𝐵, 0))
97	96, 95	eqeltrd 2254	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (1...𝑁)) → (𝐻‘𝑚) ∈ ℂ)
98	74, 97	sylbir 135	. . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (1...𝑀)) → (𝐻‘𝑚) ∈ ℂ)
99	17	breq2d 4015	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑚 ≤ 𝑁 ↔ 𝑚 ≤ 𝑀))
100	99	notbid 667	. . . . . . . . . . 11 ⊢ (𝜑 → (¬ 𝑚 ≤ 𝑁 ↔ ¬ 𝑚 ≤ 𝑀))
101	100	ad2antrr 488	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (ℤ≥‘(𝑀 + 1))) → (¬ 𝑚 ≤ 𝑁 ↔ ¬ 𝑚 ≤ 𝑀))
102	57, 101	mpbird 167	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (ℤ≥‘(𝑀 + 1))) → ¬ 𝑚 ≤ 𝑁)
103	102	iffalsed 3544	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (ℤ≥‘(𝑀 + 1))) → if(𝑚 ≤ 𝑁, ⦋(𝐾‘𝑚) / 𝑘⦌𝐵, 0) = 0)
104	103, 59	eqeltrdi 2268	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (ℤ≥‘(𝑀 + 1))) → if(𝑚 ≤ 𝑁, ⦋(𝐾‘𝑚) / 𝑘⦌𝐵, 0) ∈ ℂ)
105	75, 79, 49, 104	fvmptd3 5609	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (ℤ≥‘(𝑀 + 1))) → (𝐻‘𝑚) = if(𝑚 ≤ 𝑁, ⦋(𝐾‘𝑚) / 𝑘⦌𝐵, 0))
106	105, 104	eqeltrd 2254	. . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑚 ∈ (ℤ≥‘(𝑀 + 1))) → (𝐻‘𝑚) ∈ ℂ)
107	98, 106, 68	mpjaodan 798	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ) → (𝐻‘𝑚) ∈ ℂ)
108	23, 107	sylan2br 288	. . 3 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ≥‘1)) → (𝐻‘𝑚) ∈ ℂ)
109		f1oeq2 5450	. . . . . . . . . . 11 ⊢ ((1...𝑀) = (1...𝑁) → (𝐾:(1...𝑀)–1-1-onto→𝐴 ↔ 𝐾:(1...𝑁)–1-1-onto→𝐴))
110	19, 109	syl 14	. . . . . . . . . 10 ⊢ (𝜑 → (𝐾:(1...𝑀)–1-1-onto→𝐴 ↔ 𝐾:(1...𝑁)–1-1-onto→𝐴))
111	14, 110	mpbird 167	. . . . . . . . 9 ⊢ (𝜑 → 𝐾:(1...𝑀)–1-1-onto→𝐴)
112		f1of 5461	. . . . . . . . 9 ⊢ (𝐾:(1...𝑀)–1-1-onto→𝐴 → 𝐾:(1...𝑀)⟶𝐴)
113	111, 112	syl 14	. . . . . . . 8 ⊢ (𝜑 → 𝐾:(1...𝑀)⟶𝐴)
114		fvco3 5587	. . . . . . . 8 ⊢ ((𝐾:(1...𝑀)⟶𝐴 ∧ 𝑖 ∈ (1...𝑀)) → ((◡𝑓 ∘ 𝐾)‘𝑖) = (◡𝑓‘(𝐾‘𝑖)))
115	113, 114	sylan 283	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ((◡𝑓 ∘ 𝐾)‘𝑖) = (◡𝑓‘(𝐾‘𝑖)))
116	115	fveq2d 5519	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝑓‘((◡𝑓 ∘ 𝐾)‘𝑖)) = (𝑓‘(◡𝑓‘(𝐾‘𝑖))))
117	11	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 𝑓:(1...𝑀)–1-1-onto→𝐴)
118	113	ffvelcdmda 5651	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐾‘𝑖) ∈ 𝐴)
119		f1ocnvfv2 5778	. . . . . . 7 ⊢ ((𝑓:(1...𝑀)–1-1-onto→𝐴 ∧ (𝐾‘𝑖) ∈ 𝐴) → (𝑓‘(◡𝑓‘(𝐾‘𝑖))) = (𝐾‘𝑖))
120	117, 118, 119	syl2anc 411	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝑓‘(◡𝑓‘(𝐾‘𝑖))) = (𝐾‘𝑖))
121	116, 120	eqtr2d 2211	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐾‘𝑖) = (𝑓‘((◡𝑓 ∘ 𝐾)‘𝑖)))
122	121	csbeq1d 3064	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ⦋(𝐾‘𝑖) / 𝑘⦌𝐵 = ⦋(𝑓‘((◡𝑓 ∘ 𝐾)‘𝑖)) / 𝑘⦌𝐵)
123		elfznn 10053	. . . . . 6 ⊢ (𝑖 ∈ (1...𝑀) → 𝑖 ∈ ℕ)
124		elfzle2 10027	. . . . . . . . . 10 ⊢ (𝑖 ∈ (1...𝑀) → 𝑖 ≤ 𝑀)
125	124	adantl 277	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 𝑖 ≤ 𝑀)
126	18	breq2d 4015	. . . . . . . . . 10 ⊢ (𝜑 → (𝑖 ≤ 𝑀 ↔ 𝑖 ≤ 𝑁))
127	126	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝑖 ≤ 𝑀 ↔ 𝑖 ≤ 𝑁))
128	125, 127	mpbid 147	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 𝑖 ≤ 𝑁)
129	128	iftrued 3541	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → if(𝑖 ≤ 𝑁, ⦋(𝐾‘𝑖) / 𝑘⦌𝐵, 0) = ⦋(𝐾‘𝑖) / 𝑘⦌𝐵)
130	37	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ)
131		nfcsb1v 3090	. . . . . . . . . 10 ⊢ Ⅎ𝑘⦋(𝐾‘𝑖) / 𝑘⦌𝐵
132	131	nfel1 2330	. . . . . . . . 9 ⊢ Ⅎ𝑘⦋(𝐾‘𝑖) / 𝑘⦌𝐵 ∈ ℂ
133		csbeq1a 3066	. . . . . . . . . 10 ⊢ (𝑘 = (𝐾‘𝑖) → 𝐵 = ⦋(𝐾‘𝑖) / 𝑘⦌𝐵)
134	133	eleq1d 2246	. . . . . . . . 9 ⊢ (𝑘 = (𝐾‘𝑖) → (𝐵 ∈ ℂ ↔ ⦋(𝐾‘𝑖) / 𝑘⦌𝐵 ∈ ℂ))
135	132, 134	rspc 2835	. . . . . . . 8 ⊢ ((𝐾‘𝑖) ∈ 𝐴 → (∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ → ⦋(𝐾‘𝑖) / 𝑘⦌𝐵 ∈ ℂ))
136	118, 130, 135	sylc 62	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ⦋(𝐾‘𝑖) / 𝑘⦌𝐵 ∈ ℂ)
137	129, 136	eqeltrd 2254	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → if(𝑖 ≤ 𝑁, ⦋(𝐾‘𝑖) / 𝑘⦌𝐵, 0) ∈ ℂ)
138		breq1 4006	. . . . . . . 8 ⊢ (𝑛 = 𝑖 → (𝑛 ≤ 𝑁 ↔ 𝑖 ≤ 𝑁))
139		fveq2 5515	. . . . . . . . 9 ⊢ (𝑛 = 𝑖 → (𝐾‘𝑛) = (𝐾‘𝑖))
140	139	csbeq1d 3064	. . . . . . . 8 ⊢ (𝑛 = 𝑖 → ⦋(𝐾‘𝑛) / 𝑘⦌𝐵 = ⦋(𝐾‘𝑖) / 𝑘⦌𝐵)
141	138, 140	ifbieq1d 3556	. . . . . . 7 ⊢ (𝑛 = 𝑖 → if(𝑛 ≤ 𝑁, ⦋(𝐾‘𝑛) / 𝑘⦌𝐵, 0) = if(𝑖 ≤ 𝑁, ⦋(𝐾‘𝑖) / 𝑘⦌𝐵, 0))
142	141, 75	fvmptg 5592	. . . . . 6 ⊢ ((𝑖 ∈ ℕ ∧ if(𝑖 ≤ 𝑁, ⦋(𝐾‘𝑖) / 𝑘⦌𝐵, 0) ∈ ℂ) → (𝐻‘𝑖) = if(𝑖 ≤ 𝑁, ⦋(𝐾‘𝑖) / 𝑘⦌𝐵, 0))
143	123, 137, 142	syl2an2 594	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐻‘𝑖) = if(𝑖 ≤ 𝑁, ⦋(𝐾‘𝑖) / 𝑘⦌𝐵, 0))
144	143, 129	eqtrd 2210	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐻‘𝑖) = ⦋(𝐾‘𝑖) / 𝑘⦌𝐵)
145		breq1 4006	. . . . . . 7 ⊢ (𝑛 = ((◡𝑓 ∘ 𝐾)‘𝑖) → (𝑛 ≤ 𝑀 ↔ ((◡𝑓 ∘ 𝐾)‘𝑖) ≤ 𝑀))
146		fveq2 5515	. . . . . . . 8 ⊢ (𝑛 = ((◡𝑓 ∘ 𝐾)‘𝑖) → (𝑓‘𝑛) = (𝑓‘((◡𝑓 ∘ 𝐾)‘𝑖)))
147	146	csbeq1d 3064	. . . . . . 7 ⊢ (𝑛 = ((◡𝑓 ∘ 𝐾)‘𝑖) → ⦋(𝑓‘𝑛) / 𝑘⦌𝐵 = ⦋(𝑓‘((◡𝑓 ∘ 𝐾)‘𝑖)) / 𝑘⦌𝐵)
148	145, 147	ifbieq1d 3556	. . . . . 6 ⊢ (𝑛 = ((◡𝑓 ∘ 𝐾)‘𝑖) → if(𝑛 ≤ 𝑀, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0) = if(((◡𝑓 ∘ 𝐾)‘𝑖) ≤ 𝑀, ⦋(𝑓‘((◡𝑓 ∘ 𝐾)‘𝑖)) / 𝑘⦌𝐵, 0))
149		f1of 5461	. . . . . . . . 9 ⊢ ((◡𝑓 ∘ 𝐾):(1...𝑀)–1-1-onto→(1...𝑀) → (◡𝑓 ∘ 𝐾):(1...𝑀)⟶(1...𝑀))
150	22, 149	syl 14	. . . . . . . 8 ⊢ (𝜑 → (◡𝑓 ∘ 𝐾):(1...𝑀)⟶(1...𝑀))
151	150	ffvelcdmda 5651	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ((◡𝑓 ∘ 𝐾)‘𝑖) ∈ (1...𝑀))
152		elfznn 10053	. . . . . . 7 ⊢ (((◡𝑓 ∘ 𝐾)‘𝑖) ∈ (1...𝑀) → ((◡𝑓 ∘ 𝐾)‘𝑖) ∈ ℕ)
153	151, 152	syl 14	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ((◡𝑓 ∘ 𝐾)‘𝑖) ∈ ℕ)
154		elfzle2 10027	. . . . . . . . . 10 ⊢ (((◡𝑓 ∘ 𝐾)‘𝑖) ∈ (1...𝑀) → ((◡𝑓 ∘ 𝐾)‘𝑖) ≤ 𝑀)
155	151, 154	syl 14	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ((◡𝑓 ∘ 𝐾)‘𝑖) ≤ 𝑀)
156	155	iftrued 3541	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → if(((◡𝑓 ∘ 𝐾)‘𝑖) ≤ 𝑀, ⦋(𝑓‘((◡𝑓 ∘ 𝐾)‘𝑖)) / 𝑘⦌𝐵, 0) = ⦋(𝑓‘((◡𝑓 ∘ 𝐾)‘𝑖)) / 𝑘⦌𝐵)
157	156, 122	eqtr4d 2213	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → if(((◡𝑓 ∘ 𝐾)‘𝑖) ≤ 𝑀, ⦋(𝑓‘((◡𝑓 ∘ 𝐾)‘𝑖)) / 𝑘⦌𝐵, 0) = ⦋(𝐾‘𝑖) / 𝑘⦌𝐵)
158	157, 136	eqeltrd 2254	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → if(((◡𝑓 ∘ 𝐾)‘𝑖) ≤ 𝑀, ⦋(𝑓‘((◡𝑓 ∘ 𝐾)‘𝑖)) / 𝑘⦌𝐵, 0) ∈ ℂ)
159	24, 148, 153, 158	fvmptd3 5609	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐺‘((◡𝑓 ∘ 𝐾)‘𝑖)) = if(((◡𝑓 ∘ 𝐾)‘𝑖) ≤ 𝑀, ⦋(𝑓‘((◡𝑓 ∘ 𝐾)‘𝑖)) / 𝑘⦌𝐵, 0))
160	159, 156	eqtrd 2210	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐺‘((◡𝑓 ∘ 𝐾)‘𝑖)) = ⦋(𝑓‘((◡𝑓 ∘ 𝐾)‘𝑖)) / 𝑘⦌𝐵)
161	122, 144, 160	3eqtr4d 2220	. . 3 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐻‘𝑖) = (𝐺‘((◡𝑓 ∘ 𝐾)‘𝑖)))
162	2, 4, 6, 10, 22, 70, 108, 161	seq3f1o 10503	. 2 ⊢ (𝜑 → (seq1( + , 𝐻)‘𝑀) = (seq1( + , 𝐺)‘𝑀))
163	18	fveq2d 5519	. 2 ⊢ (𝜑 → (seq1( + , 𝐻)‘𝑀) = (seq1( + , 𝐻)‘𝑁))
164	162, 163	eqtr3d 2212	1 ⊢ (𝜑 → (seq1( + , 𝐺)‘𝑀) = (seq1( + , 𝐻)‘𝑁))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 708   ∧ w3a 978   = wceq 1353   ∈ wcel 2148  ∀wral 2455  ⦋csb 3057   ∪ cun 3127  ifcif 3534   class class class wbr 4003   ↦ cmpt 4064  ^◡ccnv 4625   ∘ ccom 4630  ⟶wf 5212  –1-1-onto→wf1o 5215  ‘cfv 5216  (class class class)co 5874  ℂcc 7808  0cc0 7810  1c1 7811   + caddc 7813   < clt 7991   ≤ cle 7992  ℕcn 8918  ℤcz 9252  ℤ_≥cuz 9527  ...cfz 10007  seqcseq 10444

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-addcom 7910  ax-addass 7912  ax-distr 7914  ax-i2m1 7915  ax-0lt1 7916  ax-0id 7918  ax-rnegex 7919  ax-cnre 7921  ax-pre-ltirr 7922  ax-pre-ltwlin 7923  ax-pre-lttrn 7924  ax-pre-apti 7925  ax-pre-ltadd 7926

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-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-br 4004  df-opab 4065  df-mpt 4066  df-tr 4102  df-id 4293  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-riota 5830  df-ov 5877  df-oprab 5878  df-mpo 5879  df-1st 6140  df-2nd 6141  df-recs 6305  df-frec 6391  df-1o 6416  df-er 6534  df-en 6740  df-dom 6741  df-fin 6742  df-pnf 7993  df-mnf 7994  df-xr 7995  df-ltxr 7996  df-le 7997  df-sub 8129  df-neg 8130  df-inn 8919  df-n0 9176  df-z 9253  df-uz 9528  df-fz 10008  df-fzo 10142  df-seqfrec 10445  df-ihash 10755

This theorem is referenced by:  summodclem2a  11388  summodc  11390