Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dvn2bss | Structured version Visualization version GIF version |
Description: An N-times differentiable point is an M-times differentiable point, if 𝑀 ≤ 𝑁. (Contributed by Mario Carneiro, 30-Dec-2016.) |
Ref | Expression |
---|---|
dvn2bss | ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → dom ((𝑆 D𝑛 𝐹)‘𝑁) ⊆ dom ((𝑆 D𝑛 𝐹)‘𝑀)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp1 1132 | . . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → 𝑆 ∈ {ℝ, ℂ}) | |
2 | simp2 1133 | . . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → 𝐹 ∈ (ℂ ↑pm 𝑆)) | |
3 | elfznn0 13001 | . . . . . 6 ⊢ (𝑀 ∈ (0...𝑁) → 𝑀 ∈ ℕ0) | |
4 | 3 | 3ad2ant3 1131 | . . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → 𝑀 ∈ ℕ0) |
5 | elfzuz3 12906 | . . . . . . 7 ⊢ (𝑀 ∈ (0...𝑁) → 𝑁 ∈ (ℤ≥‘𝑀)) | |
6 | 5 | 3ad2ant3 1131 | . . . . . 6 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → 𝑁 ∈ (ℤ≥‘𝑀)) |
7 | uznn0sub 12278 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 − 𝑀) ∈ ℕ0) | |
8 | 6, 7 | syl 17 | . . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → (𝑁 − 𝑀) ∈ ℕ0) |
9 | dvnadd 24526 | . . . . 5 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ (𝑀 ∈ ℕ0 ∧ (𝑁 − 𝑀) ∈ ℕ0)) → ((𝑆 D𝑛 ((𝑆 D𝑛 𝐹)‘𝑀))‘(𝑁 − 𝑀)) = ((𝑆 D𝑛 𝐹)‘(𝑀 + (𝑁 − 𝑀)))) | |
10 | 1, 2, 4, 8, 9 | syl22anc 836 | . . . 4 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → ((𝑆 D𝑛 ((𝑆 D𝑛 𝐹)‘𝑀))‘(𝑁 − 𝑀)) = ((𝑆 D𝑛 𝐹)‘(𝑀 + (𝑁 − 𝑀)))) |
11 | 4 | nn0cnd 11958 | . . . . . 6 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → 𝑀 ∈ ℂ) |
12 | elfzuz2 12913 | . . . . . . . . 9 ⊢ (𝑀 ∈ (0...𝑁) → 𝑁 ∈ (ℤ≥‘0)) | |
13 | 12 | 3ad2ant3 1131 | . . . . . . . 8 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → 𝑁 ∈ (ℤ≥‘0)) |
14 | nn0uz 12281 | . . . . . . . 8 ⊢ ℕ0 = (ℤ≥‘0) | |
15 | 13, 14 | eleqtrrdi 2924 | . . . . . . 7 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → 𝑁 ∈ ℕ0) |
16 | 15 | nn0cnd 11958 | . . . . . 6 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → 𝑁 ∈ ℂ) |
17 | 11, 16 | pncan3d 11000 | . . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → (𝑀 + (𝑁 − 𝑀)) = 𝑁) |
18 | 17 | fveq2d 6674 | . . . 4 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → ((𝑆 D𝑛 𝐹)‘(𝑀 + (𝑁 − 𝑀))) = ((𝑆 D𝑛 𝐹)‘𝑁)) |
19 | 10, 18 | eqtrd 2856 | . . 3 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → ((𝑆 D𝑛 ((𝑆 D𝑛 𝐹)‘𝑀))‘(𝑁 − 𝑀)) = ((𝑆 D𝑛 𝐹)‘𝑁)) |
20 | 19 | dmeqd 5774 | . 2 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → dom ((𝑆 D𝑛 ((𝑆 D𝑛 𝐹)‘𝑀))‘(𝑁 − 𝑀)) = dom ((𝑆 D𝑛 𝐹)‘𝑁)) |
21 | cnex 10618 | . . . . 5 ⊢ ℂ ∈ V | |
22 | 21 | a1i 11 | . . . 4 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → ℂ ∈ V) |
23 | dvnf 24524 | . . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ ℕ0) → ((𝑆 D𝑛 𝐹)‘𝑀):dom ((𝑆 D𝑛 𝐹)‘𝑀)⟶ℂ) | |
24 | 3, 23 | syl3an3 1161 | . . . 4 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → ((𝑆 D𝑛 𝐹)‘𝑀):dom ((𝑆 D𝑛 𝐹)‘𝑀)⟶ℂ) |
25 | dvnbss 24525 | . . . . . 6 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ ℕ0) → dom ((𝑆 D𝑛 𝐹)‘𝑀) ⊆ dom 𝐹) | |
26 | 3, 25 | syl3an3 1161 | . . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → dom ((𝑆 D𝑛 𝐹)‘𝑀) ⊆ dom 𝐹) |
27 | elpmi 8425 | . . . . . . 7 ⊢ (𝐹 ∈ (ℂ ↑pm 𝑆) → (𝐹:dom 𝐹⟶ℂ ∧ dom 𝐹 ⊆ 𝑆)) | |
28 | 27 | 3ad2ant2 1130 | . . . . . 6 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → (𝐹:dom 𝐹⟶ℂ ∧ dom 𝐹 ⊆ 𝑆)) |
29 | 28 | simprd 498 | . . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → dom 𝐹 ⊆ 𝑆) |
30 | 26, 29 | sstrd 3977 | . . . 4 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → dom ((𝑆 D𝑛 𝐹)‘𝑀) ⊆ 𝑆) |
31 | elpm2r 8424 | . . . 4 ⊢ (((ℂ ∈ V ∧ 𝑆 ∈ {ℝ, ℂ}) ∧ (((𝑆 D𝑛 𝐹)‘𝑀):dom ((𝑆 D𝑛 𝐹)‘𝑀)⟶ℂ ∧ dom ((𝑆 D𝑛 𝐹)‘𝑀) ⊆ 𝑆)) → ((𝑆 D𝑛 𝐹)‘𝑀) ∈ (ℂ ↑pm 𝑆)) | |
32 | 22, 1, 24, 30, 31 | syl22anc 836 | . . 3 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → ((𝑆 D𝑛 𝐹)‘𝑀) ∈ (ℂ ↑pm 𝑆)) |
33 | dvnbss 24525 | . . 3 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ ((𝑆 D𝑛 𝐹)‘𝑀) ∈ (ℂ ↑pm 𝑆) ∧ (𝑁 − 𝑀) ∈ ℕ0) → dom ((𝑆 D𝑛 ((𝑆 D𝑛 𝐹)‘𝑀))‘(𝑁 − 𝑀)) ⊆ dom ((𝑆 D𝑛 𝐹)‘𝑀)) | |
34 | 1, 32, 8, 33 | syl3anc 1367 | . 2 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → dom ((𝑆 D𝑛 ((𝑆 D𝑛 𝐹)‘𝑀))‘(𝑁 − 𝑀)) ⊆ dom ((𝑆 D𝑛 𝐹)‘𝑀)) |
35 | 20, 34 | eqsstrrd 4006 | 1 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑀 ∈ (0...𝑁)) → dom ((𝑆 D𝑛 𝐹)‘𝑁) ⊆ dom ((𝑆 D𝑛 𝐹)‘𝑀)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 Vcvv 3494 ⊆ wss 3936 {cpr 4569 dom cdm 5555 ⟶wf 6351 ‘cfv 6355 (class class class)co 7156 ↑pm cpm 8407 ℂcc 10535 ℝcr 10536 0cc0 10537 + caddc 10540 − cmin 10870 ℕ0cn0 11898 ℤ≥cuz 12244 ...cfz 12893 D𝑛 cdvn 24462 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-inf2 9104 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 ax-pre-sup 10615 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-int 4877 df-iun 4921 df-iin 4922 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-1st 7689 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-1o 8102 df-oadd 8106 df-er 8289 df-map 8408 df-pm 8409 df-en 8510 df-dom 8511 df-sdom 8512 df-fin 8513 df-fi 8875 df-sup 8906 df-inf 8907 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-div 11298 df-nn 11639 df-2 11701 df-3 11702 df-4 11703 df-5 11704 df-6 11705 df-7 11706 df-8 11707 df-9 11708 df-n0 11899 df-z 11983 df-dec 12100 df-uz 12245 df-q 12350 df-rp 12391 df-xneg 12508 df-xadd 12509 df-xmul 12510 df-icc 12746 df-fz 12894 df-seq 13371 df-exp 13431 df-cj 14458 df-re 14459 df-im 14460 df-sqrt 14594 df-abs 14595 df-struct 16485 df-ndx 16486 df-slot 16487 df-base 16489 df-plusg 16578 df-mulr 16579 df-starv 16580 df-tset 16584 df-ple 16585 df-ds 16587 df-unif 16588 df-rest 16696 df-topn 16697 df-topgen 16717 df-psmet 20537 df-xmet 20538 df-met 20539 df-bl 20540 df-mopn 20541 df-fbas 20542 df-fg 20543 df-cnfld 20546 df-top 21502 df-topon 21519 df-topsp 21541 df-bases 21554 df-cld 21627 df-ntr 21628 df-cls 21629 df-nei 21706 df-lp 21744 df-perf 21745 df-cnp 21836 df-haus 21923 df-fil 22454 df-fm 22546 df-flim 22547 df-flf 22548 df-xms 22930 df-ms 22931 df-limc 24464 df-dv 24465 df-dvn 24466 |
This theorem is referenced by: taylplem1 24951 taylply2 24956 taylply 24957 taylthlem1 24961 taylthlem2 24962 |
Copyright terms: Public domain | W3C validator |