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 31695. (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 11598 | . 2 ⊢ ℕ0 = (ℤ≥‘0) | |
2 | 0zd 11266 | . 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 31675 | . . . 4 ⊢ (𝜑 → (𝐶 ∈ ℝ ∧ (abs‘𝐶) < 1)) |
8 | 7 | simpld 474 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
9 | 3, 4, 5, 8 | knoppcnlem8 31660 | . 2 ⊢ (𝜑 → seq0( ∘𝑓 + , (𝑚 ∈ ℕ0 ↦ (𝑧 ∈ ℝ ↦ ((𝐹‘𝑧)‘𝑚)))):ℕ0⟶(ℂ ↑𝑚 ℝ)) |
10 | knoppndvlem4.a | . 2 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
11 | seqex 12665 | . . 3 ⊢ seq0( + , (𝐹‘𝐴)) ∈ V | |
12 | 11 | a1i 11 | . 2 ⊢ (𝜑 → seq0( + , (𝐹‘𝐴)) ∈ V) |
13 | 5 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → 𝑁 ∈ ℕ) |
14 | 8 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → 𝐶 ∈ ℝ) |
15 | simpr 476 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → 𝑘 ∈ ℕ0) | |
16 | 3, 4, 13, 14, 15 | knoppcnlem7 31659 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (seq0( ∘𝑓 + , (𝑚 ∈ ℕ0 ↦ (𝑧 ∈ ℝ ↦ ((𝐹‘𝑧)‘𝑚))))‘𝑘) = (𝑣 ∈ ℝ ↦ (seq0( + , (𝐹‘𝑣))‘𝑘))) |
17 | 16 | fveq1d 6105 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((seq0( ∘𝑓 + , (𝑚 ∈ ℕ0 ↦ (𝑧 ∈ ℝ ↦ ((𝐹‘𝑧)‘𝑚))))‘𝑘)‘𝐴) = ((𝑣 ∈ ℝ ↦ (seq0( + , (𝐹‘𝑣))‘𝑘))‘𝐴)) |
18 | eqid 2610 | . . . . . 6 ⊢ (𝑣 ∈ ℝ ↦ (seq0( + , (𝐹‘𝑣))‘𝑘)) = (𝑣 ∈ ℝ ↦ (seq0( + , (𝐹‘𝑣))‘𝑘)) | |
19 | 18 | a1i 11 | . . . . 5 ⊢ (𝜑 → (𝑣 ∈ ℝ ↦ (seq0( + , (𝐹‘𝑣))‘𝑘)) = (𝑣 ∈ ℝ ↦ (seq0( + , (𝐹‘𝑣))‘𝑘))) |
20 | fveq2 6103 | . . . . . . . 8 ⊢ (𝑣 = 𝐴 → (𝐹‘𝑣) = (𝐹‘𝐴)) | |
21 | 20 | seqeq3d 12671 | . . . . . . 7 ⊢ (𝑣 = 𝐴 → seq0( + , (𝐹‘𝑣)) = seq0( + , (𝐹‘𝐴))) |
22 | 21 | fveq1d 6105 | . . . . . 6 ⊢ (𝑣 = 𝐴 → (seq0( + , (𝐹‘𝑣))‘𝑘) = (seq0( + , (𝐹‘𝐴))‘𝑘)) |
23 | 22 | adantl 481 | . . . . 5 ⊢ ((𝜑 ∧ 𝑣 = 𝐴) → (seq0( + , (𝐹‘𝑣))‘𝑘) = (seq0( + , (𝐹‘𝐴))‘𝑘)) |
24 | fvex 6113 | . . . . . 6 ⊢ (seq0( + , (𝐹‘𝐴))‘𝑘) ∈ V | |
25 | 24 | a1i 11 | . . . . 5 ⊢ (𝜑 → (seq0( + , (𝐹‘𝐴))‘𝑘) ∈ V) |
26 | 19, 23, 10, 25 | fvmptd 6197 | . . . 4 ⊢ (𝜑 → ((𝑣 ∈ ℝ ↦ (seq0( + , (𝐹‘𝑣))‘𝑘))‘𝐴) = (seq0( + , (𝐹‘𝐴))‘𝑘)) |
27 | 26 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝑣 ∈ ℝ ↦ (seq0( + , (𝐹‘𝑣))‘𝑘))‘𝐴) = (seq0( + , (𝐹‘𝐴))‘𝑘)) |
28 | 17, 27 | eqtrd 2644 | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((seq0( ∘𝑓 + , (𝑚 ∈ ℕ0 ↦ (𝑧 ∈ ℝ ↦ ((𝐹‘𝑧)‘𝑚))))‘𝑘)‘𝐴) = (seq0( + , (𝐹‘𝐴))‘𝑘)) |
29 | knoppndvlem4.w | . . 3 ⊢ 𝑊 = (𝑤 ∈ ℝ ↦ Σ𝑖 ∈ ℕ0 ((𝐹‘𝑤)‘𝑖)) | |
30 | 7 | simprd 478 | . . 3 ⊢ (𝜑 → (abs‘𝐶) < 1) |
31 | 3, 4, 29, 5, 8, 30 | knoppcnlem9 31661 | . 2 ⊢ (𝜑 → seq0( ∘𝑓 + , (𝑚 ∈ ℕ0 ↦ (𝑧 ∈ ℝ ↦ ((𝐹‘𝑧)‘𝑚))))(⇝𝑢‘ℝ)𝑊) |
32 | 1, 2, 9, 10, 12, 28, 31 | ulmclm 23945 | 1 ⊢ (𝜑 → seq0( + , (𝐹‘𝐴)) ⇝ (𝑊‘𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 Vcvv 3173 class class class wbr 4583 ↦ cmpt 4643 ‘cfv 5804 (class class class)co 6549 ∘𝑓 cof 6793 ℝcr 9814 0cc0 9815 1c1 9816 + caddc 9818 · cmul 9820 < clt 9953 − cmin 10145 -cneg 10146 / cdiv 10563 ℕcn 10897 2c2 10947 ℕ0cn0 11169 (,)cioo 12046 ⌊cfl 12453 seqcseq 12663 ↑cexp 12722 abscabs 13822 ⇝ cli 14063 Σcsu 14264 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-inf2 8421 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 ax-pre-sup 9893 ax-addf 9894 ax-mulf 9895 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-fal 1481 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-se 4998 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-isom 5813 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-of 6795 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-oadd 7451 df-er 7629 df-map 7746 df-pm 7747 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-sup 8231 df-inf 8232 df-oi 8298 df-card 8648 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-div 10564 df-nn 10898 df-2 10956 df-3 10957 df-n0 11170 df-z 11255 df-uz 11564 df-rp 11709 df-ioo 12050 df-ico 12052 df-fz 12198 df-fzo 12335 df-fl 12455 df-seq 12664 df-exp 12723 df-hash 12980 df-cj 13687 df-re 13688 df-im 13689 df-sqrt 13823 df-abs 13824 df-limsup 14050 df-clim 14067 df-rlim 14068 df-sum 14265 df-ulm 23935 |
This theorem is referenced by: knoppndvlem6 31678 knoppf 31696 |
Copyright terms: Public domain | W3C validator |