taylply - Metamath Proof Explorer

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

Theorem taylply 23872

Description: The Taylor polynomial is a polynomial of degree (at most) 𝑁. (Contributed by Mario Carneiro, 31-Dec-2016.)

**Hypotheses**
Ref	Expression
taylpfval.s	⊢ (𝜑 → 𝑆 ∈ {ℝ, ℂ})
taylpfval.f	⊢ (𝜑 → 𝐹:𝐴⟶ℂ)
taylpfval.a	⊢ (𝜑 → 𝐴 ⊆ 𝑆)
taylpfval.n	⊢ (𝜑 → 𝑁 ∈ ℕ₀)
taylpfval.b	⊢ (𝜑 → 𝐵 ∈ dom ((𝑆 D^𝑛 𝐹)‘𝑁))
taylpfval.t	⊢ 𝑇 = (𝑁(𝑆 Tayl 𝐹)𝐵)

**Assertion**
Ref	Expression
taylply	⊢ (𝜑 → (𝑇 ∈ (Poly‘ℂ) ∧ (deg‘𝑇) ≤ 𝑁))

Proof of Theorem taylply Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		taylpfval.s	. 2 ⊢ (𝜑 → 𝑆 ∈ {ℝ, ℂ})
2		taylpfval.f	. 2 ⊢ (𝜑 → 𝐹:𝐴⟶ℂ)
3		taylpfval.a	. 2 ⊢ (𝜑 → 𝐴 ⊆ 𝑆)
4		taylpfval.n	. 2 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
5		taylpfval.b	. 2 ⊢ (𝜑 → 𝐵 ∈ dom ((𝑆 D^𝑛 𝐹)‘𝑁))
6		taylpfval.t	. 2 ⊢ 𝑇 = (𝑁(𝑆 Tayl 𝐹)𝐵)
7		cnring 19536	. . 3 ⊢ ℂ_fld ∈ Ring
8		cnfldbas 19520	. . . 4 ⊢ ℂ = (Base‘ℂ_fld)
9	8	subrgid 18554	. . 3 ⊢ (ℂ_fld ∈ Ring → ℂ ∈ (SubRing‘ℂ_fld))
10	7, 9	mp1i 13	. 2 ⊢ (𝜑 → ℂ ∈ (SubRing‘ℂ_fld))
11		cnex 9874	. . . . . . . 8 ⊢ ℂ ∈ V
12	11	a1i 11	. . . . . . 7 ⊢ (𝜑 → ℂ ∈ V)
13		elpm2r 7739	. . . . . . 7 ⊢ (((ℂ ∈ V ∧ 𝑆 ∈ {ℝ, ℂ}) ∧ (𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ 𝑆)) → 𝐹 ∈ (ℂ ↑_pm 𝑆))
14	12, 1, 2, 3, 13	syl22anc 1318	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (ℂ ↑_pm 𝑆))
15		dvnbss 23442	. . . . . 6 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑁 ∈ ℕ₀) → dom ((𝑆 D^𝑛 𝐹)‘𝑁) ⊆ dom 𝐹)
16	1, 14, 4, 15	syl3anc 1317	. . . . 5 ⊢ (𝜑 → dom ((𝑆 D^𝑛 𝐹)‘𝑁) ⊆ dom 𝐹)
17		fdm 5950	. . . . . 6 ⊢ (𝐹:𝐴⟶ℂ → dom 𝐹 = 𝐴)
18	2, 17	syl 17	. . . . 5 ⊢ (𝜑 → dom 𝐹 = 𝐴)
19	16, 18	sseqtrd 3603	. . . 4 ⊢ (𝜑 → dom ((𝑆 D^𝑛 𝐹)‘𝑁) ⊆ 𝐴)
20		recnprss 23419	. . . . . 6 ⊢ (𝑆 ∈ {ℝ, ℂ} → 𝑆 ⊆ ℂ)
21	1, 20	syl 17	. . . . 5 ⊢ (𝜑 → 𝑆 ⊆ ℂ)
22	3, 21	sstrd 3577	. . . 4 ⊢ (𝜑 → 𝐴 ⊆ ℂ)
23	19, 22	sstrd 3577	. . 3 ⊢ (𝜑 → dom ((𝑆 D^𝑛 𝐹)‘𝑁) ⊆ ℂ)
24	23, 5	sseldd 3568	. 2 ⊢ (𝜑 → 𝐵 ∈ ℂ)
25	1	adantr 479	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → 𝑆 ∈ {ℝ, ℂ})
26	14	adantr 479	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → 𝐹 ∈ (ℂ ↑_pm 𝑆))
27		elfznn0 12260	. . . . . 6 ⊢ (𝑘 ∈ (0...𝑁) → 𝑘 ∈ ℕ₀)
28	27	adantl 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → 𝑘 ∈ ℕ₀)
29		dvnf 23441	. . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑘 ∈ ℕ₀) → ((𝑆 D^𝑛 𝐹)‘𝑘):dom ((𝑆 D^𝑛 𝐹)‘𝑘)⟶ℂ)
30	25, 26, 28, 29	syl3anc 1317	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → ((𝑆 D^𝑛 𝐹)‘𝑘):dom ((𝑆 D^𝑛 𝐹)‘𝑘)⟶ℂ)
31		simpr 475	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → 𝑘 ∈ (0...𝑁))
32		dvn2bss 23444	. . . . . 6 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑘 ∈ (0...𝑁)) → dom ((𝑆 D^𝑛 𝐹)‘𝑁) ⊆ dom ((𝑆 D^𝑛 𝐹)‘𝑘))
33	25, 26, 31, 32	syl3anc 1317	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → dom ((𝑆 D^𝑛 𝐹)‘𝑁) ⊆ dom ((𝑆 D^𝑛 𝐹)‘𝑘))
34	5	adantr 479	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → 𝐵 ∈ dom ((𝑆 D^𝑛 𝐹)‘𝑁))
35	33, 34	sseldd 3568	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → 𝐵 ∈ dom ((𝑆 D^𝑛 𝐹)‘𝑘))
36	30, 35	ffvelrnd 6253	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → (((𝑆 D^𝑛 𝐹)‘𝑘)‘𝐵) ∈ ℂ)
37		faccl 12890	. . . . 5 ⊢ (𝑘 ∈ ℕ₀ → (!‘𝑘) ∈ ℕ)
38	28, 37	syl 17	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → (!‘𝑘) ∈ ℕ)
39	38	nncnd 10886	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → (!‘𝑘) ∈ ℂ)
40	38	nnne0d 10915	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → (!‘𝑘) ≠ 0)
41	36, 39, 40	divcld 10653	. 2 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → ((((𝑆 D^𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) ∈ ℂ)
42	1, 2, 3, 4, 5, 6, 10, 24, 41	taylply2 23871	1 ⊢ (𝜑 → (𝑇 ∈ (Poly‘ℂ) ∧ (deg‘𝑇) ≤ 𝑁))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 382 = wceq 1474 ∈ wcel 1976 Vcvv 3172 ⊆ wss 3539 {cpr 4126 class class class wbr 4577 dom cdm 5028 ⟶wf 5786 ‘cfv 5790 (class class class)co 6527 ↑_pm cpm 7723 ℂcc 9791 ℝcr 9792 0cc0 9793 ≤ cle 9932 ℕcn 10870 ℕ₀cn0 11142 ...cfz 12155 !cfa 12880 Ringcrg 18319 SubRingcsubrg 18548 ℂ_fldccnfld 19516 D^𝑛 cdvn 23379 Polycply 23689 degcdgr 23692 Tayl ctayl 23856

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1712 ax-4 1727 ax-5 1826 ax-6 1874 ax-7 1921 ax-8 1978 ax-9 1985 ax-10 2005 ax-11 2020 ax-12 2033 ax-13 2233 ax-ext 2589 ax-rep 4693 ax-sep 4703 ax-nul 4712 ax-pow 4764 ax-pr 4828 ax-un 6825 ax-inf2 8399 ax-cnex 9849 ax-resscn 9850 ax-1cn 9851 ax-icn 9852 ax-addcl 9853 ax-addrcl 9854 ax-mulcl 9855 ax-mulrcl 9856 ax-mulcom 9857 ax-addass 9858 ax-mulass 9859 ax-distr 9860 ax-i2m1 9861 ax-1ne0 9862 ax-1rid 9863 ax-rnegex 9864 ax-rrecex 9865 ax-cnre 9866 ax-pre-lttri 9867 ax-pre-lttrn 9868 ax-pre-ltadd 9869 ax-pre-mulgt0 9870 ax-pre-sup 9871 ax-addf 9872 ax-mulf 9873

This theorem depends on definitions: df-bi 195 df-or 383 df-an 384 df-3or 1031 df-3an 1032 df-tru 1477 df-fal 1480 df-ex 1695 df-nf 1700 df-sb 1867 df-eu 2461 df-mo 2462 df-clab 2596 df-cleq 2602 df-clel 2605 df-nfc 2739 df-ne 2781 df-nel 2782 df-ral 2900 df-rex 2901 df-reu 2902 df-rmo 2903 df-rab 2904 df-v 3174 df-sbc 3402 df-csb 3499 df-dif 3542 df-un 3544 df-in 3546 df-ss 3553 df-pss 3555 df-nul 3874 df-if 4036 df-pw 4109 df-sn 4125 df-pr 4127 df-tp 4129 df-op 4131 df-uni 4367 df-int 4405 df-iun 4451 df-iin 4452 df-br 4578 df-opab 4638 df-mpt 4639 df-tr 4675 df-eprel 4939 df-id 4943 df-po 4949 df-so 4950 df-fr 4987 df-se 4988 df-we 4989 df-xp 5034 df-rel 5035 df-cnv 5036 df-co 5037 df-dm 5038 df-rn 5039 df-res 5040 df-ima 5041 df-pred 5583 df-ord 5629 df-on 5630 df-lim 5631 df-suc 5632 df-iota 5754 df-fun 5792 df-fn 5793 df-f 5794 df-f1 5795 df-fo 5796 df-f1o 5797 df-fv 5798 df-isom 5799 df-riota 6489 df-ov 6530 df-oprab 6531 df-mpt2 6532 df-of 6773 df-om 6936 df-1st 7037 df-2nd 7038 df-supp 7161 df-wrecs 7272 df-recs 7333 df-rdg 7371 df-1o 7425 df-oadd 7429 df-er 7607 df-map 7724 df-pm 7725 df-en 7820 df-dom 7821 df-sdom 7822 df-fin 7823 df-fsupp 8137 df-fi 8178 df-sup 8209 df-inf 8210 df-oi 8276 df-card 8626 df-pnf 9933 df-mnf 9934 df-xr 9935 df-ltxr 9936 df-le 9937 df-sub 10120 df-neg 10121 df-div 10537 df-nn 10871 df-2 10929 df-3 10930 df-4 10931 df-5 10932 df-6 10933 df-7 10934 df-8 10935 df-9 10936 df-n0 11143 df-z 11214 df-dec 11329 df-uz 11523 df-q 11624 df-rp 11668 df-xneg 11781 df-xadd 11782 df-xmul 11783 df-icc 12012 df-fz 12156 df-fzo 12293 df-fl 12413 df-seq 12622 df-exp 12681 df-fac 12881 df-hash 12938 df-cj 13636 df-re 13637 df-im 13638 df-sqrt 13772 df-abs 13773 df-clim 14016 df-rlim 14017 df-sum 14214 df-struct 15646 df-ndx 15647 df-slot 15648 df-base 15649 df-sets 15650 df-ress 15651 df-plusg 15730 df-mulr 15731 df-starv 15732 df-tset 15736 df-ple 15737 df-ds 15740 df-unif 15741 df-rest 15855 df-topn 15856 df-0g 15874 df-gsum 15875 df-topgen 15876 df-mgm 17014 df-sgrp 17056 df-mnd 17067 df-grp 17197 df-minusg 17198 df-subg 17363 df-cntz 17522 df-cmn 17967 df-abl 17968 df-mgp 18262 df-ur 18274 df-ring 18321 df-cring 18322 df-subrg 18550 df-psmet 19508 df-xmet 19509 df-met 19510 df-bl 19511 df-mopn 19512 df-fbas 19513 df-fg 19514 df-cnfld 19517 df-top 20469 df-bases 20470 df-topon 20471 df-topsp 20472 df-cld 20581 df-ntr 20582 df-cls 20583 df-nei 20660 df-lp 20698 df-perf 20699 df-cnp 20790 df-haus 20877 df-fil 21408 df-fm 21500 df-flim 21501 df-flf 21502 df-tsms 21688 df-xms 21883 df-ms 21884 df-0p 23188 df-limc 23381 df-dv 23382 df-dvn 23383 df-ply 23693 df-idp 23694 df-coe 23695 df-dgr 23696 df-tayl 23858

This theorem is referenced by: (None)

W3C validator