dvn2bss - Metamath Proof Explorer

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

Theorem dvn2bss 26058

Description: An N-times differentiable point is an M-times differentiable point, if 𝑀 ≤ 𝑁. (Contributed by Mario Carneiro, 30-Dec-2016.)

**Assertion**
Ref	Expression
dvn2bss	⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → dom ((𝑆 D^𝑛 𝐹)‘𝑁) ⊆ dom ((𝑆 D^𝑛 𝐹)‘𝑀))

**Proof of Theorem dvn2bss**
Step	Hyp	Ref	Expression
1		simp1 1152	. . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → 𝑆 ∈ {ℝ, ℂ})
2		simp2 1153	. . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → 𝐹 ∈ (ℂ ↑_pm 𝑆))
3		elfznn0 13648	. . . . . 6 ⊢ (𝑀 ∈ (0...𝑁) → 𝑀 ∈ ℕ₀)
4	3	3ad2ant3 1151	. . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → 𝑀 ∈ ℕ₀)
5		elfzuz3 13549	. . . . . . 7 ⊢ (𝑀 ∈ (0...𝑁) → 𝑁 ∈ (ℤ_≥‘𝑀))
6	5	3ad2ant3 1151	. . . . . 6 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → 𝑁 ∈ (ℤ_≥‘𝑀))
7		uznn0sub 12897	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (𝑁 − 𝑀) ∈ ℕ₀)
8	6, 7	syl 18	. . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → (𝑁 − 𝑀) ∈ ℕ₀)
9		dvnadd 26057	. . . . 5 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆)) ∧ (𝑀 ∈ ℕ₀ ∧ (𝑁 − 𝑀) ∈ ℕ₀)) → ((𝑆 D^𝑛 ((𝑆 D^𝑛 𝐹)‘𝑀))‘(𝑁 − 𝑀)) = ((𝑆 D^𝑛 𝐹)‘(𝑀 + (𝑁 − 𝑀))))
10	1, 2, 4, 8, 9	syl22anc 851	. . . 4 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → ((𝑆 D^𝑛 ((𝑆 D^𝑛 𝐹)‘𝑀))‘(𝑁 − 𝑀)) = ((𝑆 D^𝑛 𝐹)‘(𝑀 + (𝑁 − 𝑀))))
11	4	nn0cnd 12567	. . . . . 6 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → 𝑀 ∈ ℂ)
12		elfzuz2 13557	. . . . . . . . 9 ⊢ (𝑀 ∈ (0...𝑁) → 𝑁 ∈ (ℤ_≥‘0))
13	12	3ad2ant3 1151	. . . . . . . 8 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → 𝑁 ∈ (ℤ_≥‘0))
14		nn0uz 12900	. . . . . . . 8 ⊢ ℕ₀ = (ℤ_≥‘0)
15	13, 14	eleqtrrdi 2880	. . . . . . 7 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → 𝑁 ∈ ℕ₀)
16	15	nn0cnd 12567	. . . . . 6 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → 𝑁 ∈ ℂ)
17	11, 16	pncan3d 11572	. . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → (𝑀 + (𝑁 − 𝑀)) = 𝑁)
18	17	fveq2d 6886	. . . 4 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → ((𝑆 D^𝑛 𝐹)‘(𝑀 + (𝑁 − 𝑀))) = ((𝑆 D^𝑛 𝐹)‘𝑁))
19	10, 18	eqtrd 2804	. . 3 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → ((𝑆 D^𝑛 ((𝑆 D^𝑛 𝐹)‘𝑀))‘(𝑁 − 𝑀)) = ((𝑆 D^𝑛 𝐹)‘𝑁))
20	19	dmeqd 5896	. 2 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → dom ((𝑆 D^𝑛 ((𝑆 D^𝑛 𝐹)‘𝑀))‘(𝑁 − 𝑀)) = dom ((𝑆 D^𝑛 𝐹)‘𝑁))
21		cnex 11181	. . . . 5 ⊢ ℂ ∈ V
22	21	a1i 11	. . . 4 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → ℂ ∈ V)
23		dvnf 26055	. . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ ℕ₀) → ((𝑆 D^𝑛 𝐹)‘𝑀):dom ((𝑆 D^𝑛 𝐹)‘𝑀)⟶ℂ)
24	3, 23	syl3an3 1181	. . . 4 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → ((𝑆 D^𝑛 𝐹)‘𝑀):dom ((𝑆 D^𝑛 𝐹)‘𝑀)⟶ℂ)
25		dvnbss 26056	. . . . . 6 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ ℕ₀) → dom ((𝑆 D^𝑛 𝐹)‘𝑀) ⊆ dom 𝐹)
26	3, 25	syl3an3 1181	. . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → dom ((𝑆 D^𝑛 𝐹)‘𝑀) ⊆ dom 𝐹)
27		elpmi 8843	. . . . . . 7 ⊢ (𝐹 ∈ (ℂ ↑_pm 𝑆) → (𝐹:dom 𝐹⟶ℂ ∧ dom 𝐹 ⊆ 𝑆))
28	27	3ad2ant2 1150	. . . . . 6 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → (𝐹:dom 𝐹⟶ℂ ∧ dom 𝐹 ⊆ 𝑆))
29	28	simprd 500	. . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → dom 𝐹 ⊆ 𝑆)
30	26, 29	sstrd 3955	. . . 4 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → dom ((𝑆 D^𝑛 𝐹)‘𝑀) ⊆ 𝑆)
31		elpm2r 8842	. . . 4 ⊢ (((ℂ ∈ V ∧ 𝑆 ∈ {ℝ, ℂ}) ∧ (((𝑆 D^𝑛 𝐹)‘𝑀):dom ((𝑆 D^𝑛 𝐹)‘𝑀)⟶ℂ ∧ dom ((𝑆 D^𝑛 𝐹)‘𝑀) ⊆ 𝑆)) → ((𝑆 D^𝑛 𝐹)‘𝑀) ∈ (ℂ ↑_pm 𝑆))
32	22, 1, 24, 30, 31	syl22anc 851	. . 3 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → ((𝑆 D^𝑛 𝐹)‘𝑀) ∈ (ℂ ↑_pm 𝑆))
33		dvnbss 26056	. . 3 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ ((𝑆 D^𝑛 𝐹)‘𝑀) ∈ (ℂ ↑_pm 𝑆) ∧ (𝑁 − 𝑀) ∈ ℕ₀) → dom ((𝑆 D^𝑛 ((𝑆 D^𝑛 𝐹)‘𝑀))‘(𝑁 − 𝑀)) ⊆ dom ((𝑆 D^𝑛 𝐹)‘𝑀))
34	1, 32, 8, 33	syl3anc 1396	. 2 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → dom ((𝑆 D^𝑛 ((𝑆 D^𝑛 𝐹)‘𝑀))‘(𝑁 − 𝑀)) ⊆ dom ((𝑆 D^𝑛 𝐹)‘𝑀))
35	20, 34	eqsstrrd 3980	1 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → dom ((𝑆 D^𝑛 𝐹)‘𝑁) ⊆ dom ((𝑆 D^𝑛 𝐹)‘𝑀))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 Vcvv 3463 ⊆ wss 3913 {cpr 4596 dom cdm 5662 ⟶wf 6533 ‘cfv 6537 (class class class)co 7411 ↑_pm cpm 8825 ℂcc 11098 ℝcr 11099 0cc0 11100 + caddc 11103 − cmin 11441 ℕ₀cn0 12504 ℤ_≥cuz 12862 ...cfz 13535 D^𝑛 cdvn 25992

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-inf2 9610 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 ax-pre-sup 11178

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-tp 4599 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-iin 4963 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8453 df-er 8694 df-map 8826 df-pm 8827 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-fi 9371 df-sup 9402 df-inf 9403 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-div 11872 df-nn 12234 df-2 12303 df-3 12304 df-4 12305 df-5 12306 df-6 12307 df-7 12308 df-8 12309 df-9 12310 df-n0 12505 df-z 12592 df-dec 12712 df-uz 12863 df-q 12973 df-rp 13017 df-xneg 13137 df-xadd 13138 df-xmul 13139 df-icc 13379 df-fz 13536 df-seq 14038 df-exp 14098 df-cj 15150 df-re 15151 df-im 15152 df-sqrt 15286 df-abs 15287 df-struct 17207 df-slot 17242 df-ndx 17254 df-base 17270 df-plusg 17323 df-mulr 17324 df-starv 17325 df-tset 17329 df-ple 17330 df-ds 17332 df-unif 17333 df-rest 17475 df-topn 17476 df-topgen 17496 df-psmet 21483 df-xmet 21484 df-met 21485 df-bl 21486 df-mopn 21487 df-fbas 21488 df-fg 21489 df-cnfld 21492 df-top 23020 df-topon 23037 df-topsp 23059 df-bases 23072 df-cld 23145 df-ntr 23146 df-cls 23147 df-nei 23224 df-lp 23262 df-perf 23263 df-cnp 23354 df-haus 23441 df-fil 23972 df-fm 24064 df-flim 24065 df-flf 24066 df-xms 24446 df-ms 24447 df-limc 25994 df-dv 25995 df-dvn 25996

This theorem is referenced by: taylplem1 26492 taylply2 26497 taylply 26498 taylthlem1 26502 taylthlem2 26503

W3C validator