plyaddlem1 - Metamath Proof Explorer

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

Theorem plyaddlem1 26116

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	⊢ (𝜑 → 𝑀 ∈ ℕ₀)
plyaddlem.n	⊢ (𝜑 → 𝑁 ∈ ℕ₀)
plyaddlem.a	⊢ (𝜑 → 𝐴:ℕ₀⟶ℂ)
plyaddlem.b	⊢ (𝜑 → 𝐵:ℕ₀⟶ℂ)
plyaddlem.a2	⊢ (𝜑 → (𝐴 “ (ℤ_≥‘(𝑀 + 1))) = {0})
plyaddlem.b2	⊢ (𝜑 → (𝐵 “ (ℤ_≥‘(𝑁 + 1))) = {0})
plyaddlem.f	⊢ (𝜑 → 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘))))
plyaddlem.g	⊢ (𝜑 → 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘))))

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

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

**Proof of Theorem plyaddlem1**
Step	Hyp	Ref	Expression
1		cnex 11090	. . . 4 ⊢ ℂ ∈ V
2	1	a1i 11	. . 3 ⊢ (𝜑 → ℂ ∈ V)
3		sumex 15595	. . . 4 ⊢ Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘)) ∈ V
4	3	a1i 11	. . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘)) ∈ V)
5		sumex 15595	. . . 4 ⊢ Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘)) ∈ V
6	5	a1i 11	. . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘)) ∈ V)
7		plyaddlem.f	. . 3 ⊢ (𝜑 → 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘))))
8		plyaddlem.g	. . 3 ⊢ (𝜑 → 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘))))
9	2, 4, 6, 7, 8	offval2 7633	. 2 ⊢ (𝜑 → (𝐹 ∘_f + 𝐺) = (𝑧 ∈ ℂ ↦ (Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘)) + Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘)))))
10		fzfid 13880	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∈ Fin)
11		elfznn0 13523	. . . . . 6 ⊢ (𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) → 𝑘 ∈ ℕ₀)
12		plyaddlem.a	. . . . . . . . 9 ⊢ (𝜑 → 𝐴:ℕ₀⟶ℂ)
13	12	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → 𝐴:ℕ₀⟶ℂ)
14	13	ffvelcdmda 7018	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ₀) → (𝐴‘𝑘) ∈ ℂ)
15		expcl 13986	. . . . . . . 8 ⊢ ((𝑧 ∈ ℂ ∧ 𝑘 ∈ ℕ₀) → (𝑧↑𝑘) ∈ ℂ)
16	15	adantll 714	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ₀) → (𝑧↑𝑘) ∈ ℂ)
17	14, 16	mulcld 11135	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ₀) → ((𝐴‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
18	11, 17	sylan2 593	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → ((𝐴‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
19		plyaddlem.b	. . . . . . . . 9 ⊢ (𝜑 → 𝐵:ℕ₀⟶ℂ)
20	19	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → 𝐵:ℕ₀⟶ℂ)
21	20	ffvelcdmda 7018	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ₀) → (𝐵‘𝑘) ∈ ℂ)
22	21, 16	mulcld 11135	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ₀) → ((𝐵‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
23	11, 22	sylan2 593	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → ((𝐵‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
24	10, 18, 23	fsumadd 15647	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴‘𝑘) · (𝑧↑𝑘)) + ((𝐵‘𝑘) · (𝑧↑𝑘))) = (Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))((𝐴‘𝑘) · (𝑧↑𝑘)) + Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))((𝐵‘𝑘) · (𝑧↑𝑘))))
25	12	ffnd 6653	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 Fn ℕ₀)
26	19	ffnd 6653	. . . . . . . . . 10 ⊢ (𝜑 → 𝐵 Fn ℕ₀)
27		nn0ex 12390	. . . . . . . . . . 11 ⊢ ℕ₀ ∈ V
28	27	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → ℕ₀ ∈ V)
29		inidm 4178	. . . . . . . . . 10 ⊢ (ℕ₀ ∩ ℕ₀) = ℕ₀
30		eqidd 2730	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ₀) → (𝐴‘𝑘) = (𝐴‘𝑘))
31		eqidd 2730	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ₀) → (𝐵‘𝑘) = (𝐵‘𝑘))
32	25, 26, 28, 28, 29, 30, 31	ofval 7624	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ₀) → ((𝐴 ∘_f + 𝐵)‘𝑘) = ((𝐴‘𝑘) + (𝐵‘𝑘)))
33	32	adantlr 715	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ₀) → ((𝐴 ∘_f + 𝐵)‘𝑘) = ((𝐴‘𝑘) + (𝐵‘𝑘)))
34	33	oveq1d 7364	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ₀) → (((𝐴 ∘_f + 𝐵)‘𝑘) · (𝑧↑𝑘)) = (((𝐴‘𝑘) + (𝐵‘𝑘)) · (𝑧↑𝑘)))
35	14, 21, 16	adddird 11140	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ₀) → (((𝐴‘𝑘) + (𝐵‘𝑘)) · (𝑧↑𝑘)) = (((𝐴‘𝑘) · (𝑧↑𝑘)) + ((𝐵‘𝑘) · (𝑧↑𝑘))))
36	34, 35	eqtrd 2764	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ℕ₀) → (((𝐴 ∘_f + 𝐵)‘𝑘) · (𝑧↑𝑘)) = (((𝐴‘𝑘) · (𝑧↑𝑘)) + ((𝐵‘𝑘) · (𝑧↑𝑘))))
37	11, 36	sylan2 593	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → (((𝐴 ∘_f + 𝐵)‘𝑘) · (𝑧↑𝑘)) = (((𝐴‘𝑘) · (𝑧↑𝑘)) + ((𝐵‘𝑘) · (𝑧↑𝑘))))
38	37	sumeq2dv 15609	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴 ∘_f + 𝐵)‘𝑘) · (𝑧↑𝑘)) = Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴‘𝑘) · (𝑧↑𝑘)) + ((𝐵‘𝑘) · (𝑧↑𝑘))))
39		plyaddlem.m	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ ℕ₀)
40	39	nn0zd 12497	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ ℤ)
41		plyaddlem.n	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
42	41, 39	ifcld 4523	. . . . . . . . . 10 ⊢ (𝜑 → if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℕ₀)
43	42	nn0zd 12497	. . . . . . . . 9 ⊢ (𝜑 → if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℤ)
44	39	nn0red 12446	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ ℝ)
45	41	nn0red 12446	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℝ)
46		max1 13087	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → 𝑀 ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀))
47	44, 45, 46	syl2anc 584	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀))
48		eluz2 12741	. . . . . . . . 9 ⊢ (if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ (ℤ_≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℤ ∧ 𝑀 ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))
49	40, 43, 47, 48	syl3anbrc 1344	. . . . . . . 8 ⊢ (𝜑 → if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ (ℤ_≥‘𝑀))
50		fzss2 13467	. . . . . . . 8 ⊢ (if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ (ℤ_≥‘𝑀) → (0...𝑀) ⊆ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))
51	49, 50	syl 17	. . . . . . 7 ⊢ (𝜑 → (0...𝑀) ⊆ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))
52	51	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → (0...𝑀) ⊆ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))
53		elfznn0 13523	. . . . . . 7 ⊢ (𝑘 ∈ (0...𝑀) → 𝑘 ∈ ℕ₀)
54	53, 17	sylan2 593	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑀)) → ((𝐴‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
55		eldifn 4083	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀)) → ¬ 𝑘 ∈ (0...𝑀))
56	55	adantl 481	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → ¬ 𝑘 ∈ (0...𝑀))
57		eldifi 4082	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀)) → 𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))
58	57, 11	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀)) → 𝑘 ∈ ℕ₀)
59	58	adantl 481	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → 𝑘 ∈ ℕ₀)
60		nn0uz 12777	. . . . . . . . . . . . . . . . . 18 ⊢ ℕ₀ = (ℤ_≥‘0)
61		peano2nn0 12424	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑀 ∈ ℕ₀ → (𝑀 + 1) ∈ ℕ₀)
62	39, 61	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → (𝑀 + 1) ∈ ℕ₀)
63	62, 60	eleqtrdi 2838	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (𝑀 + 1) ∈ (ℤ_≥‘0))
64		uzsplit 13499	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑀 + 1) ∈ (ℤ_≥‘0) → (ℤ_≥‘0) = ((0...((𝑀 + 1) − 1)) ∪ (ℤ_≥‘(𝑀 + 1))))
65	63, 64	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (ℤ_≥‘0) = ((0...((𝑀 + 1) − 1)) ∪ (ℤ_≥‘(𝑀 + 1))))
66	60, 65	eqtrid 2776	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ℕ₀ = ((0...((𝑀 + 1) − 1)) ∪ (ℤ_≥‘(𝑀 + 1))))
67	39	nn0cnd 12447	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → 𝑀 ∈ ℂ)
68		ax-1cn 11067	. . . . . . . . . . . . . . . . . . . 20 ⊢ 1 ∈ ℂ
69		pncan 11369	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑀 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑀 + 1) − 1) = 𝑀)
70	67, 68, 69	sylancl 586	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → ((𝑀 + 1) − 1) = 𝑀)
71	70	oveq2d 7365	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (0...((𝑀 + 1) − 1)) = (0...𝑀))
72	71	uneq1d 4118	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ((0...((𝑀 + 1) − 1)) ∪ (ℤ_≥‘(𝑀 + 1))) = ((0...𝑀) ∪ (ℤ_≥‘(𝑀 + 1))))
73	66, 72	eqtrd 2764	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ℕ₀ = ((0...𝑀) ∪ (ℤ_≥‘(𝑀 + 1))))
74	73	ad2antrr 726	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → ℕ₀ = ((0...𝑀) ∪ (ℤ_≥‘(𝑀 + 1))))
75	59, 74	eleqtrd 2830	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → 𝑘 ∈ ((0...𝑀) ∪ (ℤ_≥‘(𝑀 + 1))))
76		elun 4104	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ((0...𝑀) ∪ (ℤ_≥‘(𝑀 + 1))) ↔ (𝑘 ∈ (0...𝑀) ∨ 𝑘 ∈ (ℤ_≥‘(𝑀 + 1))))
77	75, 76	sylib 218	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (𝑘 ∈ (0...𝑀) ∨ 𝑘 ∈ (ℤ_≥‘(𝑀 + 1))))
78	77	ord 864	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (¬ 𝑘 ∈ (0...𝑀) → 𝑘 ∈ (ℤ_≥‘(𝑀 + 1))))
79	56, 78	mpd 15	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → 𝑘 ∈ (ℤ_≥‘(𝑀 + 1)))
80	12	ffund 6656	. . . . . . . . . . . . 13 ⊢ (𝜑 → Fun 𝐴)
81		ssun2 4130	. . . . . . . . . . . . . . 15 ⊢ (ℤ_≥‘(𝑀 + 1)) ⊆ ((0...((𝑀 + 1) − 1)) ∪ (ℤ_≥‘(𝑀 + 1)))
82	81, 66	sseqtrrid 3979	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (ℤ_≥‘(𝑀 + 1)) ⊆ ℕ₀)
83	12	fdmd 6662	. . . . . . . . . . . . . 14 ⊢ (𝜑 → dom 𝐴 = ℕ₀)
84	82, 83	sseqtrrd 3973	. . . . . . . . . . . . 13 ⊢ (𝜑 → (ℤ_≥‘(𝑀 + 1)) ⊆ dom 𝐴)
85		funfvima2 7167	. . . . . . . . . . . . 13 ⊢ ((Fun 𝐴 ∧ (ℤ_≥‘(𝑀 + 1)) ⊆ dom 𝐴) → (𝑘 ∈ (ℤ_≥‘(𝑀 + 1)) → (𝐴‘𝑘) ∈ (𝐴 “ (ℤ_≥‘(𝑀 + 1)))))
86	80, 84, 85	syl2anc 584	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑘 ∈ (ℤ_≥‘(𝑀 + 1)) → (𝐴‘𝑘) ∈ (𝐴 “ (ℤ_≥‘(𝑀 + 1)))))
87	86	ad2antrr 726	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (𝑘 ∈ (ℤ_≥‘(𝑀 + 1)) → (𝐴‘𝑘) ∈ (𝐴 “ (ℤ_≥‘(𝑀 + 1)))))
88	79, 87	mpd 15	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (𝐴‘𝑘) ∈ (𝐴 “ (ℤ_≥‘(𝑀 + 1))))
89		plyaddlem.a2	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴 “ (ℤ_≥‘(𝑀 + 1))) = {0})
90	89	ad2antrr 726	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (𝐴 “ (ℤ_≥‘(𝑀 + 1))) = {0})
91	88, 90	eleqtrd 2830	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (𝐴‘𝑘) ∈ {0})
92		elsni 4594	. . . . . . . . 9 ⊢ ((𝐴‘𝑘) ∈ {0} → (𝐴‘𝑘) = 0)
93	91, 92	syl 17	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (𝐴‘𝑘) = 0)
94	93	oveq1d 7364	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → ((𝐴‘𝑘) · (𝑧↑𝑘)) = (0 · (𝑧↑𝑘)))
95	58, 16	sylan2 593	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (𝑧↑𝑘) ∈ ℂ)
96	95	mul02d 11314	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → (0 · (𝑧↑𝑘)) = 0)
97	94, 96	eqtrd 2764	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑀))) → ((𝐴‘𝑘) · (𝑧↑𝑘)) = 0)
98	52, 54, 97, 10	fsumss 15632	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘)) = Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))((𝐴‘𝑘) · (𝑧↑𝑘)))
99	41	nn0zd 12497	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ ℤ)
100		max2 13089	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → 𝑁 ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀))
101	44, 45, 100	syl2anc 584	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀))
102		eluz2 12741	. . . . . . . . 9 ⊢ (if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ (ℤ_≥‘𝑁) ↔ (𝑁 ∈ ℤ ∧ if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℤ ∧ 𝑁 ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))
103	99, 43, 101, 102	syl3anbrc 1344	. . . . . . . 8 ⊢ (𝜑 → if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ (ℤ_≥‘𝑁))
104		fzss2 13467	. . . . . . . 8 ⊢ (if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ (ℤ_≥‘𝑁) → (0...𝑁) ⊆ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))
105	103, 104	syl 17	. . . . . . 7 ⊢ (𝜑 → (0...𝑁) ⊆ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))
106	105	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → (0...𝑁) ⊆ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))
107		elfznn0 13523	. . . . . . 7 ⊢ (𝑘 ∈ (0...𝑁) → 𝑘 ∈ ℕ₀)
108	107, 22	sylan2 593	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑁)) → ((𝐵‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
109		eldifn 4083	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁)) → ¬ 𝑘 ∈ (0...𝑁))
110	109	adantl 481	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → ¬ 𝑘 ∈ (0...𝑁))
111		eldifi 4082	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁)) → 𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))
112	111, 11	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁)) → 𝑘 ∈ ℕ₀)
113	112	adantl 481	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → 𝑘 ∈ ℕ₀)
114		peano2nn0 12424	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑁 ∈ ℕ₀ → (𝑁 + 1) ∈ ℕ₀)
115	41, 114	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → (𝑁 + 1) ∈ ℕ₀)
116	115, 60	eleqtrdi 2838	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (𝑁 + 1) ∈ (ℤ_≥‘0))
117		uzsplit 13499	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑁 + 1) ∈ (ℤ_≥‘0) → (ℤ_≥‘0) = ((0...((𝑁 + 1) − 1)) ∪ (ℤ_≥‘(𝑁 + 1))))
118	116, 117	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (ℤ_≥‘0) = ((0...((𝑁 + 1) − 1)) ∪ (ℤ_≥‘(𝑁 + 1))))
119	60, 118	eqtrid 2776	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ℕ₀ = ((0...((𝑁 + 1) − 1)) ∪ (ℤ_≥‘(𝑁 + 1))))
120	41	nn0cnd 12447	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → 𝑁 ∈ ℂ)
121		pncan 11369	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑁 + 1) − 1) = 𝑁)
122	120, 68, 121	sylancl 586	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → ((𝑁 + 1) − 1) = 𝑁)
123	122	oveq2d 7365	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (0...((𝑁 + 1) − 1)) = (0...𝑁))
124	123	uneq1d 4118	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ((0...((𝑁 + 1) − 1)) ∪ (ℤ_≥‘(𝑁 + 1))) = ((0...𝑁) ∪ (ℤ_≥‘(𝑁 + 1))))
125	119, 124	eqtrd 2764	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ℕ₀ = ((0...𝑁) ∪ (ℤ_≥‘(𝑁 + 1))))
126	125	ad2antrr 726	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → ℕ₀ = ((0...𝑁) ∪ (ℤ_≥‘(𝑁 + 1))))
127	113, 126	eleqtrd 2830	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → 𝑘 ∈ ((0...𝑁) ∪ (ℤ_≥‘(𝑁 + 1))))
128		elun 4104	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ((0...𝑁) ∪ (ℤ_≥‘(𝑁 + 1))) ↔ (𝑘 ∈ (0...𝑁) ∨ 𝑘 ∈ (ℤ_≥‘(𝑁 + 1))))
129	127, 128	sylib 218	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (𝑘 ∈ (0...𝑁) ∨ 𝑘 ∈ (ℤ_≥‘(𝑁 + 1))))
130	129	ord 864	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (¬ 𝑘 ∈ (0...𝑁) → 𝑘 ∈ (ℤ_≥‘(𝑁 + 1))))
131	110, 130	mpd 15	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → 𝑘 ∈ (ℤ_≥‘(𝑁 + 1)))
132	19	ffund 6656	. . . . . . . . . . . . 13 ⊢ (𝜑 → Fun 𝐵)
133		ssun2 4130	. . . . . . . . . . . . . . 15 ⊢ (ℤ_≥‘(𝑁 + 1)) ⊆ ((0...((𝑁 + 1) − 1)) ∪ (ℤ_≥‘(𝑁 + 1)))
134	133, 119	sseqtrrid 3979	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (ℤ_≥‘(𝑁 + 1)) ⊆ ℕ₀)
135	19	fdmd 6662	. . . . . . . . . . . . . 14 ⊢ (𝜑 → dom 𝐵 = ℕ₀)
136	134, 135	sseqtrrd 3973	. . . . . . . . . . . . 13 ⊢ (𝜑 → (ℤ_≥‘(𝑁 + 1)) ⊆ dom 𝐵)
137		funfvima2 7167	. . . . . . . . . . . . 13 ⊢ ((Fun 𝐵 ∧ (ℤ_≥‘(𝑁 + 1)) ⊆ dom 𝐵) → (𝑘 ∈ (ℤ_≥‘(𝑁 + 1)) → (𝐵‘𝑘) ∈ (𝐵 “ (ℤ_≥‘(𝑁 + 1)))))
138	132, 136, 137	syl2anc 584	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑘 ∈ (ℤ_≥‘(𝑁 + 1)) → (𝐵‘𝑘) ∈ (𝐵 “ (ℤ_≥‘(𝑁 + 1)))))
139	138	ad2antrr 726	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (𝑘 ∈ (ℤ_≥‘(𝑁 + 1)) → (𝐵‘𝑘) ∈ (𝐵 “ (ℤ_≥‘(𝑁 + 1)))))
140	131, 139	mpd 15	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (𝐵‘𝑘) ∈ (𝐵 “ (ℤ_≥‘(𝑁 + 1))))
141		plyaddlem.b2	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐵 “ (ℤ_≥‘(𝑁 + 1))) = {0})
142	141	ad2antrr 726	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (𝐵 “ (ℤ_≥‘(𝑁 + 1))) = {0})
143	140, 142	eleqtrd 2830	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (𝐵‘𝑘) ∈ {0})
144		elsni 4594	. . . . . . . . 9 ⊢ ((𝐵‘𝑘) ∈ {0} → (𝐵‘𝑘) = 0)
145	143, 144	syl 17	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (𝐵‘𝑘) = 0)
146	145	oveq1d 7364	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → ((𝐵‘𝑘) · (𝑧↑𝑘)) = (0 · (𝑧↑𝑘)))
147	112, 16	sylan2 593	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (𝑧↑𝑘) ∈ ℂ)
148	147	mul02d 11314	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → (0 · (𝑧↑𝑘)) = 0)
149	146, 148	eqtrd 2764	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∖ (0...𝑁))) → ((𝐵‘𝑘) · (𝑧↑𝑘)) = 0)
150	106, 108, 149, 10	fsumss 15632	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘)) = Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))((𝐵‘𝑘) · (𝑧↑𝑘)))
151	98, 150	oveq12d 7367	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → (Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘)) + Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘))) = (Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))((𝐴‘𝑘) · (𝑧↑𝑘)) + Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))((𝐵‘𝑘) · (𝑧↑𝑘))))
152	24, 38, 151	3eqtr4d 2774	. . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴 ∘_f + 𝐵)‘𝑘) · (𝑧↑𝑘)) = (Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘)) + Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘))))
153	152	mpteq2dva 5185	. 2 ⊢ (𝜑 → (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴 ∘_f + 𝐵)‘𝑘) · (𝑧↑𝑘))) = (𝑧 ∈ ℂ ↦ (Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘)) + Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘)))))
154	9, 153	eqtr4d 2767	1 ⊢ (𝜑 → (𝐹 ∘_f + 𝐺) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴 ∘_f + 𝐵)‘𝑘) · (𝑧↑𝑘))))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∨ wo 847 = wceq 1540 ∈ wcel 2109 Vcvv 3436 ∖ cdif 3900 ∪ cun 3901 ⊆ wss 3903 ifcif 4476 {csn 4577 class class class wbr 5092 ↦ cmpt 5173 dom cdm 5619 “ cima 5622 Fun wfun 6476 ⟶wf 6478 ‘cfv 6482 (class class class)co 7349 ∘_f cof 7611 ℂcc 11007 ℝcr 11008 0cc0 11009 1c1 11010 + caddc 11012 · cmul 11014 ≤ cle 11150 − cmin 11347 ℕ₀cn0 12384 ℤcz 12471 ℤ_≥cuz 12735 ...cfz 13410 ↑cexp 13968 Σcsu 15593 Polycply 26087

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5218 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671 ax-inf2 9537 ax-cnex 11065 ax-resscn 11066 ax-1cn 11067 ax-icn 11068 ax-addcl 11069 ax-addrcl 11070 ax-mulcl 11071 ax-mulrcl 11072 ax-mulcom 11073 ax-addass 11074 ax-mulass 11075 ax-distr 11076 ax-i2m1 11077 ax-1ne0 11078 ax-1rid 11079 ax-rnegex 11080 ax-rrecex 11081 ax-cnre 11082 ax-pre-lttri 11083 ax-pre-lttrn 11084 ax-pre-ltadd 11085 ax-pre-mulgt0 11086 ax-pre-sup 11087

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3343 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-int 4897 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5174 df-tr 5200 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-se 5573 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6249 df-ord 6310 df-on 6311 df-lim 6312 df-suc 6313 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-isom 6491 df-riota 7306 df-ov 7352 df-oprab 7353 df-mpo 7354 df-of 7613 df-om 7800 df-1st 7924 df-2nd 7925 df-frecs 8214 df-wrecs 8245 df-recs 8294 df-rdg 8332 df-1o 8388 df-er 8625 df-en 8873 df-dom 8874 df-sdom 8875 df-fin 8876 df-sup 9332 df-oi 9402 df-card 9835 df-pnf 11151 df-mnf 11152 df-xr 11153 df-ltxr 11154 df-le 11155 df-sub 11349 df-neg 11350 df-div 11778 df-nn 12129 df-2 12191 df-3 12192 df-n0 12385 df-z 12472 df-uz 12736 df-rp 12894 df-fz 13411 df-fzo 13558 df-seq 13909 df-exp 13969 df-hash 14238 df-cj 15006 df-re 15007 df-im 15008 df-sqrt 15142 df-abs 15143 df-clim 15395 df-sum 15594

This theorem is referenced by: plyaddlem 26118 coeaddlem 26152

W3C validator