Theorem plyaddlem1 15386

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 8091	. . . 4 ⊢ ℂ ∈ V
2	1	a1i 9	. . 3 ⊢ (𝜑 → ℂ ∈ V)
3		0zd 9426	. . . . . 6 ⊢ (𝜑 → 0 ∈ ℤ)
4		plyaddlem.m	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℕ0)
5	4	nn0zd 9535	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ)
6	3, 5	fzfigd 10620	. . . . 5 ⊢ (𝜑 → (0...𝑀) ∈ Fin)
7	6	adantr 276	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → (0...𝑀) ∈ Fin)
8		plyaddlem.a	. . . . . . 7 ⊢ (𝜑 → 𝐴:ℕ0⟶ℂ)
9	8	ad2antrr 488	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑀)) → 𝐴:ℕ0⟶ℂ)
10		elfznn0 10278	. . . . . . 7 ⊢ (𝑘 ∈ (0...𝑀) → 𝑘 ∈ ℕ0)
11	10	adantl 277	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑀)) → 𝑘 ∈ ℕ0)
12	9, 11	ffvelcdmd 5744	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑀)) → (𝐴‘𝑘) ∈ ℂ)
13		simplr 528	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑀)) → 𝑧 ∈ ℂ)
14	13, 11	expcld 10862	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑀)) → (𝑧↑𝑘) ∈ ℂ)
15	12, 14	mulcld 8135	. . . 4 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑀)) → ((𝐴‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
16	7, 15	fsumcl 11877	. . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
17		plyaddlem.n	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℕ0)
18	17	nn0zd 9535	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℤ)
19	3, 18	fzfigd 10620	. . . . 5 ⊢ (𝜑 → (0...𝑁) ∈ Fin)
20	19	adantr 276	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → (0...𝑁) ∈ Fin)
21		plyaddlem.b	. . . . . . 7 ⊢ (𝜑 → 𝐵:ℕ0⟶ℂ)
22	21	ad2antrr 488	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑁)) → 𝐵:ℕ0⟶ℂ)
23		elfznn0 10278	. . . . . . 7 ⊢ (𝑘 ∈ (0...𝑁) → 𝑘 ∈ ℕ0)
24	23	adantl 277	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑁)) → 𝑘 ∈ ℕ0)
25	22, 24	ffvelcdmd 5744	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑁)) → (𝐵‘𝑘) ∈ ℂ)
26		simplr 528	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑁)) → 𝑧 ∈ ℂ)
27	26, 24	expcld 10862	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑁)) → (𝑧↑𝑘) ∈ ℂ)
28	25, 27	mulcld 8135	. . . 4 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑁)) → ((𝐵‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
29	20, 28	fsumcl 11877	. . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
30		plyaddlem.f	. . 3 ⊢ (𝜑 → 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘))))
31		plyaddlem.g	. . 3 ⊢ (𝜑 → 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘))))
32	2, 16, 29, 30, 31	offval2 6204	. 2 ⊢ (𝜑 → (𝐹 ∘𝑓 + 𝐺) = (𝑧 ∈ ℂ ↦ (Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘)) + Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘)))))
33		0zd 9426	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → 0 ∈ ℤ)
34		2zsupmax 11703	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → sup({𝑀, 𝑁}, ℝ, < ) = if(𝑀 ≤ 𝑁, 𝑁, 𝑀))
35	5, 18, 34	syl2anc 411	. . . . . . . 8 ⊢ (𝜑 → sup({𝑀, 𝑁}, ℝ, < ) = if(𝑀 ≤ 𝑁, 𝑁, 𝑀))
36		zmaxcl 11701	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → sup({𝑀, 𝑁}, ℝ, < ) ∈ ℤ)
37	5, 18, 36	syl2anc 411	. . . . . . . 8 ⊢ (𝜑 → sup({𝑀, 𝑁}, ℝ, < ) ∈ ℤ)
38	35, 37	eqeltrrd 2287	. . . . . . 7 ⊢ (𝜑 → if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℤ)
39	38	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℤ)
40	33, 39	fzfigd 10620	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∈ Fin)
41		elfznn0 10278	. . . . . 6 ⊢ (𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) → 𝑘 ∈ ℕ0)
42	8	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → 𝐴:ℕ0⟶ℂ)
43	42	ffvelcdmda 5743	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ0) → (𝐴‘𝑘) ∈ ℂ)
44		expcl 10746	. . . . . . . 8 ⊢ ((𝑧 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (𝑧↑𝑘) ∈ ℂ)
45	44	adantll 476	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ0) → (𝑧↑𝑘) ∈ ℂ)
46	43, 45	mulcld 8135	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ0) → ((𝐴‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
47	41, 46	sylan2 286	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → ((𝐴‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
48	21	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → 𝐵:ℕ0⟶ℂ)
49	48	ffvelcdmda 5743	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ0) → (𝐵‘𝑘) ∈ ℂ)
50	49, 45	mulcld 8135	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ0) → ((𝐵‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
51	41, 50	sylan2 286	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → ((𝐵‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
52	40, 47, 51	fsumadd 11883	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴‘𝑘) · (𝑧↑𝑘)) + ((𝐵‘𝑘) · (𝑧↑𝑘))) = (Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))((𝐴‘𝑘) · (𝑧↑𝑘)) + Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))((𝐵‘𝑘) · (𝑧↑𝑘))))
53	8	ffnd 5450	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 Fn ℕ0)
54	21	ffnd 5450	. . . . . . . . . 10 ⊢ (𝜑 → 𝐵 Fn ℕ0)
55		nn0ex 9343	. . . . . . . . . . 11 ⊢ ℕ0 ∈ V
56	55	a1i 9	. . . . . . . . . 10 ⊢ (𝜑 → ℕ0 ∈ V)
57		inidm 3393	. . . . . . . . . 10 ⊢ (ℕ0 ∩ ℕ0) = ℕ0
58		eqidd 2210	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐴‘𝑘) = (𝐴‘𝑘))
59		eqidd 2210	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐵‘𝑘) = (𝐵‘𝑘))
60	8	ffvelcdmda 5743	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐴‘𝑘) ∈ ℂ)
61	21	ffvelcdmda 5743	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐵‘𝑘) ∈ ℂ)
62	60, 61	addcld 8134	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝐴‘𝑘) + (𝐵‘𝑘)) ∈ ℂ)
63	53, 54, 56, 56, 57, 58, 59, 62	ofvalg 6198	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝐴 ∘𝑓 + 𝐵)‘𝑘) = ((𝐴‘𝑘) + (𝐵‘𝑘)))
64	63	adantlr 477	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ0) → ((𝐴 ∘𝑓 + 𝐵)‘𝑘) = ((𝐴‘𝑘) + (𝐵‘𝑘)))
65	64	oveq1d 5989	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ0) → (((𝐴 ∘𝑓 + 𝐵)‘𝑘) · (𝑧↑𝑘)) = (((𝐴‘𝑘) + (𝐵‘𝑘)) · (𝑧↑𝑘)))
66	43, 49, 45	adddird 8140	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ0) → (((𝐴‘𝑘) + (𝐵‘𝑘)) · (𝑧↑𝑘)) = (((𝐴‘𝑘) · (𝑧↑𝑘)) + ((𝐵‘𝑘) · (𝑧↑𝑘))))
67	65, 66	eqtrd 2242	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ0) → (((𝐴 ∘𝑓 + 𝐵)‘𝑘) · (𝑧↑𝑘)) = (((𝐴‘𝑘) · (𝑧↑𝑘)) + ((𝐵‘𝑘) · (𝑧↑𝑘))))
68	41, 67	sylan2 286	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → (((𝐴 ∘𝑓 + 𝐵)‘𝑘) · (𝑧↑𝑘)) = (((𝐴‘𝑘) · (𝑧↑𝑘)) + ((𝐵‘𝑘) · (𝑧↑𝑘))))
69	68	sumeq2dv 11845	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴 ∘𝑓 + 𝐵)‘𝑘) · (𝑧↑𝑘)) = Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴‘𝑘) · (𝑧↑𝑘)) + ((𝐵‘𝑘) · (𝑧↑𝑘))))
70		zdcle 9491	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID 𝑀 ≤ 𝑁)
71	5, 18, 70	syl2anc 411	. . . . . . . . . 10 ⊢ (𝜑 → DECID 𝑀 ≤ 𝑁)
72	18, 5, 71	ifcldcd 3620	. . . . . . . . 9 ⊢ (𝜑 → if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℤ)
73	4	nn0red 9391	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑀 ∈ ℝ)
74	17	nn0red 9391	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑁 ∈ ℝ)
75		maxle1 11688	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → 𝑀 ≤ sup({𝑀, 𝑁}, ℝ, < ))
76	73, 74, 75	syl2anc 411	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ≤ sup({𝑀, 𝑁}, ℝ, < ))
77	76, 35	breqtrd 4088	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀))
78		eluz2 9696	. . . . . . . . 9 ⊢ (if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℤ ∧ 𝑀 ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))
79	5, 72, 77, 78	syl3anbrc 1186	. . . . . . . 8 ⊢ (𝜑 → if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ (ℤ≥‘𝑀))
80		fzss2 10228	. . . . . . . 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 3307	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀)) → ¬ 𝑘 ∈ (0...𝑀))
85	84	adantl 277	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → ¬ 𝑘 ∈ (0...𝑀))
86		eldifi 3306	. . . . . . . . . . . . . . . . 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 9725	. . . . . . . . . . . . . . . . . 18 ⊢ ℕ0 = (ℤ≥‘0)
90		peano2nn0 9377	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑀 ∈ ℕ0 → (𝑀 + 1) ∈ ℕ0)
91	4, 90	syl 14	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → (𝑀 + 1) ∈ ℕ0)
92	91, 89	eleqtrdi 2302	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (𝑀 + 1) ∈ (ℤ≥‘0))
93		uzsplit 10256	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑀 + 1) ∈ (ℤ≥‘0) → (ℤ≥‘0) = ((0...((𝑀 + 1) − 1)) ∪ (ℤ≥‘(𝑀 + 1))))
94	92, 93	syl 14	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (ℤ≥‘0) = ((0...((𝑀 + 1) − 1)) ∪ (ℤ≥‘(𝑀 + 1))))
95	89, 94	eqtrid 2254	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ℕ0 = ((0...((𝑀 + 1) − 1)) ∪ (ℤ≥‘(𝑀 + 1))))
96	4	nn0cnd 9392	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → 𝑀 ∈ ℂ)
97		ax-1cn 8060	. . . . . . . . . . . . . . . . . . . 20 ⊢ 1 ∈ ℂ
98		pncan 8320	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑀 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑀 + 1) − 1) = 𝑀)
99	96, 97, 98	sylancl 413	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → ((𝑀 + 1) − 1) = 𝑀)
100	99	oveq2d 5990	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (0...((𝑀 + 1) − 1)) = (0...𝑀))
101	100	uneq1d 3337	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ((0...((𝑀 + 1) − 1)) ∪ (ℤ≥‘(𝑀 + 1))) = ((0...𝑀) ∪ (ℤ≥‘(𝑀 + 1))))
102	95, 101	eqtrd 2242	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ℕ0 = ((0...𝑀) ∪ (ℤ≥‘(𝑀 + 1))))
103	102	ad2antrr 488	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → ℕ0 = ((0...𝑀) ∪ (ℤ≥‘(𝑀 + 1))))
104	88, 103	eleqtrd 2288	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → 𝑘 ∈ ((0...𝑀) ∪ (ℤ≥‘(𝑀 + 1))))
105		elun 3325	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ((0...𝑀) ∪ (ℤ≥‘(𝑀 + 1))) ↔ (𝑘 ∈ (0...𝑀) ∨ 𝑘 ∈ (ℤ≥‘(𝑀 + 1))))
106	104, 105	sylib 122	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (𝑘 ∈ (0...𝑀) ∨ 𝑘 ∈ (ℤ≥‘(𝑀 + 1))))
107	106	ord 728	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (¬ 𝑘 ∈ (0...𝑀) → 𝑘 ∈ (ℤ≥‘(𝑀 + 1))))
108	85, 107	mpd 13	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → 𝑘 ∈ (ℤ≥‘(𝑀 + 1)))
109	8	ffund 5453	. . . . . . . . . . . . 13 ⊢ (𝜑 → Fun 𝐴)
110		ssun2 3348	. . . . . . . . . . . . . . 15 ⊢ (ℤ≥‘(𝑀 + 1)) ⊆ ((0...((𝑀 + 1) − 1)) ∪ (ℤ≥‘(𝑀 + 1)))
111	110, 95	sseqtrrid 3255	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (ℤ≥‘(𝑀 + 1)) ⊆ ℕ0)
112	8	fdmd 5456	. . . . . . . . . . . . . 14 ⊢ (𝜑 → dom 𝐴 = ℕ0)
113	111, 112	sseqtrrd 3243	. . . . . . . . . . . . 13 ⊢ (𝜑 → (ℤ≥‘(𝑀 + 1)) ⊆ dom 𝐴)
114		funfvima2 5845	. . . . . . . . . . . . 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 2288	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (𝐴‘𝑘) ∈ {0})
121		elsni 3664	. . . . . . . . 9 ⊢ ((𝐴‘𝑘) ∈ {0} → (𝐴‘𝑘) = 0)
122	120, 121	syl 14	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (𝐴‘𝑘) = 0)
123	122	oveq1d 5989	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → ((𝐴‘𝑘) · (𝑧↑𝑘)) = (0 · (𝑧↑𝑘)))
124	87, 45	sylan2 286	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (𝑧↑𝑘) ∈ ℂ)
125	124	mul02d 8506	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (0 · (𝑧↑𝑘)) = 0)
126	123, 125	eqtrd 2242	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → ((𝐴‘𝑘) · (𝑧↑𝑘)) = 0)
127		elfzelz 10189	. . . . . . . . 9 ⊢ (𝑗 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) → 𝑗 ∈ ℤ)
128	127	adantl 277	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → 𝑗 ∈ ℤ)
129		0zd 9426	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → 0 ∈ ℤ)
130	5	ad2antrr 488	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → 𝑀 ∈ ℤ)
131		fzdcel 10204	. . . . . . . 8 ⊢ ((𝑗 ∈ ℤ ∧ 0 ∈ ℤ ∧ 𝑀 ∈ ℤ) → DECID 𝑗 ∈ (0...𝑀))
132	128, 129, 130, 131	syl3anc 1252	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → DECID 𝑗 ∈ (0...𝑀))
133	132	ralrimiva 2583	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → ∀𝑗 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))DECID 𝑗 ∈ (0...𝑀))
134	82, 83, 126, 133, 40	fisumss 11869	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘)) = Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))((𝐴‘𝑘) · (𝑧↑𝑘)))
135		maxle2 11689	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → 𝑁 ≤ sup({𝑀, 𝑁}, ℝ, < ))
136	73, 74, 135	syl2anc 411	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ≤ sup({𝑀, 𝑁}, ℝ, < ))
137	136, 35	breqtrd 4088	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀))
138		eluz2 9696	. . . . . . . . 9 ⊢ (if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ (ℤ≥‘𝑁) ↔ (𝑁 ∈ ℤ ∧ if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℤ ∧ 𝑁 ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))
139	18, 72, 137, 138	syl3anbrc 1186	. . . . . . . 8 ⊢ (𝜑 → if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ (ℤ≥‘𝑁))
140		fzss2 10228	. . . . . . . 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 3307	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁)) → ¬ 𝑘 ∈ (0...𝑁))
145	144	adantl 277	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → ¬ 𝑘 ∈ (0...𝑁))
146		eldifi 3306	. . . . . . . . . . . . . . . . 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 9377	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0)
150	17, 149	syl 14	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → (𝑁 + 1) ∈ ℕ0)
151	150, 89	eleqtrdi 2302	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (𝑁 + 1) ∈ (ℤ≥‘0))
152		uzsplit 10256	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑁 + 1) ∈ (ℤ≥‘0) → (ℤ≥‘0) = ((0...((𝑁 + 1) − 1)) ∪ (ℤ≥‘(𝑁 + 1))))
153	151, 152	syl 14	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (ℤ≥‘0) = ((0...((𝑁 + 1) − 1)) ∪ (ℤ≥‘(𝑁 + 1))))
154	89, 153	eqtrid 2254	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ℕ0 = ((0...((𝑁 + 1) − 1)) ∪ (ℤ≥‘(𝑁 + 1))))
155	17	nn0cnd 9392	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → 𝑁 ∈ ℂ)
156		pncan 8320	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑁 + 1) − 1) = 𝑁)
157	155, 97, 156	sylancl 413	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → ((𝑁 + 1) − 1) = 𝑁)
158	157	oveq2d 5990	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (0...((𝑁 + 1) − 1)) = (0...𝑁))
159	158	uneq1d 3337	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ((0...((𝑁 + 1) − 1)) ∪ (ℤ≥‘(𝑁 + 1))) = ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1))))
160	154, 159	eqtrd 2242	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ℕ0 = ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1))))
161	160	ad2antrr 488	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → ℕ0 = ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1))))
162	148, 161	eleqtrd 2288	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → 𝑘 ∈ ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1))))
163		elun 3325	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1))) ↔ (𝑘 ∈ (0...𝑁) ∨ 𝑘 ∈ (ℤ≥‘(𝑁 + 1))))
164	162, 163	sylib 122	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (𝑘 ∈ (0...𝑁) ∨ 𝑘 ∈ (ℤ≥‘(𝑁 + 1))))
165	164	ord 728	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (¬ 𝑘 ∈ (0...𝑁) → 𝑘 ∈ (ℤ≥‘(𝑁 + 1))))
166	145, 165	mpd 13	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → 𝑘 ∈ (ℤ≥‘(𝑁 + 1)))
167	21	ffund 5453	. . . . . . . . . . . . 13 ⊢ (𝜑 → Fun 𝐵)
168		ssun2 3348	. . . . . . . . . . . . . . 15 ⊢ (ℤ≥‘(𝑁 + 1)) ⊆ ((0...((𝑁 + 1) − 1)) ∪ (ℤ≥‘(𝑁 + 1)))
169	168, 154	sseqtrrid 3255	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (ℤ≥‘(𝑁 + 1)) ⊆ ℕ0)
170	21	fdmd 5456	. . . . . . . . . . . . . 14 ⊢ (𝜑 → dom 𝐵 = ℕ0)
171	169, 170	sseqtrrd 3243	. . . . . . . . . . . . 13 ⊢ (𝜑 → (ℤ≥‘(𝑁 + 1)) ⊆ dom 𝐵)
172		funfvima2 5845	. . . . . . . . . . . . 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 2288	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (𝐵‘𝑘) ∈ {0})
179		elsni 3664	. . . . . . . . 9 ⊢ ((𝐵‘𝑘) ∈ {0} → (𝐵‘𝑘) = 0)
180	178, 179	syl 14	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (𝐵‘𝑘) = 0)
181	180	oveq1d 5989	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → ((𝐵‘𝑘) · (𝑧↑𝑘)) = (0 · (𝑧↑𝑘)))
182	147, 45	sylan2 286	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (𝑧↑𝑘) ∈ ℂ)
183	182	mul02d 8506	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (0 · (𝑧↑𝑘)) = 0)
184	181, 183	eqtrd 2242	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → ((𝐵‘𝑘) · (𝑧↑𝑘)) = 0)
185	18	ad2antrr 488	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → 𝑁 ∈ ℤ)
186		fzdcel 10204	. . . . . . . 8 ⊢ ((𝑗 ∈ ℤ ∧ 0 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID 𝑗 ∈ (0...𝑁))
187	128, 129, 185, 186	syl3anc 1252	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → DECID 𝑗 ∈ (0...𝑁))
188	187	ralrimiva 2583	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → ∀𝑗 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))DECID 𝑗 ∈ (0...𝑁))
189	142, 143, 184, 188, 40	fisumss 11869	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘)) = Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))((𝐵‘𝑘) · (𝑧↑𝑘)))
190	134, 189	oveq12d 5992	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → (Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘)) + Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘))) = (Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))((𝐴‘𝑘) · (𝑧↑𝑘)) + Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))((𝐵‘𝑘) · (𝑧↑𝑘))))
191	52, 69, 190	3eqtr4d 2252	. . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴 ∘𝑓 + 𝐵)‘𝑘) · (𝑧↑𝑘)) = (Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘)) + Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘))))
192	191	mpteq2dva 4153	. 2 ⊢ (𝜑 → (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴 ∘𝑓 + 𝐵)‘𝑘) · (𝑧↑𝑘))) = (𝑧 ∈ ℂ ↦ (Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘)) + Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘)))))
193	32, 192	eqtr4d 2245	1 ⊢ (𝜑 → (𝐹 ∘𝑓 + 𝐺) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴 ∘𝑓 + 𝐵)‘𝑘) · (𝑧↑𝑘))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ∨ wo 712  DECID wdc 838   = wceq 1375   ∈ wcel 2180  Vcvv 2779   ∖ cdif 3174   ∪ cun 3175   ⊆ wss 3177  ifcif 3582  {csn 3646  {cpr 3647   class class class wbr 4062   ↦ cmpt 4124  dom cdm 4696   “ cima 4699  Fun wfun 5288  ⟶wf 5290  ‘cfv 5294  (class class class)co 5974   ∘_𝑓 cof 6186  Fincfn 6857  supcsup 7117  ℂcc 7965  ℝcr 7966  0cc0 7967  1c1 7968   + caddc 7970   · cmul 7972   < clt 8149   ≤ cle 8150   − cmin 8285  ℕ₀cn0 9337  ℤcz 9414  ℤ_≥cuz 9690  ...cfz 10172  ↑cexp 10727  Σcsu 11830  Polycply 15367

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 617  ax-in2 618  ax-io 713  ax-5 1473  ax-7 1474  ax-gen 1475  ax-ie1 1519  ax-ie2 1520  ax-8 1530  ax-10 1531  ax-11 1532  ax-i12 1533  ax-bndl 1535  ax-4 1536  ax-17 1552  ax-i9 1556  ax-ial 1560  ax-i5r 1561  ax-13 2182  ax-14 2183  ax-ext 2191  ax-coll 4178  ax-sep 4181  ax-nul 4189  ax-pow 4237  ax-pr 4272  ax-un 4501  ax-setind 4606  ax-iinf 4657  ax-cnex 8058  ax-resscn 8059  ax-1cn 8060  ax-1re 8061  ax-icn 8062  ax-addcl 8063  ax-addrcl 8064  ax-mulcl 8065  ax-mulrcl 8066  ax-addcom 8067  ax-mulcom 8068  ax-addass 8069  ax-mulass 8070  ax-distr 8071  ax-i2m1 8072  ax-0lt1 8073  ax-1rid 8074  ax-0id 8075  ax-rnegex 8076  ax-precex 8077  ax-cnre 8078  ax-pre-ltirr 8079  ax-pre-ltwlin 8080  ax-pre-lttrn 8081  ax-pre-apti 8082  ax-pre-ltadd 8083  ax-pre-mulgt0 8084  ax-pre-mulext 8085  ax-arch 8086  ax-caucvg 8087

This theorem depends on definitions:  df-bi 117  df-dc 839  df-3or 984  df-3an 985  df-tru 1378  df-fal 1381  df-nf 1487  df-sb 1789  df-eu 2060  df-mo 2061  df-clab 2196  df-cleq 2202  df-clel 2205  df-nfc 2341  df-ne 2381  df-nel 2476  df-ral 2493  df-rex 2494  df-reu 2495  df-rmo 2496  df-rab 2497  df-v 2781  df-sbc 3009  df-csb 3105  df-dif 3179  df-un 3181  df-in 3183  df-ss 3190  df-nul 3472  df-if 3583  df-pw 3631  df-sn 3652  df-pr 3653  df-op 3655  df-uni 3868  df-int 3903  df-iun 3946  df-br 4063  df-opab 4125  df-mpt 4126  df-tr 4162  df-id 4361  df-po 4364  df-iso 4365  df-iord 4434  df-on 4436  df-ilim 4437  df-suc 4439  df-iom 4660  df-xp 4702  df-rel 4703  df-cnv 4704  df-co 4705  df-dm 4706  df-rn 4707  df-res 4708  df-ima 4709  df-iota 5254  df-fun 5296  df-fn 5297  df-f 5298  df-f1 5299  df-fo 5300  df-f1o 5301  df-fv 5302  df-isom 5303  df-riota 5927  df-ov 5977  df-oprab 5978  df-mpo 5979  df-of 6188  df-1st 6256  df-2nd 6257  df-recs 6421  df-irdg 6486  df-frec 6507  df-1o 6532  df-oadd 6536  df-er 6650  df-en 6858  df-dom 6859  df-fin 6860  df-sup 7119  df-pnf 8151  df-mnf 8152  df-xr 8153  df-ltxr 8154  df-le 8155  df-sub 8287  df-neg 8288  df-reap 8690  df-ap 8697  df-div 8788  df-inn 9079  df-2 9137  df-3 9138  df-4 9139  df-n0 9338  df-z 9415  df-uz 9691  df-q 9783  df-rp 9818  df-fz 10173  df-fzo 10307  df-seqfrec 10637  df-exp 10728  df-ihash 10965  df-cj 11319  df-re 11320  df-im 11321  df-rsqrt 11475  df-abs 11476  df-clim 11756  df-sumdc 11831

This theorem is referenced by:  plyaddlem  15388