![]() |
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 36517. (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 12918 | . 2 ⊢ ℕ0 = (ℤ≥‘0) | |
2 | 0zd 12623 | . 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 36497 | . . . 4 ⊢ (𝜑 → (𝐶 ∈ ℝ ∧ (abs‘𝐶) < 1)) |
8 | 7 | simpld 494 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
9 | 3, 4, 5, 8 | knoppcnlem8 36483 | . 2 ⊢ (𝜑 → seq0( ∘f + , (𝑚 ∈ ℕ0 ↦ (𝑧 ∈ ℝ ↦ ((𝐹‘𝑧)‘𝑚)))):ℕ0⟶(ℂ ↑m ℝ)) |
10 | knoppndvlem4.a | . 2 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
11 | seqex 14041 | . . 3 ⊢ seq0( + , (𝐹‘𝐴)) ∈ V | |
12 | 11 | a1i 11 | . 2 ⊢ (𝜑 → seq0( + , (𝐹‘𝐴)) ∈ V) |
13 | 5 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → 𝑁 ∈ ℕ) |
14 | 8 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → 𝐶 ∈ ℝ) |
15 | simpr 484 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → 𝑘 ∈ ℕ0) | |
16 | 3, 4, 13, 14, 15 | knoppcnlem7 36482 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (seq0( ∘f + , (𝑚 ∈ ℕ0 ↦ (𝑧 ∈ ℝ ↦ ((𝐹‘𝑧)‘𝑚))))‘𝑘) = (𝑣 ∈ ℝ ↦ (seq0( + , (𝐹‘𝑣))‘𝑘))) |
17 | 16 | fveq1d 6909 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((seq0( ∘f + , (𝑚 ∈ ℕ0 ↦ (𝑧 ∈ ℝ ↦ ((𝐹‘𝑧)‘𝑚))))‘𝑘)‘𝐴) = ((𝑣 ∈ ℝ ↦ (seq0( + , (𝐹‘𝑣))‘𝑘))‘𝐴)) |
18 | eqid 2735 | . . . . 5 ⊢ (𝑣 ∈ ℝ ↦ (seq0( + , (𝐹‘𝑣))‘𝑘)) = (𝑣 ∈ ℝ ↦ (seq0( + , (𝐹‘𝑣))‘𝑘)) | |
19 | fveq2 6907 | . . . . . . 7 ⊢ (𝑣 = 𝐴 → (𝐹‘𝑣) = (𝐹‘𝐴)) | |
20 | 19 | seqeq3d 14047 | . . . . . 6 ⊢ (𝑣 = 𝐴 → seq0( + , (𝐹‘𝑣)) = seq0( + , (𝐹‘𝐴))) |
21 | 20 | fveq1d 6909 | . . . . 5 ⊢ (𝑣 = 𝐴 → (seq0( + , (𝐹‘𝑣))‘𝑘) = (seq0( + , (𝐹‘𝐴))‘𝑘)) |
22 | fvexd 6922 | . . . . 5 ⊢ (𝜑 → (seq0( + , (𝐹‘𝐴))‘𝑘) ∈ V) | |
23 | 18, 21, 10, 22 | fvmptd3 7039 | . . . 4 ⊢ (𝜑 → ((𝑣 ∈ ℝ ↦ (seq0( + , (𝐹‘𝑣))‘𝑘))‘𝐴) = (seq0( + , (𝐹‘𝐴))‘𝑘)) |
24 | 23 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝑣 ∈ ℝ ↦ (seq0( + , (𝐹‘𝑣))‘𝑘))‘𝐴) = (seq0( + , (𝐹‘𝐴))‘𝑘)) |
25 | 17, 24 | eqtrd 2775 | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((seq0( ∘f + , (𝑚 ∈ ℕ0 ↦ (𝑧 ∈ ℝ ↦ ((𝐹‘𝑧)‘𝑚))))‘𝑘)‘𝐴) = (seq0( + , (𝐹‘𝐴))‘𝑘)) |
26 | knoppndvlem4.w | . . 3 ⊢ 𝑊 = (𝑤 ∈ ℝ ↦ Σ𝑖 ∈ ℕ0 ((𝐹‘𝑤)‘𝑖)) | |
27 | 7 | simprd 495 | . . 3 ⊢ (𝜑 → (abs‘𝐶) < 1) |
28 | 3, 4, 26, 5, 8, 27 | knoppcnlem9 36484 | . 2 ⊢ (𝜑 → seq0( ∘f + , (𝑚 ∈ ℕ0 ↦ (𝑧 ∈ ℝ ↦ ((𝐹‘𝑧)‘𝑚))))(⇝𝑢‘ℝ)𝑊) |
29 | 1, 2, 9, 10, 12, 25, 28 | ulmclm 26445 | 1 ⊢ (𝜑 → seq0( + , (𝐹‘𝐴)) ⇝ (𝑊‘𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2106 Vcvv 3478 class class class wbr 5148 ↦ cmpt 5231 ‘cfv 6563 (class class class)co 7431 ∘f cof 7695 ℝcr 11152 0cc0 11153 1c1 11154 + caddc 11156 · cmul 11158 < clt 11293 − cmin 11490 -cneg 11491 / cdiv 11918 ℕcn 12264 2c2 12319 ℕ0cn0 12524 (,)cioo 13384 ⌊cfl 13827 seqcseq 14039 ↑cexp 14099 abscabs 15270 ⇝ cli 15517 Σcsu 15719 |
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-op 4638 df-uni 4913 df-int 4952 df-iun 4998 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-se 5642 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-isom 6572 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-of 7697 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-sup 9480 df-inf 9481 df-oi 9548 df-card 9977 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-n0 12525 df-z 12612 df-uz 12877 df-rp 13033 df-ioo 13388 df-ico 13390 df-fz 13545 df-fzo 13692 df-fl 13829 df-seq 14040 df-exp 14100 df-hash 14367 df-cj 15135 df-re 15136 df-im 15137 df-sqrt 15271 df-abs 15272 df-limsup 15504 df-clim 15521 df-rlim 15522 df-sum 15720 df-ulm 26435 |
This theorem is referenced by: knoppndvlem6 36500 knoppf 36518 |
Copyright terms: Public domain | W3C validator |