![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > constlimc | Structured version Visualization version GIF version |
Description: Limit of constant function. (Contributed by Glauco Siliprandi, 11-Dec-2019.) |
Ref | Expression |
---|---|
constlimc.f | ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) |
constlimc.a | ⊢ (𝜑 → 𝐴 ⊆ ℂ) |
constlimc.b | ⊢ (𝜑 → 𝐵 ∈ ℂ) |
constlimc.c | ⊢ (𝜑 → 𝐶 ∈ ℂ) |
Ref | Expression |
---|---|
constlimc | ⊢ (𝜑 → 𝐵 ∈ (𝐹 limℂ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | constlimc.b | . 2 ⊢ (𝜑 → 𝐵 ∈ ℂ) | |
2 | 1rp 12049 | . . . . 5 ⊢ 1 ∈ ℝ+ | |
3 | 2 | a1i 11 | . . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ+) → 1 ∈ ℝ+) |
4 | simpr 479 | . . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝐴) → 𝑣 ∈ 𝐴) | |
5 | vex 3343 | . . . . . . . . . . . . . . . 16 ⊢ 𝑣 ∈ V | |
6 | nfcv 2902 | . . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑥𝐵 | |
7 | csbtt 3685 | . . . . . . . . . . . . . . . 16 ⊢ ((𝑣 ∈ V ∧ Ⅎ𝑥𝐵) → ⦋𝑣 / 𝑥⦌𝐵 = 𝐵) | |
8 | 5, 6, 7 | mp2an 710 | . . . . . . . . . . . . . . 15 ⊢ ⦋𝑣 / 𝑥⦌𝐵 = 𝐵 |
9 | 8, 1 | syl5eqel 2843 | . . . . . . . . . . . . . 14 ⊢ (𝜑 → ⦋𝑣 / 𝑥⦌𝐵 ∈ ℂ) |
10 | 9 | adantr 472 | . . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝐴) → ⦋𝑣 / 𝑥⦌𝐵 ∈ ℂ) |
11 | constlimc.f | . . . . . . . . . . . . . 14 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
12 | 11 | fvmpts 6448 | . . . . . . . . . . . . 13 ⊢ ((𝑣 ∈ 𝐴 ∧ ⦋𝑣 / 𝑥⦌𝐵 ∈ ℂ) → (𝐹‘𝑣) = ⦋𝑣 / 𝑥⦌𝐵) |
13 | 4, 10, 12 | syl2anc 696 | . . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝐴) → (𝐹‘𝑣) = ⦋𝑣 / 𝑥⦌𝐵) |
14 | 13 | oveq1d 6829 | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝐴) → ((𝐹‘𝑣) − 𝐵) = (⦋𝑣 / 𝑥⦌𝐵 − 𝐵)) |
15 | 8 | oveq1i 6824 | . . . . . . . . . . 11 ⊢ (⦋𝑣 / 𝑥⦌𝐵 − 𝐵) = (𝐵 − 𝐵) |
16 | 14, 15 | syl6eq 2810 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝐴) → ((𝐹‘𝑣) − 𝐵) = (𝐵 − 𝐵)) |
17 | 16 | fveq2d 6357 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝐴) → (abs‘((𝐹‘𝑣) − 𝐵)) = (abs‘(𝐵 − 𝐵))) |
18 | 1 | subidd 10592 | . . . . . . . . . . 11 ⊢ (𝜑 → (𝐵 − 𝐵) = 0) |
19 | 18 | fveq2d 6357 | . . . . . . . . . 10 ⊢ (𝜑 → (abs‘(𝐵 − 𝐵)) = (abs‘0)) |
20 | 19 | adantr 472 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝐴) → (abs‘(𝐵 − 𝐵)) = (abs‘0)) |
21 | abs0 14244 | . . . . . . . . . 10 ⊢ (abs‘0) = 0 | |
22 | 21 | a1i 11 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝐴) → (abs‘0) = 0) |
23 | 17, 20, 22 | 3eqtrd 2798 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝐴) → (abs‘((𝐹‘𝑣) − 𝐵)) = 0) |
24 | 23 | adantlr 753 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ+) ∧ 𝑣 ∈ 𝐴) → (abs‘((𝐹‘𝑣) − 𝐵)) = 0) |
25 | rpgt0 12057 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ+ → 0 < 𝑦) | |
26 | 25 | ad2antlr 765 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ+) ∧ 𝑣 ∈ 𝐴) → 0 < 𝑦) |
27 | 24, 26 | eqbrtrd 4826 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ+) ∧ 𝑣 ∈ 𝐴) → (abs‘((𝐹‘𝑣) − 𝐵)) < 𝑦) |
28 | 27 | a1d 25 | . . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ+) ∧ 𝑣 ∈ 𝐴) → ((𝑣 ≠ 𝐶 ∧ (abs‘(𝑣 − 𝐶)) < 1) → (abs‘((𝐹‘𝑣) − 𝐵)) < 𝑦)) |
29 | 28 | ralrimiva 3104 | . . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ+) → ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐶 ∧ (abs‘(𝑣 − 𝐶)) < 1) → (abs‘((𝐹‘𝑣) − 𝐵)) < 𝑦)) |
30 | breq2 4808 | . . . . . . . 8 ⊢ (𝑤 = 1 → ((abs‘(𝑣 − 𝐶)) < 𝑤 ↔ (abs‘(𝑣 − 𝐶)) < 1)) | |
31 | 30 | anbi2d 742 | . . . . . . 7 ⊢ (𝑤 = 1 → ((𝑣 ≠ 𝐶 ∧ (abs‘(𝑣 − 𝐶)) < 𝑤) ↔ (𝑣 ≠ 𝐶 ∧ (abs‘(𝑣 − 𝐶)) < 1))) |
32 | 31 | imbi1d 330 | . . . . . 6 ⊢ (𝑤 = 1 → (((𝑣 ≠ 𝐶 ∧ (abs‘(𝑣 − 𝐶)) < 𝑤) → (abs‘((𝐹‘𝑣) − 𝐵)) < 𝑦) ↔ ((𝑣 ≠ 𝐶 ∧ (abs‘(𝑣 − 𝐶)) < 1) → (abs‘((𝐹‘𝑣) − 𝐵)) < 𝑦))) |
33 | 32 | ralbidv 3124 | . . . . 5 ⊢ (𝑤 = 1 → (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐶 ∧ (abs‘(𝑣 − 𝐶)) < 𝑤) → (abs‘((𝐹‘𝑣) − 𝐵)) < 𝑦) ↔ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐶 ∧ (abs‘(𝑣 − 𝐶)) < 1) → (abs‘((𝐹‘𝑣) − 𝐵)) < 𝑦))) |
34 | 33 | rspcev 3449 | . . . 4 ⊢ ((1 ∈ ℝ+ ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐶 ∧ (abs‘(𝑣 − 𝐶)) < 1) → (abs‘((𝐹‘𝑣) − 𝐵)) < 𝑦)) → ∃𝑤 ∈ ℝ+ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐶 ∧ (abs‘(𝑣 − 𝐶)) < 𝑤) → (abs‘((𝐹‘𝑣) − 𝐵)) < 𝑦)) |
35 | 3, 29, 34 | syl2anc 696 | . . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ+) → ∃𝑤 ∈ ℝ+ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐶 ∧ (abs‘(𝑣 − 𝐶)) < 𝑤) → (abs‘((𝐹‘𝑣) − 𝐵)) < 𝑦)) |
36 | 35 | ralrimiva 3104 | . 2 ⊢ (𝜑 → ∀𝑦 ∈ ℝ+ ∃𝑤 ∈ ℝ+ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐶 ∧ (abs‘(𝑣 − 𝐶)) < 𝑤) → (abs‘((𝐹‘𝑣) − 𝐵)) < 𝑦)) |
37 | 1 | adantr 472 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ) |
38 | 37, 11 | fmptd 6549 | . . 3 ⊢ (𝜑 → 𝐹:𝐴⟶ℂ) |
39 | constlimc.a | . . 3 ⊢ (𝜑 → 𝐴 ⊆ ℂ) | |
40 | constlimc.c | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℂ) | |
41 | 38, 39, 40 | ellimc3 23862 | . 2 ⊢ (𝜑 → (𝐵 ∈ (𝐹 limℂ 𝐶) ↔ (𝐵 ∈ ℂ ∧ ∀𝑦 ∈ ℝ+ ∃𝑤 ∈ ℝ+ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐶 ∧ (abs‘(𝑣 − 𝐶)) < 𝑤) → (abs‘((𝐹‘𝑣) − 𝐵)) < 𝑦)))) |
42 | 1, 36, 41 | mpbir2and 995 | 1 ⊢ (𝜑 → 𝐵 ∈ (𝐹 limℂ 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1632 ∈ wcel 2139 Ⅎwnfc 2889 ≠ wne 2932 ∀wral 3050 ∃wrex 3051 Vcvv 3340 ⦋csb 3674 ⊆ wss 3715 class class class wbr 4804 ↦ cmpt 4881 ‘cfv 6049 (class class class)co 6814 ℂcc 10146 0cc0 10148 1c1 10149 < clt 10286 − cmin 10478 ℝ+crp 12045 abscabs 14193 limℂ climc 23845 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1871 ax-4 1886 ax-5 1988 ax-6 2054 ax-7 2090 ax-8 2141 ax-9 2148 ax-10 2168 ax-11 2183 ax-12 2196 ax-13 2391 ax-ext 2740 ax-rep 4923 ax-sep 4933 ax-nul 4941 ax-pow 4992 ax-pr 5055 ax-un 7115 ax-cnex 10204 ax-resscn 10205 ax-1cn 10206 ax-icn 10207 ax-addcl 10208 ax-addrcl 10209 ax-mulcl 10210 ax-mulrcl 10211 ax-mulcom 10212 ax-addass 10213 ax-mulass 10214 ax-distr 10215 ax-i2m1 10216 ax-1ne0 10217 ax-1rid 10218 ax-rnegex 10219 ax-rrecex 10220 ax-cnre 10221 ax-pre-lttri 10222 ax-pre-lttrn 10223 ax-pre-ltadd 10224 ax-pre-mulgt0 10225 ax-pre-sup 10226 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1635 df-ex 1854 df-nf 1859 df-sb 2047 df-eu 2611 df-mo 2612 df-clab 2747 df-cleq 2753 df-clel 2756 df-nfc 2891 df-ne 2933 df-nel 3036 df-ral 3055 df-rex 3056 df-reu 3057 df-rmo 3058 df-rab 3059 df-v 3342 df-sbc 3577 df-csb 3675 df-dif 3718 df-un 3720 df-in 3722 df-ss 3729 df-pss 3731 df-nul 4059 df-if 4231 df-pw 4304 df-sn 4322 df-pr 4324 df-tp 4326 df-op 4328 df-uni 4589 df-int 4628 df-iun 4674 df-br 4805 df-opab 4865 df-mpt 4882 df-tr 4905 df-id 5174 df-eprel 5179 df-po 5187 df-so 5188 df-fr 5225 df-we 5227 df-xp 5272 df-rel 5273 df-cnv 5274 df-co 5275 df-dm 5276 df-rn 5277 df-res 5278 df-ima 5279 df-pred 5841 df-ord 5887 df-on 5888 df-lim 5889 df-suc 5890 df-iota 6012 df-fun 6051 df-fn 6052 df-f 6053 df-f1 6054 df-fo 6055 df-f1o 6056 df-fv 6057 df-riota 6775 df-ov 6817 df-oprab 6818 df-mpt2 6819 df-om 7232 df-1st 7334 df-2nd 7335 df-wrecs 7577 df-recs 7638 df-rdg 7676 df-1o 7730 df-oadd 7734 df-er 7913 df-map 8027 df-pm 8028 df-en 8124 df-dom 8125 df-sdom 8126 df-fin 8127 df-fi 8484 df-sup 8515 df-inf 8516 df-pnf 10288 df-mnf 10289 df-xr 10290 df-ltxr 10291 df-le 10292 df-sub 10480 df-neg 10481 df-div 10897 df-nn 11233 df-2 11291 df-3 11292 df-4 11293 df-5 11294 df-6 11295 df-7 11296 df-8 11297 df-9 11298 df-n0 11505 df-z 11590 df-dec 11706 df-uz 11900 df-q 12002 df-rp 12046 df-xneg 12159 df-xadd 12160 df-xmul 12161 df-fz 12540 df-seq 13016 df-exp 13075 df-cj 14058 df-re 14059 df-im 14060 df-sqrt 14194 df-abs 14195 df-struct 16081 df-ndx 16082 df-slot 16083 df-base 16085 df-plusg 16176 df-mulr 16177 df-starv 16178 df-tset 16182 df-ple 16183 df-ds 16186 df-unif 16187 df-rest 16305 df-topn 16306 df-topgen 16326 df-psmet 19960 df-xmet 19961 df-met 19962 df-bl 19963 df-mopn 19964 df-cnfld 19969 df-top 20921 df-topon 20938 df-topsp 20959 df-bases 20972 df-cnp 21254 df-xms 22346 df-ms 22347 df-limc 23849 |
This theorem is referenced by: reclimc 40406 fourierdlem53 40897 fourierdlem60 40904 fourierdlem61 40905 fourierdlem73 40917 fourierdlem74 40918 fourierdlem75 40919 fourierdlem76 40920 fouriersw 40969 |
Copyright terms: Public domain | W3C validator |