dvply1 - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > dvply1		GIF version

Theorem dvply1 16003

Description: Derivative of a polynomial, explicit sum version. (Contributed by Stefan O'Rear, 13-Nov-2014.) (Revised by Mario Carneiro, 11-Feb-2015.)

**Hypotheses**
Ref	Expression
dvply1.f	⊢ (𝜑 → 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · (𝑧↑𝑘))))
dvply1.g	⊢ (𝜑 → 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...(𝑁 − 1))((𝐵‘𝑘) · (𝑧↑𝑘))))
dvply1.a	⊢ (𝜑 → 𝐴:ℕ₀⟶ℂ)
dvply1.b	⊢ 𝐵 = (𝑘 ∈ ℕ₀ ↦ ((𝑘 + 1) · (𝐴‘(𝑘 + 1))))
dvply1.n	⊢ (𝜑 → 𝑁 ∈ ℕ₀)

**Assertion**
Ref	Expression
dvply1	⊢ (𝜑 → (ℂ D 𝐹) = 𝐺)

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

Proof of Theorem dvply1 Dummy variable 𝑗 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dvply1.f	. . 3 ⊢ (𝜑 → 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · (𝑧↑𝑘))))
2	1	oveq2d 6104	. 2 ⊢ (𝜑 → (ℂ D 𝐹) = (ℂ D (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · (𝑧↑𝑘)))))
3		eqid 2238	. . . . 5 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
4	3	cnfldtopon 15778	. . . 4 ⊢ (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ)
5	4	toponrestid 15259	. . 3 ⊢ (TopOpen‘ℂ_fld) = ((TopOpen‘ℂ_fld) ↾_t ℂ)
6		cnelprrecn 8322	. . . 4 ⊢ ℂ ∈ {ℝ, ℂ}
7	6	a1i 9	. . 3 ⊢ (𝜑 → ℂ ∈ {ℝ, ℂ})
8	3	cnfldtop 15779	. . . 4 ⊢ (TopOpen‘ℂ_fld) ∈ Top
9		unicntop 15781	. . . . 5 ⊢ ℂ = ∪ (TopOpen‘ℂ_fld)
10	9	topopn 15246	. . . 4 ⊢ ((TopOpen‘ℂ_fld) ∈ Top → ℂ ∈ (TopOpen‘ℂ_fld))
11	8, 10	mp1i 10	. . 3 ⊢ (𝜑 → ℂ ∈ (TopOpen‘ℂ_fld))
12		0zd 9668	. . . 4 ⊢ (𝜑 → 0 ∈ ℤ)
13		dvply1.n	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
14	13	nn0zd 9778	. . . 4 ⊢ (𝜑 → 𝑁 ∈ ℤ)
15	12, 14	fzfigd 10890	. . 3 ⊢ (𝜑 → (0...𝑁) ∈ Fin)
16		dvply1.a	. . . . . . 7 ⊢ (𝜑 → 𝐴:ℕ₀⟶ℂ)
17		elfznn0 10539	. . . . . . 7 ⊢ (𝑘 ∈ (0...𝑁) → 𝑘 ∈ ℕ₀)
18		ffvelcdm 5844	. . . . . . 7 ⊢ ((𝐴:ℕ₀⟶ℂ ∧ 𝑘 ∈ ℕ₀) → (𝐴‘𝑘) ∈ ℂ)
19	16, 17, 18	syl2an 289	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → (𝐴‘𝑘) ∈ ℂ)
20	19	adantr 276	. . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...𝑁)) ∧ 𝑧 ∈ ℂ) → (𝐴‘𝑘) ∈ ℂ)
21		simpr 110	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...𝑁)) ∧ 𝑧 ∈ ℂ) → 𝑧 ∈ ℂ)
22	17	ad2antlr 493	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...𝑁)) ∧ 𝑧 ∈ ℂ) → 𝑘 ∈ ℕ₀)
23	21, 22	expcld 11133	. . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...𝑁)) ∧ 𝑧 ∈ ℂ) → (𝑧↑𝑘) ∈ ℂ)
24	20, 23	mulcld 8353	. . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...𝑁)) ∧ 𝑧 ∈ ℂ) → ((𝐴‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
25	24	3impa 1225	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁) ∧ 𝑧 ∈ ℂ) → ((𝐴‘𝑘) · (𝑧↑𝑘)) ∈ ℂ)
26	19	3adant3 1048	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁) ∧ 𝑧 ∈ ℂ) → (𝐴‘𝑘) ∈ ℂ)
27		0cnd 8326	. . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...𝑁) ∧ 𝑧 ∈ ℂ) ∧ 𝑘 = 0) → 0 ∈ ℂ)
28		simpl2 1032	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...𝑁) ∧ 𝑧 ∈ ℂ) ∧ ¬ 𝑘 = 0) → 𝑘 ∈ (0...𝑁))
29	28, 17	syl 14	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...𝑁) ∧ 𝑧 ∈ ℂ) ∧ ¬ 𝑘 = 0) → 𝑘 ∈ ℕ₀)
30	29	nn0cnd 9634	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...𝑁) ∧ 𝑧 ∈ ℂ) ∧ ¬ 𝑘 = 0) → 𝑘 ∈ ℂ)
31		simpl3 1033	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...𝑁) ∧ 𝑧 ∈ ℂ) ∧ ¬ 𝑘 = 0) → 𝑧 ∈ ℂ)
32		simpr 110	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...𝑁) ∧ 𝑧 ∈ ℂ) ∧ ¬ 𝑘 = 0) → ¬ 𝑘 = 0)
33		elnn0 9577	. . . . . . . . . 10 ⊢ (𝑘 ∈ ℕ₀ ↔ (𝑘 ∈ ℕ ∨ 𝑘 = 0))
34	29, 33	sylib 122	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...𝑁) ∧ 𝑧 ∈ ℂ) ∧ ¬ 𝑘 = 0) → (𝑘 ∈ ℕ ∨ 𝑘 = 0))
35	32, 34	ecased 1390	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...𝑁) ∧ 𝑧 ∈ ℂ) ∧ ¬ 𝑘 = 0) → 𝑘 ∈ ℕ)
36		nnm1nn0 9616	. . . . . . . 8 ⊢ (𝑘 ∈ ℕ → (𝑘 − 1) ∈ ℕ₀)
37	35, 36	syl 14	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...𝑁) ∧ 𝑧 ∈ ℂ) ∧ ¬ 𝑘 = 0) → (𝑘 − 1) ∈ ℕ₀)
38	31, 37	expcld 11133	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...𝑁) ∧ 𝑧 ∈ ℂ) ∧ ¬ 𝑘 = 0) → (𝑧↑(𝑘 − 1)) ∈ ℂ)
39	30, 38	mulcld 8353	. . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...𝑁) ∧ 𝑧 ∈ ℂ) ∧ ¬ 𝑘 = 0) → (𝑘 · (𝑧↑(𝑘 − 1))) ∈ ℂ)
40	17	3ad2ant2 1050	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁) ∧ 𝑧 ∈ ℂ) → 𝑘 ∈ ℕ₀)
41	40	nn0zd 9778	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁) ∧ 𝑧 ∈ ℂ) → 𝑘 ∈ ℤ)
42		0zd 9668	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁) ∧ 𝑧 ∈ ℂ) → 0 ∈ ℤ)
43		zdceq 9732	. . . . . 6 ⊢ ((𝑘 ∈ ℤ ∧ 0 ∈ ℤ) → DECID 𝑘 = 0)
44	41, 42, 43	syl2anc 415	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁) ∧ 𝑧 ∈ ℂ) → DECID 𝑘 = 0)
45	27, 39, 44	ifcldadc 3670	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁) ∧ 𝑧 ∈ ℂ) → if(𝑘 = 0, 0, (𝑘 · (𝑧↑(𝑘 − 1)))) ∈ ℂ)
46	26, 45	mulcld 8353	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁) ∧ 𝑧 ∈ ℂ) → ((𝐴‘𝑘) · if(𝑘 = 0, 0, (𝑘 · (𝑧↑(𝑘 − 1))))) ∈ ℂ)
47		0cnd 8326	. . . . 5 ⊢ ((((𝜑 ∧ 𝑘 ∈ (0...𝑁)) ∧ 𝑧 ∈ ℂ) ∧ 𝑘 = 0) → 0 ∈ ℂ)
48	22	nn0cnd 9634	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...𝑁)) ∧ 𝑧 ∈ ℂ) → 𝑘 ∈ ℂ)
49	48	adantr 276	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑘 ∈ (0...𝑁)) ∧ 𝑧 ∈ ℂ) ∧ ¬ 𝑘 = 0) → 𝑘 ∈ ℂ)
50		simplr 533	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑘 ∈ (0...𝑁)) ∧ 𝑧 ∈ ℂ) ∧ ¬ 𝑘 = 0) → 𝑧 ∈ ℂ)
51		simpr 110	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑘 ∈ (0...𝑁)) ∧ 𝑧 ∈ ℂ) ∧ ¬ 𝑘 = 0) → ¬ 𝑘 = 0)
52	22	adantr 276	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑘 ∈ (0...𝑁)) ∧ 𝑧 ∈ ℂ) ∧ ¬ 𝑘 = 0) → 𝑘 ∈ ℕ₀)
53	52, 33	sylib 122	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑘 ∈ (0...𝑁)) ∧ 𝑧 ∈ ℂ) ∧ ¬ 𝑘 = 0) → (𝑘 ∈ ℕ ∨ 𝑘 = 0))
54	51, 53	ecased 1390	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑘 ∈ (0...𝑁)) ∧ 𝑧 ∈ ℂ) ∧ ¬ 𝑘 = 0) → 𝑘 ∈ ℕ)
55	54, 36	syl 14	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑘 ∈ (0...𝑁)) ∧ 𝑧 ∈ ℂ) ∧ ¬ 𝑘 = 0) → (𝑘 − 1) ∈ ℕ₀)
56	50, 55	expcld 11133	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑘 ∈ (0...𝑁)) ∧ 𝑧 ∈ ℂ) ∧ ¬ 𝑘 = 0) → (𝑧↑(𝑘 − 1)) ∈ ℂ)
57	49, 56	mulcld 8353	. . . . 5 ⊢ ((((𝜑 ∧ 𝑘 ∈ (0...𝑁)) ∧ 𝑧 ∈ ℂ) ∧ ¬ 𝑘 = 0) → (𝑘 · (𝑧↑(𝑘 − 1))) ∈ ℂ)
58	44	3expa 1234	. . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...𝑁)) ∧ 𝑧 ∈ ℂ) → DECID 𝑘 = 0)
59	47, 57, 58	ifcldadc 3670	. . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ (0...𝑁)) ∧ 𝑧 ∈ ℂ) → if(𝑘 = 0, 0, (𝑘 · (𝑧↑(𝑘 − 1)))) ∈ ℂ)
60	17	adantl 277	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → 𝑘 ∈ ℕ₀)
61		dvexp2 15950	. . . . 5 ⊢ (𝑘 ∈ ℕ₀ → (ℂ D (𝑧 ∈ ℂ ↦ (𝑧↑𝑘))) = (𝑧 ∈ ℂ ↦ if(𝑘 = 0, 0, (𝑘 · (𝑧↑(𝑘 − 1))))))
62	60, 61	syl 14	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → (ℂ D (𝑧 ∈ ℂ ↦ (𝑧↑𝑘))) = (𝑧 ∈ ℂ ↦ if(𝑘 = 0, 0, (𝑘 · (𝑧↑(𝑘 − 1))))))
63	23, 59, 62, 19	dvmptcmulcn 15959	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → (ℂ D (𝑧 ∈ ℂ ↦ ((𝐴‘𝑘) · (𝑧↑𝑘)))) = (𝑧 ∈ ℂ ↦ ((𝐴‘𝑘) · if(𝑘 = 0, 0, (𝑘 · (𝑧↑(𝑘 − 1)))))))
64	5, 3, 7, 11, 15, 25, 46, 63	dvmptfsum 15963	. 2 ⊢ (𝜑 → (ℂ D (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · (𝑧↑𝑘)))) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · if(𝑘 = 0, 0, (𝑘 · (𝑧↑(𝑘 − 1)))))))
65		elfznn 10478	. . . . . . . . . . 11 ⊢ (𝑘 ∈ (1...𝑁) → 𝑘 ∈ ℕ)
66	65	nnne0d 9359	. . . . . . . . . 10 ⊢ (𝑘 ∈ (1...𝑁) → 𝑘 ≠ 0)
67	66	neneqd 2441	. . . . . . . . 9 ⊢ (𝑘 ∈ (1...𝑁) → ¬ 𝑘 = 0)
68	67	adantl 277	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (1...𝑁)) → ¬ 𝑘 = 0)
69	68	iffalsed 3650	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (1...𝑁)) → if(𝑘 = 0, 0, (𝑘 · (𝑧↑(𝑘 − 1)))) = (𝑘 · (𝑧↑(𝑘 − 1))))
70	69	oveq2d 6104	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (1...𝑁)) → ((𝐴‘𝑘) · if(𝑘 = 0, 0, (𝑘 · (𝑧↑(𝑘 − 1))))) = ((𝐴‘𝑘) · (𝑘 · (𝑧↑(𝑘 − 1)))))
71	70	sumeq2dv 12160	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (1...𝑁)((𝐴‘𝑘) · if(𝑘 = 0, 0, (𝑘 · (𝑧↑(𝑘 − 1))))) = Σ𝑘 ∈ (1...𝑁)((𝐴‘𝑘) · (𝑘 · (𝑧↑(𝑘 − 1)))))
72		1eluzge0 9991	. . . . . . 7 ⊢ 1 ∈ (ℤ_≥‘0)
73		fzss1 10487	. . . . . . 7 ⊢ (1 ∈ (ℤ_≥‘0) → (1...𝑁) ⊆ (0...𝑁))
74	72, 73	mp1i 10	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → (1...𝑁) ⊆ (0...𝑁))
75	16	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → 𝐴:ℕ₀⟶ℂ)
76	65	nnnn0d 9632	. . . . . . . 8 ⊢ (𝑘 ∈ (1...𝑁) → 𝑘 ∈ ℕ₀)
77	75, 76, 18	syl2an 289	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (1...𝑁)) → (𝐴‘𝑘) ∈ ℂ)
78	66	adantl 277	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (1...𝑁)) → 𝑘 ≠ 0)
79	78	neneqd 2441	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (1...𝑁)) → ¬ 𝑘 = 0)
80	79	iffalsed 3650	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (1...𝑁)) → if(𝑘 = 0, 0, (𝑘 · (𝑧↑(𝑘 − 1)))) = (𝑘 · (𝑧↑(𝑘 − 1))))
81	76	adantl 277	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (1...𝑁)) → 𝑘 ∈ ℕ₀)
82	81	nn0cnd 9634	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (1...𝑁)) → 𝑘 ∈ ℂ)
83		simplr 533	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (1...𝑁)) → 𝑧 ∈ ℂ)
84	65, 36	syl 14	. . . . . . . . . . 11 ⊢ (𝑘 ∈ (1...𝑁) → (𝑘 − 1) ∈ ℕ₀)
85	84	adantl 277	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (1...𝑁)) → (𝑘 − 1) ∈ ℕ₀)
86	83, 85	expcld 11133	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (1...𝑁)) → (𝑧↑(𝑘 − 1)) ∈ ℂ)
87	82, 86	mulcld 8353	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (1...𝑁)) → (𝑘 · (𝑧↑(𝑘 − 1))) ∈ ℂ)
88	80, 87	eqeltrd 2315	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (1...𝑁)) → if(𝑘 = 0, 0, (𝑘 · (𝑧↑(𝑘 − 1)))) ∈ ℂ)
89	77, 88	mulcld 8353	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (1...𝑁)) → ((𝐴‘𝑘) · if(𝑘 = 0, 0, (𝑘 · (𝑧↑(𝑘 − 1))))) ∈ ℂ)
90		eldifn 3352	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ ((0...𝑁) ∖ (1...𝑁)) → ¬ 𝑘 ∈ (1...𝑁))
91		0p1e1 9428	. . . . . . . . . . . . . 14 ⊢ (0 + 1) = 1
92	91	oveq1i 6098	. . . . . . . . . . . . 13 ⊢ ((0 + 1)...𝑁) = (1...𝑁)
93	92	eleq2i 2305	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ ((0 + 1)...𝑁) ↔ 𝑘 ∈ (1...𝑁))
94	90, 93	sylnibr 688	. . . . . . . . . . 11 ⊢ (𝑘 ∈ ((0...𝑁) ∖ (1...𝑁)) → ¬ 𝑘 ∈ ((0 + 1)...𝑁))
95	94	adantl 277	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...𝑁) ∖ (1...𝑁))) → ¬ 𝑘 ∈ ((0 + 1)...𝑁))
96		eldifi 3351	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ ((0...𝑁) ∖ (1...𝑁)) → 𝑘 ∈ (0...𝑁))
97	96	adantl 277	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...𝑁) ∖ (1...𝑁))) → 𝑘 ∈ (0...𝑁))
98		nn0uz 9974	. . . . . . . . . . . . . 14 ⊢ ℕ₀ = (ℤ_≥‘0)
99	13, 98	eleqtrdi 2331	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘0))
100	99	ad2antrr 492	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...𝑁) ∖ (1...𝑁))) → 𝑁 ∈ (ℤ_≥‘0))
101		elfzp12 10524	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ (ℤ_≥‘0) → (𝑘 ∈ (0...𝑁) ↔ (𝑘 = 0 ∨ 𝑘 ∈ ((0 + 1)...𝑁))))
102	100, 101	syl 14	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...𝑁) ∖ (1...𝑁))) → (𝑘 ∈ (0...𝑁) ↔ (𝑘 = 0 ∨ 𝑘 ∈ ((0 + 1)...𝑁))))
103	97, 102	mpbid 147	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...𝑁) ∖ (1...𝑁))) → (𝑘 = 0 ∨ 𝑘 ∈ ((0 + 1)...𝑁)))
104	95, 103	ecased 1390	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...𝑁) ∖ (1...𝑁))) → 𝑘 = 0)
105	104	iftrued 3647	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...𝑁) ∖ (1...𝑁))) → if(𝑘 = 0, 0, (𝑘 · (𝑧↑(𝑘 − 1)))) = 0)
106	105	oveq2d 6104	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...𝑁) ∖ (1...𝑁))) → ((𝐴‘𝑘) · if(𝑘 = 0, 0, (𝑘 · (𝑧↑(𝑘 − 1))))) = ((𝐴‘𝑘) · 0))
107	75, 17, 18	syl2an 289	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑁)) → (𝐴‘𝑘) ∈ ℂ)
108	107	mul01d 8728	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑁)) → ((𝐴‘𝑘) · 0) = 0)
109	96, 108	sylan2 286	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...𝑁) ∖ (1...𝑁))) → ((𝐴‘𝑘) · 0) = 0)
110	106, 109	eqtrd 2271	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ ((0...𝑁) ∖ (1...𝑁))) → ((𝐴‘𝑘) · if(𝑘 = 0, 0, (𝑘 · (𝑧↑(𝑘 − 1))))) = 0)
111		elfzelz 10446	. . . . . . . . 9 ⊢ (𝑗 ∈ (0...𝑁) → 𝑗 ∈ ℤ)
112	111	adantl 277	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...𝑁)) → 𝑗 ∈ ℤ)
113		1zzd 9683	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...𝑁)) → 1 ∈ ℤ)
114	14	ad2antrr 492	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...𝑁)) → 𝑁 ∈ ℤ)
115		fzdcel 10462	. . . . . . . 8 ⊢ ((𝑗 ∈ ℤ ∧ 1 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID 𝑗 ∈ (1...𝑁))
116	112, 113, 114, 115	syl3anc 1278	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...𝑁)) → DECID 𝑗 ∈ (1...𝑁))
117	116	ralrimiva 2623	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → ∀𝑗 ∈ (0...𝑁)DECID 𝑗 ∈ (1...𝑁))
118		0zd 9668	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → 0 ∈ ℤ)
119	14	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → 𝑁 ∈ ℤ)
120	118, 119	fzfigd 10890	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → (0...𝑁) ∈ Fin)
121	74, 89, 110, 117, 120	fisumss 12185	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (1...𝑁)((𝐴‘𝑘) · if(𝑘 = 0, 0, (𝑘 · (𝑧↑(𝑘 − 1))))) = Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · if(𝑘 = 0, 0, (𝑘 · (𝑧↑(𝑘 − 1))))))
122		elfznn0 10539	. . . . . . . . . . . . . . 15 ⊢ (𝑗 ∈ (0...(𝑁 − 1)) → 𝑗 ∈ ℕ₀)
123	122	adantl 277	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...(𝑁 − 1))) → 𝑗 ∈ ℕ₀)
124	123	nn0cnd 9634	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...(𝑁 − 1))) → 𝑗 ∈ ℂ)
125		ax-1cn 8279	. . . . . . . . . . . . 13 ⊢ 1 ∈ ℂ
126		pncan 8540	. . . . . . . . . . . . 13 ⊢ ((𝑗 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑗 + 1) − 1) = 𝑗)
127	124, 125, 126	sylancl 417	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...(𝑁 − 1))) → ((𝑗 + 1) − 1) = 𝑗)
128	127	oveq2d 6104	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...(𝑁 − 1))) → (𝑧↑((𝑗 + 1) − 1)) = (𝑧↑𝑗))
129	128	oveq2d 6104	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...(𝑁 − 1))) → ((𝑗 + 1) · (𝑧↑((𝑗 + 1) − 1))) = ((𝑗 + 1) · (𝑧↑𝑗)))
130	129	oveq2d 6104	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...(𝑁 − 1))) → ((𝐴‘(𝑗 + 1)) · ((𝑗 + 1) · (𝑧↑((𝑗 + 1) − 1)))) = ((𝐴‘(𝑗 + 1)) · ((𝑗 + 1) · (𝑧↑𝑗))))
131	16	ad2antrr 492	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...(𝑁 − 1))) → 𝐴:ℕ₀⟶ℂ)
132		peano2nn0 9615	. . . . . . . . . . . . 13 ⊢ (𝑗 ∈ ℕ₀ → (𝑗 + 1) ∈ ℕ₀)
133	122, 132	syl 14	. . . . . . . . . . . 12 ⊢ (𝑗 ∈ (0...(𝑁 − 1)) → (𝑗 + 1) ∈ ℕ₀)
134	133	adantl 277	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...(𝑁 − 1))) → (𝑗 + 1) ∈ ℕ₀)
135	131, 134	ffvelcdmd 5847	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...(𝑁 − 1))) → (𝐴‘(𝑗 + 1)) ∈ ℂ)
136	134	nn0cnd 9634	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...(𝑁 − 1))) → (𝑗 + 1) ∈ ℂ)
137		simplr 533	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...(𝑁 − 1))) → 𝑧 ∈ ℂ)
138	137, 123	expcld 11133	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...(𝑁 − 1))) → (𝑧↑𝑗) ∈ ℂ)
139	135, 136, 138	mulassd 8356	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...(𝑁 − 1))) → (((𝐴‘(𝑗 + 1)) · (𝑗 + 1)) · (𝑧↑𝑗)) = ((𝐴‘(𝑗 + 1)) · ((𝑗 + 1) · (𝑧↑𝑗))))
140	135, 136	mulcomd 8354	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...(𝑁 − 1))) → ((𝐴‘(𝑗 + 1)) · (𝑗 + 1)) = ((𝑗 + 1) · (𝐴‘(𝑗 + 1))))
141	140	oveq1d 6103	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...(𝑁 − 1))) → (((𝐴‘(𝑗 + 1)) · (𝑗 + 1)) · (𝑧↑𝑗)) = (((𝑗 + 1) · (𝐴‘(𝑗 + 1))) · (𝑧↑𝑗)))
142	130, 139, 141	3eqtr2d 2277	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑗 ∈ (0...(𝑁 − 1))) → ((𝐴‘(𝑗 + 1)) · ((𝑗 + 1) · (𝑧↑((𝑗 + 1) − 1)))) = (((𝑗 + 1) · (𝐴‘(𝑗 + 1))) · (𝑧↑𝑗)))
143	142	sumeq2dv 12160	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑗 ∈ (0...(𝑁 − 1))((𝐴‘(𝑗 + 1)) · ((𝑗 + 1) · (𝑧↑((𝑗 + 1) − 1)))) = Σ𝑗 ∈ (0...(𝑁 − 1))(((𝑗 + 1) · (𝐴‘(𝑗 + 1))) · (𝑧↑𝑗)))
144		1m1e0 9383	. . . . . . . . 9 ⊢ (1 − 1) = 0
145	144	oveq1i 6098	. . . . . . . 8 ⊢ ((1 − 1)...(𝑁 − 1)) = (0...(𝑁 − 1))
146	145	sumeq1i 12155	. . . . . . 7 ⊢ Σ𝑗 ∈ ((1 − 1)...(𝑁 − 1))((𝐴‘(𝑗 + 1)) · ((𝑗 + 1) · (𝑧↑((𝑗 + 1) − 1)))) = Σ𝑗 ∈ (0...(𝑁 − 1))((𝐴‘(𝑗 + 1)) · ((𝑗 + 1) · (𝑧↑((𝑗 + 1) − 1))))
147		oveq1 6095	. . . . . . . . . 10 ⊢ (𝑘 = 𝑗 → (𝑘 + 1) = (𝑗 + 1))
148		fvoveq1 6111	. . . . . . . . . 10 ⊢ (𝑘 = 𝑗 → (𝐴‘(𝑘 + 1)) = (𝐴‘(𝑗 + 1)))
149	147, 148	oveq12d 6106	. . . . . . . . 9 ⊢ (𝑘 = 𝑗 → ((𝑘 + 1) · (𝐴‘(𝑘 + 1))) = ((𝑗 + 1) · (𝐴‘(𝑗 + 1))))
150		oveq2 6096	. . . . . . . . 9 ⊢ (𝑘 = 𝑗 → (𝑧↑𝑘) = (𝑧↑𝑗))
151	149, 150	oveq12d 6106	. . . . . . . 8 ⊢ (𝑘 = 𝑗 → (((𝑘 + 1) · (𝐴‘(𝑘 + 1))) · (𝑧↑𝑘)) = (((𝑗 + 1) · (𝐴‘(𝑗 + 1))) · (𝑧↑𝑗)))
152	151	cbvsumv 12153	. . . . . . 7 ⊢ Σ𝑘 ∈ (0...(𝑁 − 1))(((𝑘 + 1) · (𝐴‘(𝑘 + 1))) · (𝑧↑𝑘)) = Σ𝑗 ∈ (0...(𝑁 − 1))(((𝑗 + 1) · (𝐴‘(𝑗 + 1))) · (𝑧↑𝑗))
153	143, 146, 152	3eqtr4g 2296	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑗 ∈ ((1 − 1)...(𝑁 − 1))((𝐴‘(𝑗 + 1)) · ((𝑗 + 1) · (𝑧↑((𝑗 + 1) − 1)))) = Σ𝑘 ∈ (0...(𝑁 − 1))(((𝑘 + 1) · (𝐴‘(𝑘 + 1))) · (𝑧↑𝑘)))
154		1zzd 9683	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → 1 ∈ ℤ)
155	13	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → 𝑁 ∈ ℕ₀)
156	155	nn0zd 9778	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → 𝑁 ∈ ℤ)
157	77, 87	mulcld 8353	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (1...𝑁)) → ((𝐴‘𝑘) · (𝑘 · (𝑧↑(𝑘 − 1)))) ∈ ℂ)
158		fveq2 5698	. . . . . . . 8 ⊢ (𝑘 = (𝑗 + 1) → (𝐴‘𝑘) = (𝐴‘(𝑗 + 1)))
159		id 19	. . . . . . . . 9 ⊢ (𝑘 = (𝑗 + 1) → 𝑘 = (𝑗 + 1))
160		oveq1 6095	. . . . . . . . . 10 ⊢ (𝑘 = (𝑗 + 1) → (𝑘 − 1) = ((𝑗 + 1) − 1))
161	160	oveq2d 6104	. . . . . . . . 9 ⊢ (𝑘 = (𝑗 + 1) → (𝑧↑(𝑘 − 1)) = (𝑧↑((𝑗 + 1) − 1)))
162	159, 161	oveq12d 6106	. . . . . . . 8 ⊢ (𝑘 = (𝑗 + 1) → (𝑘 · (𝑧↑(𝑘 − 1))) = ((𝑗 + 1) · (𝑧↑((𝑗 + 1) − 1))))
163	158, 162	oveq12d 6106	. . . . . . 7 ⊢ (𝑘 = (𝑗 + 1) → ((𝐴‘𝑘) · (𝑘 · (𝑧↑(𝑘 − 1)))) = ((𝐴‘(𝑗 + 1)) · ((𝑗 + 1) · (𝑧↑((𝑗 + 1) − 1)))))
164	154, 154, 156, 157, 163	fsumshftm 12238	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (1...𝑁)((𝐴‘𝑘) · (𝑘 · (𝑧↑(𝑘 − 1)))) = Σ𝑗 ∈ ((1 − 1)...(𝑁 − 1))((𝐴‘(𝑗 + 1)) · ((𝑗 + 1) · (𝑧↑((𝑗 + 1) − 1)))))
165		elfznn0 10539	. . . . . . . . . 10 ⊢ (𝑘 ∈ (0...(𝑁 − 1)) → 𝑘 ∈ ℕ₀)
166	165	adantl 277	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...(𝑁 − 1))) → 𝑘 ∈ ℕ₀)
167		peano2nn0 9615	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ ℕ₀ → (𝑘 + 1) ∈ ℕ₀)
168	166, 167	syl 14	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...(𝑁 − 1))) → (𝑘 + 1) ∈ ℕ₀)
169	168	nn0cnd 9634	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...(𝑁 − 1))) → (𝑘 + 1) ∈ ℂ)
170	16	ad2antrr 492	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...(𝑁 − 1))) → 𝐴:ℕ₀⟶ℂ)
171	170, 168	ffvelcdmd 5847	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...(𝑁 − 1))) → (𝐴‘(𝑘 + 1)) ∈ ℂ)
172	169, 171	mulcld 8353	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...(𝑁 − 1))) → ((𝑘 + 1) · (𝐴‘(𝑘 + 1))) ∈ ℂ)
173		dvply1.b	. . . . . . . . . 10 ⊢ 𝐵 = (𝑘 ∈ ℕ₀ ↦ ((𝑘 + 1) · (𝐴‘(𝑘 + 1))))
174	173	fvmpt2 5792	. . . . . . . . 9 ⊢ ((𝑘 ∈ ℕ₀ ∧ ((𝑘 + 1) · (𝐴‘(𝑘 + 1))) ∈ ℂ) → (𝐵‘𝑘) = ((𝑘 + 1) · (𝐴‘(𝑘 + 1))))
175	166, 172, 174	syl2anc 415	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...(𝑁 − 1))) → (𝐵‘𝑘) = ((𝑘 + 1) · (𝐴‘(𝑘 + 1))))
176	175	oveq1d 6103	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℂ) ∧ 𝑘 ∈ (0...(𝑁 − 1))) → ((𝐵‘𝑘) · (𝑧↑𝑘)) = (((𝑘 + 1) · (𝐴‘(𝑘 + 1))) · (𝑧↑𝑘)))
177	176	sumeq2dv 12160	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (0...(𝑁 − 1))((𝐵‘𝑘) · (𝑧↑𝑘)) = Σ𝑘 ∈ (0...(𝑁 − 1))(((𝑘 + 1) · (𝐴‘(𝑘 + 1))) · (𝑧↑𝑘)))
178	153, 164, 177	3eqtr4d 2281	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (1...𝑁)((𝐴‘𝑘) · (𝑘 · (𝑧↑(𝑘 − 1)))) = Σ𝑘 ∈ (0...(𝑁 − 1))((𝐵‘𝑘) · (𝑧↑𝑘)))
179	71, 121, 178	3eqtr3d 2279	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ ℂ) → Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · if(𝑘 = 0, 0, (𝑘 · (𝑧↑(𝑘 − 1))))) = Σ𝑘 ∈ (0...(𝑁 − 1))((𝐵‘𝑘) · (𝑧↑𝑘)))
180	179	mpteq2dva 4223	. . 3 ⊢ (𝜑 → (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · if(𝑘 = 0, 0, (𝑘 · (𝑧↑(𝑘 − 1)))))) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...(𝑁 − 1))((𝐵‘𝑘) · (𝑧↑𝑘))))
181		dvply1.g	. . 3 ⊢ (𝜑 → 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...(𝑁 − 1))((𝐵‘𝑘) · (𝑧↑𝑘))))
182	180, 181	eqtr4d 2274	. 2 ⊢ (𝜑 → (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · if(𝑘 = 0, 0, (𝑘 · (𝑧↑(𝑘 − 1)))))) = 𝐺)
183	2, 64, 182	3eqtrd 2275	1 ⊢ (𝜑 → (ℂ D 𝐹) = 𝐺)

