Theorem plyaddlem1 15263

Description: Derive the coefficient function for the sum of two polynomials. (Contributed by Mario Carneiro, 23-Jul-2014.)

Hypotheses

Ref	Expression
plyaddlem.1	⊢ (𝜑 → 𝐹 ∈ (Poly‘𝑆))
plyaddlem.2	⊢ (𝜑 → 𝐺 ∈ (Poly‘𝑆))
plyaddlem.m	⊢ (𝜑 → 𝑀 ∈ ℕ0)
plyaddlem.n	⊢ (𝜑 → 𝑁 ∈ ℕ0)
plyaddlem.a	⊢ (𝜑 → 𝐴:ℕ0⟶ℂ)
plyaddlem.b	⊢ (𝜑 → 𝐵:ℕ0⟶ℂ)
plyaddlem.a2	⊢ (𝜑 → (𝐴 “ (ℤ≥‘(𝑀 + 1))) = {0})
plyaddlem.b2	⊢ (𝜑 → (𝐵 “ (ℤ≥‘(𝑁 + 1))) = {0})
plyaddlem.f	⊢ (𝜑 → 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘))))
plyaddlem.g	⊢ (𝜑 → 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘))))

Assertion

Ref	Expression
plyaddlem1	⊢ (𝜑 → (𝐹 ∘𝑓 + 𝐺) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴 ∘𝑓 + 𝐵)‘𝑘) · (𝑧↑𝑘))))

Distinct variable groups:   𝐵,𝑘   𝑘,𝑀   𝑘,𝑁   𝑧,𝑘,𝜑

Allowed substitution hints:   𝐴(𝑧,𝑘)   𝐵(𝑧)   𝑆(𝑧,𝑘)   𝐹(𝑧,𝑘)   𝐺(𝑧,𝑘)   𝑀(𝑧)   𝑁(𝑧)

Proof of Theorem plyaddlem1

