| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rlim0 | Structured version Visualization version GIF version | ||
| Description: Express the predicate 𝐵(𝑧) converges to 0. (Contributed by Mario Carneiro, 16-Sep-2014.) (Revised by Mario Carneiro, 28-Feb-2015.) |
| Ref | Expression |
|---|---|
| rlim0.1 | ⊢ (𝜑 → ∀𝑧 ∈ 𝐴 𝐵 ∈ ℂ) |
| rlim0.2 | ⊢ (𝜑 → 𝐴 ⊆ ℝ) |
| Ref | Expression |
|---|---|
| rlim0 | ⊢ (𝜑 → ((𝑧 ∈ 𝐴 ↦ 𝐵) ⇝𝑟 0 ↔ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rlim0.1 | . . 3 ⊢ (𝜑 → ∀𝑧 ∈ 𝐴 𝐵 ∈ ℂ) | |
| 2 | rlim0.2 | . . 3 ⊢ (𝜑 → 𝐴 ⊆ ℝ) | |
| 3 | 0cnd 11303 | . . 3 ⊢ (𝜑 → 0 ∈ ℂ) | |
| 4 | 1, 2, 3 | rlim2 15669 | . 2 ⊢ (𝜑 → ((𝑧 ∈ 𝐴 ↦ 𝐵) ⇝𝑟 0 ↔ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥))) |
| 5 | subid1 11582 | . . . . . . . . 9 ⊢ (𝐵 ∈ ℂ → (𝐵 − 0) = 𝐵) | |
| 6 | 5 | fveq2d 6890 | . . . . . . . 8 ⊢ (𝐵 ∈ ℂ → (abs‘(𝐵 − 0)) = (abs‘𝐵)) |
| 7 | 6 | breq1d 5112 | . . . . . . 7 ⊢ (𝐵 ∈ ℂ → ((abs‘(𝐵 − 0)) < 𝑥 ↔ (abs‘𝐵) < 𝑥)) |
| 8 | 7 | imbi2d 343 | . . . . . 6 ⊢ (𝐵 ∈ ℂ → ((𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥))) |
| 9 | 8 | ralimi 3099 | . . . . 5 ⊢ (∀𝑧 ∈ 𝐴 𝐵 ∈ ℂ → ∀𝑧 ∈ 𝐴 ((𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥))) |
| 10 | ralbi 3117 | . . . . 5 ⊢ (∀𝑧 ∈ 𝐴 ((𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥)) → (∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥))) | |
| 11 | 1, 9, 10 | 3syl 19 | . . . 4 ⊢ (𝜑 → (∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥))) |
| 12 | 11 | rexbidv 3186 | . . 3 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥))) |
| 13 | 12 | ralbidv 3185 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥))) |
| 14 | 4, 13 | bitrd 282 | 1 ⊢ (𝜑 → ((𝑧 ∈ 𝐴 ↦ 𝐵) ⇝𝑟 0 ↔ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∈ wcel 2144 ∀wral 3076 ∃wrex 3086 ⊆ wss 3895 class class class wbr 5102 ↦ cmpt 5185 ‘cfv 6539 (class class class)co 7421 ℂcc 11202 ℝcr 11203 0cc0 11204 < clt 11347 ≤ cle 11348 − cmin 11545 ℝ+crp 13124 abscabs 15407 ⇝𝑟 crli 15658 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 ax-cnex 11260 ax-resscn 11261 ax-1cn 11262 ax-icn 11263 ax-addcl 11264 ax-addrcl 11265 ax-mulcl 11266 ax-mulrcl 11267 ax-mulcom 11268 ax-addass 11269 ax-mulass 11270 ax-distr 11271 ax-i2m1 11272 ax-1ne0 11273 ax-1rid 11274 ax-rnegex 11275 ax-rrecex 11276 ax-cnre 11277 ax-pre-lttri 11278 ax-pre-lttrn 11279 ax-pre-ltadd 11280 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-po 5558 df-so 5559 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7378 df-ov 7424 df-oprab 7425 df-mpo 7426 df-er 8721 df-pm 8854 df-en 8978 df-dom 8979 df-sdom 8980 df-pnf 11349 df-mnf 11350 df-ltxr 11352 df-sub 11547 df-rlim 15662 |
| This theorem is used by: o1rlimmul 15792 dvfsumrlim 26357 rlimcxp 27307 |
| Copyright terms: Public domain | W3C validator |