Colors of variables: wff set class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 720 DECID wdc 846 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 ≠ wne 2420 ∖ cdif 3217 ⊆ wss 3220 ifcif 3638 {cpr 3710 ↦ cmpt 4193 ⟶wf 5376 ‘cfv 5380 (class class class)co 6088 ℂcc 8184 ℝcr 8185 0cc0 8186 1c1 8187 + caddc 8189 · cmul 8191 − cmin 8505 ℕcn 9314 ℕ₀cn0 9575 ℤcz 9656 ℤ_≥cuz 9938 ...cfz 10429 ↑cexp 10997 Σcsu 12145 TopOpenctopn 13654 ℂ_fldccnfld 15003 Topctop 15235 D cdv 15893

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4248 ax-sep 4251 ax-nul 4261 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-iinf 4737 ax-cnex 8277 ax-resscn 8278 ax-1cn 8279 ax-1re 8280 ax-icn 8281 ax-addcl 8282 ax-addrcl 8283 ax-mulcl 8284 ax-mulrcl 8285 ax-addcom 8286 ax-mulcom 8287 ax-addass 8288 ax-mulass 8289 ax-distr 8290 ax-i2m1 8291 ax-0lt1 8292 ax-1rid 8293 ax-0id 8294 ax-rnegex 8295 ax-precex 8296 ax-cnre 8297 ax-pre-ltirr 8298 ax-pre-ltwlin 8299 ax-pre-lttrn 8300 ax-pre-apti 8301 ax-pre-ltadd 8302 ax-pre-mulgt0 8303 ax-pre-mulext 8304 ax-arch 8305 ax-caucvg 8306 ax-addf 8308 ax-mulf 8309

This proof depends on definitions: df-bi 117 df-stab 843 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-tp 3717 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-tr 4232 df-id 4440 df-po 4443 df-iso 4444 df-iord 4513 df-on 4515 df-ilim 4516 df-suc 4518 df-iom 4740 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-isom 5389 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-of 6305 df-1st 6378 df-2nd 6379 df-recs 6580 df-irdg 6645 df-frec 6666 df-1o 6691 df-oadd 6695 df-er 6811 df-map 6928 df-pm 6929 df-en 7028 df-dom 7029 df-fin 7030 df-sup 7331 df-inf 7332 df-pnf 8369 df-mnf 8370 df-xr 8371 df-ltxr 8372 df-le 8373 df-sub 8507 df-neg 8508 df-reap 8912 df-ap 8919 df-div 9012 df-inn 9315 df-2 9373 df-3 9374 df-4 9375 df-5 9376 df-6 9377 df-7 9378 df-8 9379 df-9 9380 df-n0 9576 df-z 9657 df-dec 9790 df-uz 9939 df-q 10037 df-rp 10073 df-xneg 10192 df-xadd 10193 df-fz 10430 df-fzo 10568 df-seqfrec 10907 df-exp 10998 df-ihash 11238 df-cj 11630 df-re 11631 df-im 11632 df-rsqrt 11787 df-abs 11788 df-clim 12071 df-sumdc 12146 df-struct 13413 df-ndx 13414 df-slot 13415 df-base 13417 df-plusg 13504 df-mulr 13505 df-starv 13506 df-tset 13510 df-ple 13511 df-ds 13513 df-unif 13514 df-rest 13655 df-topn 13656 df-topgen 13674 df-psmet 14990 df-xmet 14991 df-met 14992 df-bl 14993 df-mopn 14994 df-fg 14996 df-metu 14997 df-cnfld 15004 df-top 15236 df-topon 15249 df-topsp 15269 df-bases 15281 df-ntr 15334 df-cn 15426 df-cnp 15427 df-tx 15491 df-xms 15577 df-ms 15578 df-cncf 15809 df-limced 15894 df-dvap 15895

This theorem is used by: dvply2g 16004

W3C validator