taylfvallem1 - Metamath Proof Explorer

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

Theorem taylfvallem1 24632

Description: Lemma for taylfval 24634. (Contributed by Mario Carneiro, 30-Dec-2016.)

**Hypotheses**
Ref	Expression
taylfval.s	⊢ (𝜑 → 𝑆 ∈ {ℝ, ℂ})
taylfval.f	⊢ (𝜑 → 𝐹:𝐴⟶ℂ)
taylfval.a	⊢ (𝜑 → 𝐴 ⊆ 𝑆)
taylfval.n	⊢ (𝜑 → (𝑁 ∈ ℕ₀ ∨ 𝑁 = +∞))
taylfval.b	⊢ ((𝜑 ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝐵 ∈ dom ((𝑆 D^𝑛 𝐹)‘𝑘))

**Assertion**
Ref	Expression
taylfvallem1	⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → (((((𝑆 D^𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑋 − 𝐵)↑𝑘)) ∈ ℂ)

Distinct variable groups: 𝐵,𝑘 𝑘,𝐹 𝜑,𝑘 𝑘,𝑁 𝑆,𝑘 𝑘,𝑋 Allowed substitution hint: 𝐴(𝑘)

**Proof of Theorem taylfvallem1**
Step	Hyp	Ref	Expression
1		taylfval.s	. . . . . 6 ⊢ (𝜑 → 𝑆 ∈ {ℝ, ℂ})
2	1	ad2antrr 722	. . . . 5 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝑆 ∈ {ℝ, ℂ})
3		cnex 10471	. . . . . . . 8 ⊢ ℂ ∈ V
4	3	a1i 11	. . . . . . 7 ⊢ (𝜑 → ℂ ∈ V)
5		taylfval.f	. . . . . . 7 ⊢ (𝜑 → 𝐹:𝐴⟶ℂ)
6		taylfval.a	. . . . . . 7 ⊢ (𝜑 → 𝐴 ⊆ 𝑆)
7		elpm2r 8281	. . . . . . 7 ⊢ (((ℂ ∈ V ∧ 𝑆 ∈ {ℝ, ℂ}) ∧ (𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ 𝑆)) → 𝐹 ∈ (ℂ ↑_pm 𝑆))
8	4, 1, 5, 6, 7	syl22anc 835	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (ℂ ↑_pm 𝑆))
9	8	ad2antrr 722	. . . . 5 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝐹 ∈ (ℂ ↑_pm 𝑆))
10		simpr 485	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝑘 ∈ ((0[,]𝑁) ∩ ℤ))
11	10	elin2d 4103	. . . . . 6 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝑘 ∈ ℤ)
12	10	elin1d 4102	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝑘 ∈ (0[,]𝑁))
13		0xr 10541	. . . . . . . . 9 ⊢ 0 ∈ ℝ^*
14		taylfval.n	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑁 ∈ ℕ₀ ∨ 𝑁 = +∞))
15		nn0re 11760	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ ℕ₀ → 𝑁 ∈ ℝ)
16	15	rexrd 10544	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ₀ → 𝑁 ∈ ℝ^*)
17		id 22	. . . . . . . . . . . . 13 ⊢ (𝑁 = +∞ → 𝑁 = +∞)
18		pnfxr 10548	. . . . . . . . . . . . 13 ⊢ +∞ ∈ ℝ^*
19	17, 18	syl6eqel 2893	. . . . . . . . . . . 12 ⊢ (𝑁 = +∞ → 𝑁 ∈ ℝ^*)
20	16, 19	jaoi 852	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℕ₀ ∨ 𝑁 = +∞) → 𝑁 ∈ ℝ^*)
21	14, 20	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℝ^*)
22	21	ad2antrr 722	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝑁 ∈ ℝ^*)
23		elicc1 12636	. . . . . . . . 9 ⊢ ((0 ∈ ℝ^* ∧ 𝑁 ∈ ℝ^) → (𝑘 ∈ (0[,]𝑁) ↔ (𝑘 ∈ ℝ^ ∧ 0 ≤ 𝑘 ∧ 𝑘 ≤ 𝑁)))
24	13, 22, 23	sylancr 587	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → (𝑘 ∈ (0[,]𝑁) ↔ (𝑘 ∈ ℝ^* ∧ 0 ≤ 𝑘 ∧ 𝑘 ≤ 𝑁)))
25	12, 24	mpbid 233	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → (𝑘 ∈ ℝ^* ∧ 0 ≤ 𝑘 ∧ 𝑘 ≤ 𝑁))
26	25	simp2d 1136	. . . . . 6 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 0 ≤ 𝑘)
27		elnn0z 11848	. . . . . 6 ⊢ (𝑘 ∈ ℕ₀ ↔ (𝑘 ∈ ℤ ∧ 0 ≤ 𝑘))
28	11, 26, 27	sylanbrc 583	. . . . 5 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝑘 ∈ ℕ₀)
29		dvnf 24211	. . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑘 ∈ ℕ₀) → ((𝑆 D^𝑛 𝐹)‘𝑘):dom ((𝑆 D^𝑛 𝐹)‘𝑘)⟶ℂ)
30	2, 9, 28, 29	syl3anc 1364	. . . 4 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → ((𝑆 D^𝑛 𝐹)‘𝑘):dom ((𝑆 D^𝑛 𝐹)‘𝑘)⟶ℂ)
31		taylfval.b	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝐵 ∈ dom ((𝑆 D^𝑛 𝐹)‘𝑘))
32	31	adantlr 711	. . . 4 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝐵 ∈ dom ((𝑆 D^𝑛 𝐹)‘𝑘))
33	30, 32	ffvelrnd 6724	. . 3 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → (((𝑆 D^𝑛 𝐹)‘𝑘)‘𝐵) ∈ ℂ)
34	28	faccld 13498	. . . 4 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → (!‘𝑘) ∈ ℕ)
35	34	nncnd 11508	. . 3 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → (!‘𝑘) ∈ ℂ)
36	34	nnne0d 11541	. . 3 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → (!‘𝑘) ≠ 0)
37	33, 35, 36	divcld 11270	. 2 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → ((((𝑆 D^𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) ∈ ℂ)
38		simplr 765	. . . 4 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝑋 ∈ ℂ)
39	5	ad2antrr 722	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝐹:𝐴⟶ℂ)
40		dvnbss 24212	. . . . . . . 8 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑘 ∈ ℕ₀) → dom ((𝑆 D^𝑛 𝐹)‘𝑘) ⊆ dom 𝐹)
41	2, 9, 28, 40	syl3anc 1364	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → dom ((𝑆 D^𝑛 𝐹)‘𝑘) ⊆ dom 𝐹)
42	39, 41	fssdmd 6404	. . . . . 6 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → dom ((𝑆 D^𝑛 𝐹)‘𝑘) ⊆ 𝐴)
43		recnprss 24189	. . . . . . . . 9 ⊢ (𝑆 ∈ {ℝ, ℂ} → 𝑆 ⊆ ℂ)
44	1, 43	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑆 ⊆ ℂ)
45	6, 44	sstrd 3905	. . . . . . 7 ⊢ (𝜑 → 𝐴 ⊆ ℂ)
46	45	ad2antrr 722	. . . . . 6 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝐴 ⊆ ℂ)
47	42, 46	sstrd 3905	. . . . 5 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → dom ((𝑆 D^𝑛 𝐹)‘𝑘) ⊆ ℂ)
48	47, 32	sseldd 3896	. . . 4 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝐵 ∈ ℂ)
49	38, 48	subcld 10851	. . 3 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → (𝑋 − 𝐵) ∈ ℂ)
50	49, 28	expcld 13364	. 2 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → ((𝑋 − 𝐵)↑𝑘) ∈ ℂ)
51	37, 50	mulcld 10514	1 ⊢ (((𝜑 ∧ 𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → (((((𝑆 D^𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑋 − 𝐵)↑𝑘)) ∈ ℂ)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∨ wo 842 ∧ w3a 1080 = wceq 1525 ∈ wcel 2083 Vcvv 3440 ∩ cin 3864 ⊆ wss 3865 {cpr 4480 class class class wbr 4968 dom cdm 5450 ⟶wf 6228 ‘cfv 6232 (class class class)co 7023 ↑_pm cpm 8264 ℂcc 10388 ℝcr 10389 0cc0 10390 · cmul 10395 +∞cpnf 10525 ℝ^*cxr 10527 ≤ cle 10529 − cmin 10723 / cdiv 11151 ℕ₀cn0 11751 ℤcz 11835 [,]cicc 12595 ↑cexp 13283 !cfa 13487 D^𝑛 cdvn 24149

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1781 ax-4 1795 ax-5 1892 ax-6 1951 ax-7 1996 ax-8 2085 ax-9 2093 ax-10 2114 ax-11 2128 ax-12 2143 ax-13 2346 ax-ext 2771 ax-rep 5088 ax-sep 5101 ax-nul 5108 ax-pow 5164 ax-pr 5228 ax-un 7326 ax-inf2 8957 ax-cnex 10446 ax-resscn 10447 ax-1cn 10448 ax-icn 10449 ax-addcl 10450 ax-addrcl 10451 ax-mulcl 10452 ax-mulrcl 10453 ax-mulcom 10454 ax-addass 10455 ax-mulass 10456 ax-distr 10457 ax-i2m1 10458 ax-1ne0 10459 ax-1rid 10460 ax-rnegex 10461 ax-rrecex 10462 ax-cnre 10463 ax-pre-lttri 10464 ax-pre-lttrn 10465 ax-pre-ltadd 10466 ax-pre-mulgt0 10467 ax-pre-sup 10468

This theorem depends on definitions: df-bi 208 df-an 397 df-or 843 df-3or 1081 df-3an 1082 df-tru 1528 df-ex 1766 df-nf 1770 df-sb 2045 df-mo 2578 df-eu 2614 df-clab 2778 df-cleq 2790 df-clel 2865 df-nfc 2937 df-ne 2987 df-nel 3093 df-ral 3112 df-rex 3113 df-reu 3114 df-rmo 3115 df-rab 3116 df-v 3442 df-sbc 3712 df-csb 3818 df-dif 3868 df-un 3870 df-in 3872 df-ss 3880 df-pss 3882 df-nul 4218 df-if 4388 df-pw 4461 df-sn 4479 df-pr 4481 df-tp 4483 df-op 4485 df-uni 4752 df-int 4789 df-iun 4833 df-iin 4834 df-br 4969 df-opab 5031 df-mpt 5048 df-tr 5071 df-id 5355 df-eprel 5360 df-po 5369 df-so 5370 df-fr 5409 df-we 5411 df-xp 5456 df-rel 5457 df-cnv 5458 df-co 5459 df-dm 5460 df-rn 5461 df-res 5462 df-ima 5463 df-pred 6030 df-ord 6076 df-on 6077 df-lim 6078 df-suc 6079 df-iota 6196 df-fun 6234 df-fn 6235 df-f 6236 df-f1 6237 df-fo 6238 df-f1o 6239 df-fv 6240 df-riota 6984 df-ov 7026 df-oprab 7027 df-mpo 7028 df-om 7444 df-1st 7552 df-2nd 7553 df-wrecs 7805 df-recs 7867 df-rdg 7905 df-1o 7960 df-oadd 7964 df-er 8146 df-map 8265 df-pm 8266 df-en 8365 df-dom 8366 df-sdom 8367 df-fin 8368 df-fi 8728 df-sup 8759 df-inf 8760 df-pnf 10530 df-mnf 10531 df-xr 10532 df-ltxr 10533 df-le 10534 df-sub 10725 df-neg 10726 df-div 11152 df-nn 11493 df-2 11554 df-3 11555 df-4 11556 df-5 11557 df-6 11558 df-7 11559 df-8 11560 df-9 11561 df-n0 11752 df-z 11836 df-dec 11953 df-uz 12098 df-q 12202 df-rp 12244 df-xneg 12361 df-xadd 12362 df-xmul 12363 df-icc 12599 df-fz 12747 df-seq 13224 df-exp 13284 df-fac 13488 df-cj 14296 df-re 14297 df-im 14298 df-sqrt 14432 df-abs 14433 df-struct 16318 df-ndx 16319 df-slot 16320 df-base 16322 df-plusg 16411 df-mulr 16412 df-starv 16413 df-tset 16417 df-ple 16418 df-ds 16420 df-unif 16421 df-rest 16529 df-topn 16530 df-topgen 16550 df-psmet 20223 df-xmet 20224 df-met 20225 df-bl 20226 df-mopn 20227 df-fbas 20228 df-fg 20229 df-cnfld 20232 df-top 21190 df-topon 21207 df-topsp 21229 df-bases 21242 df-cld 21315 df-ntr 21316 df-cls 21317 df-nei 21394 df-lp 21432 df-perf 21433 df-cnp 21524 df-haus 21611 df-fil 22142 df-fm 22234 df-flim 22235 df-flf 22236 df-xms 22617 df-ms 22618 df-limc 24151 df-dv 24152 df-dvn 24153

This theorem is referenced by: taylfvallem 24633 taylf 24636 taylplem2 24639 taylpfval 24640

W3C validator