Dummy variable 𝑗 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cnex 8056	. . . 4 ⊢ ℂ ∈ V
2	1	a1i 9	. . 3 ⊢ (𝜑 → ℂ ∈ V)
3		0zd 9391	. . . . . 6 ⊢ (𝜑 → 0 ∈ ℤ)
4		plyaddlem.m	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℕ0)
5	4	nn0zd 9500	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ)
6	3, 5	fzfigd 10583	. . . . 5 ⊢ (𝜑 → (0...𝑀) ∈ Fin)
7	6	adantr 276	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → (0...𝑀) ∈ Fin)
8		plyaddlem.a	. . . . . . 7 ⊢ (𝜑 → 𝐴:ℕ0⟶ℂ)
9	8	ad2antrr 488	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑀)) → 𝐴:ℕ0⟶ℂ)
10		elfznn0 10243	. . . . . . 7 ⊢ (𝑘 ∈ (0...𝑀) → 𝑘 ∈ ℕ0)
11	10	adantl 277	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑀)) → 𝑘 ∈ ℕ0)
12	9, 11	ffvelcdmd 5723	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑀)) → (𝐴‘𝑘) ∈ ℂ)
13		simplr 528	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑀)) → 𝑧 ∈ ℂ)
14	13, 11	expcld 10825	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑀)) → (𝑧↑𝑘) ∈ ℂ)
15	12, 14	mulcld 8100	. . . 4 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑀)) → ((𝐴‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
16	7, 15	fsumcl 11755	. . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
17		plyaddlem.n	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℕ0)
18	17	nn0zd 9500	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℤ)
19	3, 18	fzfigd 10583	. . . . 5 ⊢ (𝜑 → (0...𝑁) ∈ Fin)
20	19	adantr 276	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → (0...𝑁) ∈ Fin)
21		plyaddlem.b	. . . . . . 7 ⊢ (𝜑 → 𝐵:ℕ0⟶ℂ)
22	21	ad2antrr 488	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑁)) → 𝐵:ℕ0⟶ℂ)
23		elfznn0 10243	. . . . . . 7 ⊢ (𝑘 ∈ (0...𝑁) → 𝑘 ∈ ℕ0)
24	23	adantl 277	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑁)) → 𝑘 ∈ ℕ0)
25	22, 24	ffvelcdmd 5723	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑁)) → (𝐵‘𝑘) ∈ ℂ)
26		simplr 528	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑁)) → 𝑧 ∈ ℂ)
27	26, 24	expcld 10825	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑁)) → (𝑧↑𝑘) ∈ ℂ)
28	25, 27	mulcld 8100	. . . 4 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑁)) → ((𝐵‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
29	20, 28	fsumcl 11755	. . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
30		plyaddlem.f	. . 3 ⊢ (𝜑 → 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘))))
31		plyaddlem.g	. . 3 ⊢ (𝜑 → 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘))))
32	2, 16, 29, 30, 31	offval2 6181	. 2 ⊢ (𝜑 → (𝐹 ∘𝑓 + 𝐺) = (𝑧 ∈ ℂ ↦ (Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘)) + Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘)))))
33		0zd 9391	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → 0 ∈ ℤ)
34		2zsupmax 11581	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → sup({𝑀, 𝑁}, ℝ, < ) = if(𝑀 ≤ 𝑁, 𝑁, 𝑀))
35	5, 18, 34	syl2anc 411	. . . . . . . 8 ⊢ (𝜑 → sup({𝑀, 𝑁}, ℝ, < ) = if(𝑀 ≤ 𝑁, 𝑁, 𝑀))
36		zmaxcl 11579	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → sup({𝑀, 𝑁}, ℝ, < ) ∈ ℤ)
37	5, 18, 36	syl2anc 411	. . . . . . . 8 ⊢ (𝜑 → sup({𝑀, 𝑁}, ℝ, < ) ∈ ℤ)
38	35, 37	eqeltrrd 2284	. . . . . . 7 ⊢ (𝜑 → if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℤ)
39	38	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℤ)
40	33, 39	fzfigd 10583	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∈ Fin)
41		elfznn0 10243	. . . . . 6 ⊢ (𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) → 𝑘 ∈ ℕ0)
42	8	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → 𝐴:ℕ0⟶ℂ)
43	42	ffvelcdmda 5722	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ0) → (𝐴‘𝑘) ∈ ℂ)
44		expcl 10709	. . . . . . . 8 ⊢ ((𝑧 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (𝑧↑𝑘) ∈ ℂ)
45	44	adantll 476	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ0) → (𝑧↑𝑘) ∈ ℂ)
46	43, 45	mulcld 8100	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ0) → ((𝐴‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
47	41, 46	sylan2 286	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → ((𝐴‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
48	21	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → 𝐵:ℕ0⟶ℂ)
49	48	ffvelcdmda 5722	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ0) → (𝐵‘𝑘) ∈ ℂ)
50	49, 45	mulcld 8100	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ0) → ((𝐵‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
51	41, 50	sylan2 286	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → ((𝐵‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
52	40, 47, 51	fsumadd 11761	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴‘𝑘) · (𝑧↑𝑘)) + ((𝐵‘𝑘) · (𝑧↑𝑘))) = (Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))((𝐴‘𝑘) · (𝑧↑𝑘)) + Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))((𝐵‘𝑘) · (𝑧↑𝑘))))
53	8	ffnd 5432	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 Fn ℕ0)
54	21	ffnd 5432	. . . . . . . . . 10 ⊢ (𝜑 → 𝐵 Fn ℕ0)
55		nn0ex 9308	. . . . . . . . . . 11 ⊢ ℕ0 ∈ V
56	55	a1i 9	. . . . . . . . . 10 ⊢ (𝜑 → ℕ0 ∈ V)
57		inidm 3383	. . . . . . . . . 10 ⊢ (ℕ0 ∩ ℕ0) = ℕ0
58		eqidd 2207	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐴‘𝑘) = (𝐴‘𝑘))
59		eqidd 2207	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐵‘𝑘) = (𝐵‘𝑘))
60	8	ffvelcdmda 5722	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐴‘𝑘) ∈ ℂ)
61	21	ffvelcdmda 5722	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐵‘𝑘) ∈ ℂ)
62	60, 61	addcld 8099	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝐴‘𝑘) + (𝐵‘𝑘)) ∈ ℂ)
63	53, 54, 56, 56, 57, 58, 59, 62	ofvalg 6175	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝐴 ∘𝑓 + 𝐵)‘𝑘) = ((𝐴‘𝑘) + (𝐵‘𝑘)))
64	63	adantlr 477	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ0) → ((𝐴 ∘𝑓 + 𝐵)‘𝑘) = ((𝐴‘𝑘) + (𝐵‘𝑘)))
65	64	oveq1d 5966	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ0) → (((𝐴 ∘𝑓 + 𝐵)‘𝑘) · (𝑧↑𝑘)) = (((𝐴‘𝑘) + (𝐵‘𝑘)) · (𝑧↑𝑘)))
66	43, 49, 45	adddird 8105	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ0) → (((𝐴‘𝑘) + (𝐵‘𝑘)) · (𝑧↑𝑘)) = (((𝐴‘𝑘) · (𝑧↑𝑘)) + ((𝐵‘𝑘) · (𝑧↑𝑘))))
67	65, 66	eqtrd 2239	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ0) → (((𝐴 ∘𝑓 + 𝐵)‘𝑘) · (𝑧↑𝑘)) = (((𝐴‘𝑘) · (𝑧↑𝑘)) + ((𝐵‘𝑘) · (𝑧↑𝑘))))
68	41, 67	sylan2 286	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → (((𝐴 ∘𝑓 + 𝐵)‘𝑘) · (𝑧↑𝑘)) = (((𝐴‘𝑘) · (𝑧↑𝑘)) + ((𝐵‘𝑘) · (𝑧↑𝑘))))
69	68	sumeq2dv 11723	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴 ∘𝑓 + 𝐵)‘𝑘) · (𝑧↑𝑘)) = Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴‘𝑘) · (𝑧↑𝑘)) + ((𝐵‘𝑘) · (𝑧↑𝑘))))
70		zdcle 9456	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID 𝑀 ≤ 𝑁)
71	5, 18, 70	syl2anc 411	. . . . . . . . . 10 ⊢ (𝜑 → DECID 𝑀 ≤ 𝑁)
72	18, 5, 71	ifcldcd 3609	. . . . . . . . 9 ⊢ (𝜑 → if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℤ)
73	4	nn0red 9356	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑀 ∈ ℝ)
74	17	nn0red 9356	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑁 ∈ ℝ)
75		maxle1 11566	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → 𝑀 ≤ sup({𝑀, 𝑁}, ℝ, < ))
76	73, 74, 75	syl2anc 411	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ≤ sup({𝑀, 𝑁}, ℝ, < ))
77	76, 35	breqtrd 4073	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀))
78		eluz2 9661	. . . . . . . . 9 ⊢ (if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℤ ∧ 𝑀 ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))
79	5, 72, 77, 78	syl3anbrc 1184	. . . . . . . 8 ⊢ (𝜑 → if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ (ℤ≥‘𝑀))
80		fzss2 10193	. . . . . . . 8 ⊢ (if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ (ℤ≥‘𝑀) → (0...𝑀) ⊆ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))
81	79, 80	syl 14	. . . . . . 7 ⊢ (𝜑 → (0...𝑀) ⊆ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))
82	81	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → (0...𝑀) ⊆ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))
83	10, 46	sylan2 286	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑀)) → ((𝐴‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
84		eldifn 3297	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀)) → ¬ 𝑘 ∈ (0...𝑀))
85	84	adantl 277	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → ¬ 𝑘 ∈ (0...𝑀))
86		eldifi 3296	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀)) → 𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))
87	86, 41	syl 14	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀)) → 𝑘 ∈ ℕ0)
88	87	adantl 277	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → 𝑘 ∈ ℕ0)
89		nn0uz 9690	. . . . . . . . . . . . . . . . . 18 ⊢ ℕ0 = (ℤ≥‘0)
90		peano2nn0 9342	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑀 ∈ ℕ0 → (𝑀 + 1) ∈ ℕ0)
91	4, 90	syl 14	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → (𝑀 + 1) ∈ ℕ0)
92	91, 89	eleqtrdi 2299	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (𝑀 + 1) ∈ (ℤ≥‘0))
93		uzsplit 10221	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑀 + 1) ∈ (ℤ≥‘0) → (ℤ≥‘0) = ((0...((𝑀 + 1) − 1)) ∪ (ℤ≥‘(𝑀 + 1))))
94	92, 93	syl 14	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (ℤ≥‘0) = ((0...((𝑀 + 1) − 1)) ∪ (ℤ≥‘(𝑀 + 1))))
95	89, 94	eqtrid 2251	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ℕ0 = ((0...((𝑀 + 1) − 1)) ∪ (ℤ≥‘(𝑀 + 1))))
96	4	nn0cnd 9357	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → 𝑀 ∈ ℂ)
97		ax-1cn 8025	. . . . . . . . . . . . . . . . . . . 20 ⊢ 1 ∈ ℂ
98		pncan 8285	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑀 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑀 + 1) − 1) = 𝑀)
99	96, 97, 98	sylancl 413	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → ((𝑀 + 1) − 1) = 𝑀)
100	99	oveq2d 5967	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (0...((𝑀 + 1) − 1)) = (0...𝑀))
101	100	uneq1d 3327	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ((0...((𝑀 + 1) − 1)) ∪ (ℤ≥‘(𝑀 + 1))) = ((0...𝑀) ∪ (ℤ≥‘(𝑀 + 1))))
102	95, 101	eqtrd 2239	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ℕ0 = ((0...𝑀) ∪ (ℤ≥‘(𝑀 + 1))))
103	102	ad2antrr 488	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → ℕ0 = ((0...𝑀) ∪ (ℤ≥‘(𝑀 + 1))))
104	88, 103	eleqtrd 2285	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → 𝑘 ∈ ((0...𝑀) ∪ (ℤ≥‘(𝑀 + 1))))
105		elun 3315	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ((0...𝑀) ∪ (ℤ≥‘(𝑀 + 1))) ↔ (𝑘 ∈ (0...𝑀) ∨ 𝑘 ∈ (ℤ≥‘(𝑀 + 1))))
106	104, 105	sylib 122	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (𝑘 ∈ (0...𝑀) ∨ 𝑘 ∈ (ℤ≥‘(𝑀 + 1))))
107	106	ord 726	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (¬ 𝑘 ∈ (0...𝑀) → 𝑘 ∈ (ℤ≥‘(𝑀 + 1))))
108	85, 107	mpd 13	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → 𝑘 ∈ (ℤ≥‘(𝑀 + 1)))
109	8	ffund 5435	. . . . . . . . . . . . 13 ⊢ (𝜑 → Fun 𝐴)
110		ssun2 3338	. . . . . . . . . . . . . . 15 ⊢ (ℤ≥‘(𝑀 + 1)) ⊆ ((0...((𝑀 + 1) − 1)) ∪ (ℤ≥‘(𝑀 + 1)))
111	110, 95	sseqtrrid 3245	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (ℤ≥‘(𝑀 + 1)) ⊆ ℕ0)
112	8	fdmd 5438	. . . . . . . . . . . . . 14 ⊢ (𝜑 → dom 𝐴 = ℕ0)
113	111, 112	sseqtrrd 3233	. . . . . . . . . . . . 13 ⊢ (𝜑 → (ℤ≥‘(𝑀 + 1)) ⊆ dom 𝐴)
114		funfvima2 5824	. . . . . . . . . . . . 13 ⊢ ((Fun 𝐴 ∧ (ℤ≥‘(𝑀 + 1)) ⊆ dom 𝐴) → (𝑘 ∈ (ℤ≥‘(𝑀 + 1)) → (𝐴‘𝑘) ∈ (𝐴 “ (ℤ≥‘(𝑀 + 1)))))
115	109, 113, 114	syl2anc 411	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑘 ∈ (ℤ≥‘(𝑀 + 1)) → (𝐴‘𝑘) ∈ (𝐴 “ (ℤ≥‘(𝑀 + 1)))))
116	115	ad2antrr 488	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (𝑘 ∈ (ℤ≥‘(𝑀 + 1)) → (𝐴‘𝑘) ∈ (𝐴 “ (ℤ≥‘(𝑀 + 1)))))
117	108, 116	mpd 13	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (𝐴‘𝑘) ∈ (𝐴 “ (ℤ≥‘(𝑀 + 1))))
118		plyaddlem.a2	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴 “ (ℤ≥‘(𝑀 + 1))) = {0})
119	118	ad2antrr 488	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (𝐴 “ (ℤ≥‘(𝑀 + 1))) = {0})
120	117, 119	eleqtrd 2285	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (𝐴‘𝑘) ∈ {0})
121		elsni 3652	. . . . . . . . 9 ⊢ ((𝐴‘𝑘) ∈ {0} → (𝐴‘𝑘) = 0)
122	120, 121	syl 14	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (𝐴‘𝑘) = 0)
123	122	oveq1d 5966	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → ((𝐴‘𝑘) · (𝑧↑𝑘)) = (0 · (𝑧↑𝑘)))
124	87, 45	sylan2 286	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (𝑧↑𝑘) ∈ ℂ)
125	124	mul02d 8471	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (0 · (𝑧↑𝑘)) = 0)
126	123, 125	eqtrd 2239	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → ((𝐴‘𝑘) · (𝑧↑𝑘)) = 0)
127		elfzelz 10154	. . . . . . . . 9 ⊢ (𝑗 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) → 𝑗 ∈ ℤ)
128	127	adantl 277	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → 𝑗 ∈ ℤ)
129		0zd 9391	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → 0 ∈ ℤ)
130	5	ad2antrr 488	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → 𝑀 ∈ ℤ)
131		fzdcel 10169	. . . . . . . 8 ⊢ ((𝑗 ∈ ℤ ∧ 0 ∈ ℤ ∧ 𝑀 ∈ ℤ) → DECID 𝑗 ∈ (0...𝑀))
132	128, 129, 130, 131	syl3anc 1250	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → DECID 𝑗 ∈ (0...𝑀))
133	132	ralrimiva 2580	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → ∀𝑗 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))DECID 𝑗 ∈ (0...𝑀))
134	82, 83, 126, 133, 40	fisumss 11747	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘)) = Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))((𝐴‘𝑘) · (𝑧↑𝑘)))
135		maxle2 11567	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → 𝑁 ≤ sup({𝑀, 𝑁}, ℝ, < ))
136	73, 74, 135	syl2anc 411	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ≤ sup({𝑀, 𝑁}, ℝ, < ))
137	136, 35	breqtrd 4073	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀))
138		eluz2 9661	. . . . . . . . 9 ⊢ (if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ (ℤ≥‘𝑁) ↔ (𝑁 ∈ ℤ ∧ if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℤ ∧ 𝑁 ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))
139	18, 72, 137, 138	syl3anbrc 1184	. . . . . . . 8 ⊢ (𝜑 → if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ (ℤ≥‘𝑁))
140		fzss2 10193	. . . . . . . 8 ⊢ (if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ (ℤ≥‘𝑁) → (0...𝑁) ⊆ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))
141	139, 140	syl 14	. . . . . . 7 ⊢ (𝜑 → (0...𝑁) ⊆ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))
142	141	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → (0...𝑁) ⊆ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))
143	23, 50	sylan2 286	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑁)) → ((𝐵‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
144		eldifn 3297	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁)) → ¬ 𝑘 ∈ (0...𝑁))
145	144	adantl 277	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → ¬ 𝑘 ∈ (0...𝑁))
146		eldifi 3296	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁)) → 𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))
147	146, 41	syl 14	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁)) → 𝑘 ∈ ℕ0)
148	147	adantl 277	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → 𝑘 ∈ ℕ0)
149		peano2nn0 9342	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0)
150	17, 149	syl 14	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → (𝑁 + 1) ∈ ℕ0)
151	150, 89	eleqtrdi 2299	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (𝑁 + 1) ∈ (ℤ≥‘0))
152		uzsplit 10221	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑁 + 1) ∈ (ℤ≥‘0) → (ℤ≥‘0) = ((0...((𝑁 + 1) − 1)) ∪ (ℤ≥‘(𝑁 + 1))))
153	151, 152	syl 14	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (ℤ≥‘0) = ((0...((𝑁 + 1) − 1)) ∪ (ℤ≥‘(𝑁 + 1))))
154	89, 153	eqtrid 2251	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ℕ0 = ((0...((𝑁 + 1) − 1)) ∪ (ℤ≥‘(𝑁 + 1))))
155	17	nn0cnd 9357	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → 𝑁 ∈ ℂ)
156		pncan 8285	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑁 + 1) − 1) = 𝑁)
157	155, 97, 156	sylancl 413	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → ((𝑁 + 1) − 1) = 𝑁)
158	157	oveq2d 5967	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (0...((𝑁 + 1) − 1)) = (0...𝑁))
159	158	uneq1d 3327	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ((0...((𝑁 + 1) − 1)) ∪ (ℤ≥‘(𝑁 + 1))) = ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1))))
160	154, 159	eqtrd 2239	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ℕ0 = ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1))))
161	160	ad2antrr 488	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → ℕ0 = ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1))))
162	148, 161	eleqtrd 2285	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → 𝑘 ∈ ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1))))
163		elun 3315	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1))) ↔ (𝑘 ∈ (0...𝑁) ∨ 𝑘 ∈ (ℤ≥‘(𝑁 + 1))))
164	162, 163	sylib 122	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (𝑘 ∈ (0...𝑁) ∨ 𝑘 ∈ (ℤ≥‘(𝑁 + 1))))
165	164	ord 726	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (¬ 𝑘 ∈ (0...𝑁) → 𝑘 ∈ (ℤ≥‘(𝑁 + 1))))
166	145, 165	mpd 13	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → 𝑘 ∈ (ℤ≥‘(𝑁 + 1)))
167	21	ffund 5435	. . . . . . . . . . . . 13 ⊢ (𝜑 → Fun 𝐵)
168		ssun2 3338	. . . . . . . . . . . . . . 15 ⊢ (ℤ≥‘(𝑁 + 1)) ⊆ ((0...((𝑁 + 1) − 1)) ∪ (ℤ≥‘(𝑁 + 1)))
169	168, 154	sseqtrrid 3245	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (ℤ≥‘(𝑁 + 1)) ⊆ ℕ0)
170	21	fdmd 5438	. . . . . . . . . . . . . 14 ⊢ (𝜑 → dom 𝐵 = ℕ0)
171	169, 170	sseqtrrd 3233	. . . . . . . . . . . . 13 ⊢ (𝜑 → (ℤ≥‘(𝑁 + 1)) ⊆ dom 𝐵)
172		funfvima2 5824	. . . . . . . . . . . . 13 ⊢ ((Fun 𝐵 ∧ (ℤ≥‘(𝑁 + 1)) ⊆ dom 𝐵) → (𝑘 ∈ (ℤ≥‘(𝑁 + 1)) → (𝐵‘𝑘) ∈ (𝐵 “ (ℤ≥‘(𝑁 + 1)))))
173	167, 171, 172	syl2anc 411	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑘 ∈ (ℤ≥‘(𝑁 + 1)) → (𝐵‘𝑘) ∈ (𝐵 “ (ℤ≥‘(𝑁 + 1)))))
174	173	ad2antrr 488	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (𝑘 ∈ (ℤ≥‘(𝑁 + 1)) → (𝐵‘𝑘) ∈ (𝐵 “ (ℤ≥‘(𝑁 + 1)))))
175	166, 174	mpd 13	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (𝐵‘𝑘) ∈ (𝐵 “ (ℤ≥‘(𝑁 + 1))))
176		plyaddlem.b2	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐵 “ (ℤ≥‘(𝑁 + 1))) = {0})
177	176	ad2antrr 488	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (𝐵 “ (ℤ≥‘(𝑁 + 1))) = {0})
178	175, 177	eleqtrd 2285	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (𝐵‘𝑘) ∈ {0})
179		elsni 3652	. . . . . . . . 9 ⊢ ((𝐵‘𝑘) ∈ {0} → (𝐵‘𝑘) = 0)
180	178, 179	syl 14	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (𝐵‘𝑘) = 0)
181	180	oveq1d 5966	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → ((𝐵‘𝑘) · (𝑧↑𝑘)) = (0 · (𝑧↑𝑘)))
182	147, 45	sylan2 286	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (𝑧↑𝑘) ∈ ℂ)
183	182	mul02d 8471	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (0 · (𝑧↑𝑘)) = 0)
184	181, 183	eqtrd 2239	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → ((𝐵‘𝑘) · (𝑧↑𝑘)) = 0)
185	18	ad2antrr 488	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → 𝑁 ∈ ℤ)
186		fzdcel 10169	. . . . . . . 8 ⊢ ((𝑗 ∈ ℤ ∧ 0 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID 𝑗 ∈ (0...𝑁))
187	128, 129, 185, 186	syl3anc 1250	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → DECID 𝑗 ∈ (0...𝑁))
188	187	ralrimiva 2580	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → ∀𝑗 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))DECID 𝑗 ∈ (0...𝑁))
189	142, 143, 184, 188, 40	fisumss 11747	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘)) = Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))((𝐵‘𝑘) · (𝑧↑𝑘)))
190	134, 189	oveq12d 5969	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → (Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘)) + Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘))) = (Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))((𝐴‘𝑘) · (𝑧↑𝑘)) + Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))((𝐵‘𝑘) · (𝑧↑𝑘))))
191	52, 69, 190	3eqtr4d 2249	. . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴 ∘𝑓 + 𝐵)‘𝑘) · (𝑧↑𝑘)) = (Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘)) + Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘))))
192	191	mpteq2dva 4138	. 2 ⊢ (𝜑 → (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴 ∘𝑓 + 𝐵)‘𝑘) · (𝑧↑𝑘))) = (𝑧 ∈ ℂ ↦ (Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘)) + Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘)))))
193	32, 192	eqtr4d 2242	1 ⊢ (𝜑 → (𝐹 ∘𝑓 + 𝐺) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴 ∘𝑓 + 𝐵)‘𝑘) · (𝑧↑𝑘))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ∨ wo 710  DECID wdc 836   = wceq 1373   ∈ wcel 2177  Vcvv 2773   ∖ cdif 3164   ∪ cun 3165   ⊆ wss 3167  ifcif 3572  {csn 3634  {cpr 3635   class class class wbr 4047   ↦ cmpt 4109  dom cdm 4679   “ cima 4682  Fun wfun 5270  ⟶wf 5272  ‘cfv 5276  (class class class)co 5951   ∘_𝑓 cof 6163  Fincfn 6834  supcsup 7091  ℂcc 7930  ℝcr 7931  0cc0 7932  1c1 7933   + caddc 7935   · cmul 7937   < clt 8114   ≤ cle 8115   − cmin 8250  ℕ₀cn0 9302  ℤcz 9379  ℤ_≥cuz 9655  ...cfz 10137  ↑cexp 10690  Σcsu 11708  Polycply 15244

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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-coll 4163  ax-sep 4166  ax-nul 4174  ax-pow 4222  ax-pr 4257  ax-un 4484  ax-setind 4589  ax-iinf 4640  ax-cnex 8023  ax-resscn 8024  ax-1cn 8025  ax-1re 8026  ax-icn 8027  ax-addcl 8028  ax-addrcl 8029  ax-mulcl 8030  ax-mulrcl 8031  ax-addcom 8032  ax-mulcom 8033  ax-addass 8034  ax-mulass 8035  ax-distr 8036  ax-i2m1 8037  ax-0lt1 8038  ax-1rid 8039  ax-0id 8040  ax-rnegex 8041  ax-precex 8042  ax-cnre 8043  ax-pre-ltirr 8044  ax-pre-ltwlin 8045  ax-pre-lttrn 8046  ax-pre-apti 8047  ax-pre-ltadd 8048  ax-pre-mulgt0 8049  ax-pre-mulext 8050  ax-arch 8051  ax-caucvg 8052

This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-nel 2473  df-ral 2490  df-rex 2491  df-reu 2492  df-rmo 2493  df-rab 2494  df-v 2775  df-sbc 3000  df-csb 3095  df-dif 3169  df-un 3171  df-in 3173  df-ss 3180  df-nul 3462  df-if 3573  df-pw 3619  df-sn 3640  df-pr 3641  df-op 3643  df-uni 3853  df-int 3888  df-iun 3931  df-br 4048  df-opab 4110  df-mpt 4111  df-tr 4147  df-id 4344  df-po 4347  df-iso 4348  df-iord 4417  df-on 4419  df-ilim 4420  df-suc 4422  df-iom 4643  df-xp 4685  df-rel 4686  df-cnv 4687  df-co 4688  df-dm 4689  df-rn 4690  df-res 4691  df-ima 4692  df-iota 5237  df-fun 5278  df-fn 5279  df-f 5280  df-f1 5281  df-fo 5282  df-f1o 5283  df-fv 5284  df-isom 5285  df-riota 5906  df-ov 5954  df-oprab 5955  df-mpo 5956  df-of 6165  df-1st 6233  df-2nd 6234  df-recs 6398  df-irdg 6463  df-frec 6484  df-1o 6509  df-oadd 6513  df-er 6627  df-en 6835  df-dom 6836  df-fin 6837  df-sup 7093  df-pnf 8116  df-mnf 8117  df-xr 8118  df-ltxr 8119  df-le 8120  df-sub 8252  df-neg 8253  df-reap 8655  df-ap 8662  df-div 8753  df-inn 9044  df-2 9102  df-3 9103  df-4 9104  df-n0 9303  df-z 9380  df-uz 9656  df-q 9748  df-rp 9783  df-fz 10138  df-fzo 10272  df-seqfrec 10600  df-exp 10691  df-ihash 10928  df-cj 11197  df-re 11198  df-im 11199  df-rsqrt 11353  df-abs 11354  df-clim 11634  df-sumdc 11709

This theorem is referenced by:  plyaddlem  15265