![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > taylplem1 | Structured version Visualization version GIF version |
Description: Lemma for taylpfval 26421 and similar theorems. (Contributed by Mario Carneiro, 31-Dec-2016.) |
Ref | Expression |
---|---|
taylpfval.s | ⊢ (𝜑 → 𝑆 ∈ {ℝ, ℂ}) |
taylpfval.f | ⊢ (𝜑 → 𝐹:𝐴⟶ℂ) |
taylpfval.a | ⊢ (𝜑 → 𝐴 ⊆ 𝑆) |
taylpfval.n | ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
taylpfval.b | ⊢ (𝜑 → 𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑁)) |
Ref | Expression |
---|---|
taylplem1 | ⊢ ((𝜑 ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑘)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0z 12622 | . . . . 5 ⊢ 0 ∈ ℤ | |
2 | taylpfval.n | . . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
3 | 2 | nn0zd 12637 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
4 | fzval2 13547 | . . . . 5 ⊢ ((0 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (0...𝑁) = ((0[,]𝑁) ∩ ℤ)) | |
5 | 1, 3, 4 | sylancr 587 | . . . 4 ⊢ (𝜑 → (0...𝑁) = ((0[,]𝑁) ∩ ℤ)) |
6 | 5 | eleq2d 2825 | . . 3 ⊢ (𝜑 → (𝑘 ∈ (0...𝑁) ↔ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ))) |
7 | 6 | biimpar 477 | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝑘 ∈ (0...𝑁)) |
8 | taylpfval.s | . . . . 5 ⊢ (𝜑 → 𝑆 ∈ {ℝ, ℂ}) | |
9 | cnex 11234 | . . . . . . 7 ⊢ ℂ ∈ V | |
10 | 9 | a1i 11 | . . . . . 6 ⊢ (𝜑 → ℂ ∈ V) |
11 | taylpfval.f | . . . . . 6 ⊢ (𝜑 → 𝐹:𝐴⟶ℂ) | |
12 | taylpfval.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ⊆ 𝑆) | |
13 | elpm2r 8884 | . . . . . 6 ⊢ (((ℂ ∈ V ∧ 𝑆 ∈ {ℝ, ℂ}) ∧ (𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ 𝑆)) → 𝐹 ∈ (ℂ ↑pm 𝑆)) | |
14 | 10, 8, 11, 12, 13 | syl22anc 839 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ (ℂ ↑pm 𝑆)) |
15 | 8, 14 | jca 511 | . . . 4 ⊢ (𝜑 → (𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆))) |
16 | dvn2bss 25981 | . . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑘 ∈ (0...𝑁)) → dom ((𝑆 D𝑛 𝐹)‘𝑁) ⊆ dom ((𝑆 D𝑛 𝐹)‘𝑘)) | |
17 | 16 | 3expa 1117 | . . . 4 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ 𝑘 ∈ (0...𝑁)) → dom ((𝑆 D𝑛 𝐹)‘𝑁) ⊆ dom ((𝑆 D𝑛 𝐹)‘𝑘)) |
18 | 15, 17 | sylan 580 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → dom ((𝑆 D𝑛 𝐹)‘𝑁) ⊆ dom ((𝑆 D𝑛 𝐹)‘𝑘)) |
19 | taylpfval.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑁)) | |
20 | 19 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → 𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑁)) |
21 | 18, 20 | sseldd 3996 | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → 𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑘)) |
22 | 7, 21 | syldan 591 | 1 ⊢ ((𝜑 ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑘)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2106 Vcvv 3478 ∩ cin 3962 ⊆ wss 3963 {cpr 4633 dom cdm 5689 ⟶wf 6559 ‘cfv 6563 (class class class)co 7431 ↑pm cpm 8866 ℂcc 11151 ℝcr 11152 0cc0 11153 ℕ0cn0 12524 ℤcz 12611 [,]cicc 13387 ...cfz 13544 D𝑛 cdvn 25914 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-inf2 9679 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 ax-pre-sup 11231 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-tp 4636 df-op 4638 df-uni 4913 df-int 4952 df-iun 4998 df-iin 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-er 8744 df-map 8867 df-pm 8868 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-fi 9449 df-sup 9480 df-inf 9481 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-div 11919 df-nn 12265 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-7 12332 df-8 12333 df-9 12334 df-n0 12525 df-z 12612 df-dec 12732 df-uz 12877 df-q 12989 df-rp 13033 df-xneg 13152 df-xadd 13153 df-xmul 13154 df-icc 13391 df-fz 13545 df-seq 14040 df-exp 14100 df-cj 15135 df-re 15136 df-im 15137 df-sqrt 15271 df-abs 15272 df-struct 17181 df-slot 17216 df-ndx 17228 df-base 17246 df-plusg 17311 df-mulr 17312 df-starv 17313 df-tset 17317 df-ple 17318 df-ds 17320 df-unif 17321 df-rest 17469 df-topn 17470 df-topgen 17490 df-psmet 21374 df-xmet 21375 df-met 21376 df-bl 21377 df-mopn 21378 df-fbas 21379 df-fg 21380 df-cnfld 21383 df-top 22916 df-topon 22933 df-topsp 22955 df-bases 22969 df-cld 23043 df-ntr 23044 df-cls 23045 df-nei 23122 df-lp 23160 df-perf 23161 df-cnp 23252 df-haus 23339 df-fil 23870 df-fm 23962 df-flim 23963 df-flf 23964 df-xms 24346 df-ms 24347 df-limc 25916 df-dv 25917 df-dvn 25918 |
This theorem is referenced by: taylplem2 26420 taylpfval 26421 dvtaylp 26427 dvntaylp0 26429 |
Copyright terms: Public domain | W3C validator |