| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > taylplem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for taylpfval 26248 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 12516 | . . . . 5 ⊢ 0 ∈ ℤ | |
| 2 | taylpfval.n | . . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
| 3 | 2 | nn0zd 12531 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 4 | fzval2 13447 | . . . . 5 ⊢ ((0 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (0...𝑁) = ((0[,]𝑁) ∩ ℤ)) | |
| 5 | 1, 3, 4 | sylancr 587 | . . . 4 ⊢ (𝜑 → (0...𝑁) = ((0[,]𝑁) ∩ ℤ)) |
| 6 | 5 | eleq2d 2814 | . . 3 ⊢ (𝜑 → (𝑘 ∈ (0...𝑁) ↔ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ))) |
| 7 | 6 | biimpar 477 | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝑘 ∈ (0...𝑁)) |
| 8 | taylpfval.s | . . . . 5 ⊢ (𝜑 → 𝑆 ∈ {ℝ, ℂ}) | |
| 9 | cnex 11125 | . . . . . . 7 ⊢ ℂ ∈ V | |
| 10 | 9 | a1i 11 | . . . . . 6 ⊢ (𝜑 → ℂ ∈ V) |
| 11 | taylpfval.f | . . . . . 6 ⊢ (𝜑 → 𝐹:𝐴⟶ℂ) | |
| 12 | taylpfval.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ⊆ 𝑆) | |
| 13 | elpm2r 8795 | . . . . . 6 ⊢ (((ℂ ∈ V ∧ 𝑆 ∈ {ℝ, ℂ}) ∧ (𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ 𝑆)) → 𝐹 ∈ (ℂ ↑pm 𝑆)) | |
| 14 | 10, 8, 11, 12, 13 | syl22anc 838 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ (ℂ ↑pm 𝑆)) |
| 15 | 8, 14 | jca 511 | . . . 4 ⊢ (𝜑 → (𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆))) |
| 16 | dvn2bss 25808 | . . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑘 ∈ (0...𝑁)) → dom ((𝑆 D𝑛 𝐹)‘𝑁) ⊆ dom ((𝑆 D𝑛 𝐹)‘𝑘)) | |
| 17 | 16 | 3expa 1118 | . . . 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 3944 | . 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 1540 ∈ wcel 2109 Vcvv 3444 ∩ cin 3910 ⊆ wss 3911 {cpr 4587 dom cdm 5631 ⟶wf 6495 ‘cfv 6499 (class class class)co 7369 ↑pm cpm 8777 ℂcc 11042 ℝcr 11043 0cc0 11044 ℕ0cn0 12418 ℤcz 12505 [,]cicc 13285 ...cfz 13444 D𝑛 cdvn 25741 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-inf2 9570 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 ax-pre-sup 11122 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-uni 4868 df-int 4907 df-iun 4953 df-iin 4954 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 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 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-om 7823 df-1st 7947 df-2nd 7948 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-1o 8411 df-er 8648 df-map 8778 df-pm 8779 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-fi 9338 df-sup 9369 df-inf 9370 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-div 11812 df-nn 12163 df-2 12225 df-3 12226 df-4 12227 df-5 12228 df-6 12229 df-7 12230 df-8 12231 df-9 12232 df-n0 12419 df-z 12506 df-dec 12626 df-uz 12770 df-q 12884 df-rp 12928 df-xneg 13048 df-xadd 13049 df-xmul 13050 df-icc 13289 df-fz 13445 df-seq 13943 df-exp 14003 df-cj 15041 df-re 15042 df-im 15043 df-sqrt 15177 df-abs 15178 df-struct 17093 df-slot 17128 df-ndx 17140 df-base 17156 df-plusg 17209 df-mulr 17210 df-starv 17211 df-tset 17215 df-ple 17216 df-ds 17218 df-unif 17219 df-rest 17361 df-topn 17362 df-topgen 17382 df-psmet 21232 df-xmet 21233 df-met 21234 df-bl 21235 df-mopn 21236 df-fbas 21237 df-fg 21238 df-cnfld 21241 df-top 22757 df-topon 22774 df-topsp 22796 df-bases 22809 df-cld 22882 df-ntr 22883 df-cls 22884 df-nei 22961 df-lp 22999 df-perf 23000 df-cnp 23091 df-haus 23178 df-fil 23709 df-fm 23801 df-flim 23802 df-flf 23803 df-xms 24184 df-ms 24185 df-limc 25743 df-dv 25744 df-dvn 25745 |
| This theorem is referenced by: taylplem2 26247 taylpfval 26248 dvtaylp 26254 dvntaylp0 26256 |
| Copyright terms: Public domain | W3C validator |