![]() |
Mathbox for Asger C. Ipsen |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > knoppndvlem4 | Structured version Visualization version GIF version |
Description: Lemma for knoppndv 36137. (Contributed by Asger C. Ipsen, 15-Jun-2021.) (Revised by Asger C. Ipsen, 5-Jul-2021.) |
Ref | Expression |
---|---|
knoppndvlem4.t | ⊢ 𝑇 = (𝑥 ∈ ℝ ↦ (abs‘((⌊‘(𝑥 + (1 / 2))) − 𝑥))) |
knoppndvlem4.f | ⊢ 𝐹 = (𝑦 ∈ ℝ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝑦))))) |
knoppndvlem4.w | ⊢ 𝑊 = (𝑤 ∈ ℝ ↦ Σ𝑖 ∈ ℕ0 ((𝐹‘𝑤)‘𝑖)) |
knoppndvlem4.a | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
knoppndvlem4.c | ⊢ (𝜑 → 𝐶 ∈ (-1(,)1)) |
knoppndvlem4.n | ⊢ (𝜑 → 𝑁 ∈ ℕ) |
Ref | Expression |
---|---|
knoppndvlem4 | ⊢ (𝜑 → seq0( + , (𝐹‘𝐴)) ⇝ (𝑊‘𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nn0uz 12897 | . 2 ⊢ ℕ0 = (ℤ≥‘0) | |
2 | 0zd 12603 | . 2 ⊢ (𝜑 → 0 ∈ ℤ) | |
3 | knoppndvlem4.t | . . 3 ⊢ 𝑇 = (𝑥 ∈ ℝ ↦ (abs‘((⌊‘(𝑥 + (1 / 2))) − 𝑥))) | |
4 | knoppndvlem4.f | . . 3 ⊢ 𝐹 = (𝑦 ∈ ℝ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝑦))))) | |
5 | knoppndvlem4.n | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℕ) | |
6 | knoppndvlem4.c | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ (-1(,)1)) | |
7 | 6 | knoppndvlem3 36117 | . . . 4 ⊢ (𝜑 → (𝐶 ∈ ℝ ∧ (abs‘𝐶) < 1)) |
8 | 7 | simpld 493 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
9 | 3, 4, 5, 8 | knoppcnlem8 36103 | . 2 ⊢ (𝜑 → seq0( ∘f + , (𝑚 ∈ ℕ0 ↦ (𝑧 ∈ ℝ ↦ ((𝐹‘𝑧)‘𝑚)))):ℕ0⟶(ℂ ↑m ℝ)) |
10 | knoppndvlem4.a | . 2 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
11 | seqex 14004 | . . 3 ⊢ seq0( + , (𝐹‘𝐴)) ∈ V | |
12 | 11 | a1i 11 | . 2 ⊢ (𝜑 → seq0( + , (𝐹‘𝐴)) ∈ V) |
13 | 5 | adantr 479 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → 𝑁 ∈ ℕ) |
14 | 8 | adantr 479 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → 𝐶 ∈ ℝ) |
15 | simpr 483 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → 𝑘 ∈ ℕ0) | |
16 | 3, 4, 13, 14, 15 | knoppcnlem7 36102 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (seq0( ∘f + , (𝑚 ∈ ℕ0 ↦ (𝑧 ∈ ℝ ↦ ((𝐹‘𝑧)‘𝑚))))‘𝑘) = (𝑣 ∈ ℝ ↦ (seq0( + , (𝐹‘𝑣))‘𝑘))) |
17 | 16 | fveq1d 6898 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((seq0( ∘f + , (𝑚 ∈ ℕ0 ↦ (𝑧 ∈ ℝ ↦ ((𝐹‘𝑧)‘𝑚))))‘𝑘)‘𝐴) = ((𝑣 ∈ ℝ ↦ (seq0( + , (𝐹‘𝑣))‘𝑘))‘𝐴)) |
18 | eqid 2725 | . . . . 5 ⊢ (𝑣 ∈ ℝ ↦ (seq0( + , (𝐹‘𝑣))‘𝑘)) = (𝑣 ∈ ℝ ↦ (seq0( + , (𝐹‘𝑣))‘𝑘)) | |
19 | fveq2 6896 | . . . . . . 7 ⊢ (𝑣 = 𝐴 → (𝐹‘𝑣) = (𝐹‘𝐴)) | |
20 | 19 | seqeq3d 14010 | . . . . . 6 ⊢ (𝑣 = 𝐴 → seq0( + , (𝐹‘𝑣)) = seq0( + , (𝐹‘𝐴))) |
21 | 20 | fveq1d 6898 | . . . . 5 ⊢ (𝑣 = 𝐴 → (seq0( + , (𝐹‘𝑣))‘𝑘) = (seq0( + , (𝐹‘𝐴))‘𝑘)) |
22 | fvexd 6911 | . . . . 5 ⊢ (𝜑 → (seq0( + , (𝐹‘𝐴))‘𝑘) ∈ V) | |
23 | 18, 21, 10, 22 | fvmptd3 7027 | . . . 4 ⊢ (𝜑 → ((𝑣 ∈ ℝ ↦ (seq0( + , (𝐹‘𝑣))‘𝑘))‘𝐴) = (seq0( + , (𝐹‘𝐴))‘𝑘)) |
24 | 23 | adantr 479 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝑣 ∈ ℝ ↦ (seq0( + , (𝐹‘𝑣))‘𝑘))‘𝐴) = (seq0( + , (𝐹‘𝐴))‘𝑘)) |
25 | 17, 24 | eqtrd 2765 | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((seq0( ∘f + , (𝑚 ∈ ℕ0 ↦ (𝑧 ∈ ℝ ↦ ((𝐹‘𝑧)‘𝑚))))‘𝑘)‘𝐴) = (seq0( + , (𝐹‘𝐴))‘𝑘)) |
26 | knoppndvlem4.w | . . 3 ⊢ 𝑊 = (𝑤 ∈ ℝ ↦ Σ𝑖 ∈ ℕ0 ((𝐹‘𝑤)‘𝑖)) | |
27 | 7 | simprd 494 | . . 3 ⊢ (𝜑 → (abs‘𝐶) < 1) |
28 | 3, 4, 26, 5, 8, 27 | knoppcnlem9 36104 | . 2 ⊢ (𝜑 → seq0( ∘f + , (𝑚 ∈ ℕ0 ↦ (𝑧 ∈ ℝ ↦ ((𝐹‘𝑧)‘𝑚))))(⇝𝑢‘ℝ)𝑊) |
29 | 1, 2, 9, 10, 12, 25, 28 | ulmclm 26368 | 1 ⊢ (𝜑 → seq0( + , (𝐹‘𝐴)) ⇝ (𝑊‘𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 394 = wceq 1533 ∈ wcel 2098 Vcvv 3461 class class class wbr 5149 ↦ cmpt 5232 ‘cfv 6549 (class class class)co 7419 ∘f cof 7683 ℝcr 11139 0cc0 11140 1c1 11141 + caddc 11143 · cmul 11145 < clt 11280 − cmin 11476 -cneg 11477 / cdiv 11903 ℕcn 12245 2c2 12300 ℕ0cn0 12505 (,)cioo 13359 ⌊cfl 13791 seqcseq 14002 ↑cexp 14062 abscabs 15217 ⇝ cli 15464 Σcsu 15668 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5365 ax-pr 5429 ax-un 7741 ax-inf2 9666 ax-cnex 11196 ax-resscn 11197 ax-1cn 11198 ax-icn 11199 ax-addcl 11200 ax-addrcl 11201 ax-mulcl 11202 ax-mulrcl 11203 ax-mulcom 11204 ax-addass 11205 ax-mulass 11206 ax-distr 11207 ax-i2m1 11208 ax-1ne0 11209 ax-1rid 11210 ax-rnegex 11211 ax-rrecex 11212 ax-cnre 11213 ax-pre-lttri 11214 ax-pre-lttrn 11215 ax-pre-ltadd 11216 ax-pre-mulgt0 11217 ax-pre-sup 11218 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2930 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3363 df-reu 3364 df-rab 3419 df-v 3463 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3964 df-nul 4323 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4910 df-int 4951 df-iun 4999 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5576 df-eprel 5582 df-po 5590 df-so 5591 df-fr 5633 df-se 5634 df-we 5635 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-pred 6307 df-ord 6374 df-on 6375 df-lim 6376 df-suc 6377 df-iota 6501 df-fun 6551 df-fn 6552 df-f 6553 df-f1 6554 df-fo 6555 df-f1o 6556 df-fv 6557 df-isom 6558 df-riota 7375 df-ov 7422 df-oprab 7423 df-mpo 7424 df-of 7685 df-om 7872 df-1st 7994 df-2nd 7995 df-frecs 8287 df-wrecs 8318 df-recs 8392 df-rdg 8431 df-1o 8487 df-er 8725 df-map 8847 df-pm 8848 df-en 8965 df-dom 8966 df-sdom 8967 df-fin 8968 df-sup 9467 df-inf 9468 df-oi 9535 df-card 9964 df-pnf 11282 df-mnf 11283 df-xr 11284 df-ltxr 11285 df-le 11286 df-sub 11478 df-neg 11479 df-div 11904 df-nn 12246 df-2 12308 df-3 12309 df-n0 12506 df-z 12592 df-uz 12856 df-rp 13010 df-ioo 13363 df-ico 13365 df-fz 13520 df-fzo 13663 df-fl 13793 df-seq 14003 df-exp 14063 df-hash 14326 df-cj 15082 df-re 15083 df-im 15084 df-sqrt 15218 df-abs 15219 df-limsup 15451 df-clim 15468 df-rlim 15469 df-sum 15669 df-ulm 26358 |
This theorem is referenced by: knoppndvlem6 36120 knoppf 36138 |
Copyright terms: Public domain | W3C validator |