| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > taylplem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for taylpfval 26330 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 12535 | . . . . 5 ⊢ 0 ∈ ℤ | |
| 2 | taylpfval.n | . . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
| 3 | 2 | nn0zd 12549 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 4 | fzval2 13464 | . . . . 5 ⊢ ((0 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (0...𝑁) = ((0[,]𝑁) ∩ ℤ)) | |
| 5 | 1, 3, 4 | sylancr 588 | . . . 4 ⊢ (𝜑 → (0...𝑁) = ((0[,]𝑁) ∩ ℤ)) |
| 6 | 5 | eleq2d 2822 | . . 3 ⊢ (𝜑 → (𝑘 ∈ (0...𝑁) ↔ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ))) |
| 7 | 6 | biimpar 477 | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝑘 ∈ (0...𝑁)) |
| 8 | taylpfval.s | . . . . 5 ⊢ (𝜑 → 𝑆 ∈ {ℝ, ℂ}) | |
| 9 | cnex 11119 | . . . . . . 7 ⊢ ℂ ∈ V | |
| 10 | 9 | a1i 11 | . . . . . 6 ⊢ (𝜑 → ℂ ∈ V) |
| 11 | taylpfval.f | . . . . . 6 ⊢ (𝜑 → 𝐹:𝐴⟶ℂ) | |
| 12 | taylpfval.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ⊆ 𝑆) | |
| 13 | elpm2r 8792 | . . . . . 6 ⊢ (((ℂ ∈ V ∧ 𝑆 ∈ {ℝ, ℂ}) ∧ (𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ 𝑆)) → 𝐹 ∈ (ℂ ↑pm 𝑆)) | |
| 14 | 10, 8, 11, 12, 13 | syl22anc 839 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ (ℂ ↑pm 𝑆)) |
| 15 | 8, 14 | jca 511 | . . . 4 ⊢ (𝜑 → (𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆))) |
| 16 | dvn2bss 25897 | . . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑘 ∈ (0...𝑁)) → dom ((𝑆 D𝑛 𝐹)‘𝑁) ⊆ dom ((𝑆 D𝑛 𝐹)‘𝑘)) | |
| 17 | 16 | 3expa 1119 | . . . 4 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ 𝑘 ∈ (0...𝑁)) → dom ((𝑆 D𝑛 𝐹)‘𝑁) ⊆ dom ((𝑆 D𝑛 𝐹)‘𝑘)) |
| 18 | 15, 17 | sylan 581 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → dom ((𝑆 D𝑛 𝐹)‘𝑁) ⊆ dom ((𝑆 D𝑛 𝐹)‘𝑘)) |
| 19 | taylpfval.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑁)) | |
| 20 | 19 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → 𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑁)) |
| 21 | 18, 20 | sseldd 3922 | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → 𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑘)) |
| 22 | 7, 21 | syldan 592 | 1 ⊢ ((𝜑 ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑘)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3429 ∩ cin 3888 ⊆ wss 3889 {cpr 4569 dom cdm 5631 ⟶wf 6494 ‘cfv 6498 (class class class)co 7367 ↑pm cpm 8774 ℂcc 11036 ℝcr 11037 0cc0 11038 ℕ0cn0 12437 ℤcz 12524 [,]cicc 13301 ...cfz 13461 D𝑛 cdvn 25831 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-inf2 9562 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-iin 4936 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-er 8643 df-map 8775 df-pm 8776 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-fi 9324 df-sup 9355 df-inf 9356 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-nn 12175 df-2 12244 df-3 12245 df-4 12246 df-5 12247 df-6 12248 df-7 12249 df-8 12250 df-9 12251 df-n0 12438 df-z 12525 df-dec 12645 df-uz 12789 df-q 12899 df-rp 12943 df-xneg 13063 df-xadd 13064 df-xmul 13065 df-icc 13305 df-fz 13462 df-seq 13964 df-exp 14024 df-cj 15061 df-re 15062 df-im 15063 df-sqrt 15197 df-abs 15198 df-struct 17117 df-slot 17152 df-ndx 17164 df-base 17180 df-plusg 17233 df-mulr 17234 df-starv 17235 df-tset 17239 df-ple 17240 df-ds 17242 df-unif 17243 df-rest 17385 df-topn 17386 df-topgen 17406 df-psmet 21344 df-xmet 21345 df-met 21346 df-bl 21347 df-mopn 21348 df-fbas 21349 df-fg 21350 df-cnfld 21353 df-top 22859 df-topon 22876 df-topsp 22898 df-bases 22911 df-cld 22984 df-ntr 22985 df-cls 22986 df-nei 23063 df-lp 23101 df-perf 23102 df-cnp 23193 df-haus 23280 df-fil 23811 df-fm 23903 df-flim 23904 df-flf 23905 df-xms 24285 df-ms 24286 df-limc 25833 df-dv 25834 df-dvn 25835 |
| This theorem is referenced by: taylplem2 26329 taylpfval 26330 dvtaylp 26335 dvntaylp0 26337 |
| Copyright terms: Public domain | W3C validator |