| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rlim0lt | Structured version Visualization version GIF version | ||
| Description: Use strictly less-than in place of less equal in the real limit predicate. (Contributed by Mario Carneiro, 18-Sep-2014.) (Revised by Mario Carneiro, 28-Feb-2015.) |
| Ref | Expression |
|---|---|
| rlim0.1 | ⊢ (𝜑 → ∀𝑧 ∈ 𝐴 𝐵 ∈ ℂ) |
| rlim0.2 | ⊢ (𝜑 → 𝐴 ⊆ ℝ) |
| Ref | Expression |
|---|---|
| rlim0lt | ⊢ (𝜑 → ((𝑧 ∈ 𝐴 ↦ 𝐵) ⇝𝑟 0 ↔ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 < 𝑧 → (abs‘𝐵) < 𝑥))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rlim0.1 | . . 3 ⊢ (𝜑 → ∀𝑧 ∈ 𝐴 𝐵 ∈ ℂ) | |
| 2 | rlim0.2 | . . 3 ⊢ (𝜑 → 𝐴 ⊆ ℝ) | |
| 3 | 0cnd 11128 | . . 3 ⊢ (𝜑 → 0 ∈ ℂ) | |
| 4 | 1, 2, 3 | rlim2lt 15450 | . 2 ⊢ (𝜑 → ((𝑧 ∈ 𝐴 ↦ 𝐵) ⇝𝑟 0 ↔ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 < 𝑧 → (abs‘(𝐵 − 0)) < 𝑥))) |
| 5 | subid1 11405 | . . . . . . . . 9 ⊢ (𝐵 ∈ ℂ → (𝐵 − 0) = 𝐵) | |
| 6 | 5 | fveq2d 6831 | . . . . . . . 8 ⊢ (𝐵 ∈ ℂ → (abs‘(𝐵 − 0)) = (abs‘𝐵)) |
| 7 | 6 | breq1d 5082 | . . . . . . 7 ⊢ (𝐵 ∈ ℂ → ((abs‘(𝐵 − 0)) < 𝑥 ↔ (abs‘𝐵) < 𝑥)) |
| 8 | 7 | imbi2d 341 | . . . . . 6 ⊢ (𝐵 ∈ ℂ → ((𝑦 < 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ (𝑦 < 𝑧 → (abs‘𝐵) < 𝑥))) |
| 9 | 8 | ralimi 3076 | . . . . 5 ⊢ (∀𝑧 ∈ 𝐴 𝐵 ∈ ℂ → ∀𝑧 ∈ 𝐴 ((𝑦 < 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ (𝑦 < 𝑧 → (abs‘𝐵) < 𝑥))) |
| 10 | ralbi 3094 | . . . . 5 ⊢ (∀𝑧 ∈ 𝐴 ((𝑦 < 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ (𝑦 < 𝑧 → (abs‘𝐵) < 𝑥)) → (∀𝑧 ∈ 𝐴 (𝑦 < 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ ∀𝑧 ∈ 𝐴 (𝑦 < 𝑧 → (abs‘𝐵) < 𝑥))) | |
| 11 | 1, 9, 10 | 3syl 18 | . . . 4 ⊢ (𝜑 → (∀𝑧 ∈ 𝐴 (𝑦 < 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ ∀𝑧 ∈ 𝐴 (𝑦 < 𝑧 → (abs‘𝐵) < 𝑥))) |
| 12 | 11 | rexbidv 3163 | . . 3 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 < 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 < 𝑧 → (abs‘𝐵) < 𝑥))) |
| 13 | 12 | ralbidv 3162 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 < 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 < 𝑧 → (abs‘𝐵) < 𝑥))) |
| 14 | 4, 13 | bitrd 280 | 1 ⊢ (𝜑 → ((𝑧 ∈ 𝐴 ↦ 𝐵) ⇝𝑟 0 ↔ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 < 𝑧 → (abs‘𝐵) < 𝑥))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∈ wcel 2119 ∀wral 3053 ∃wrex 3063 ⊆ wss 3883 class class class wbr 5072 ↦ cmpt 5153 ‘cfv 6485 (class class class)co 7356 ℂcc 11027 ℝcr 11028 0cc0 11029 < clt 11170 − cmin 11368 ℝ+crp 12933 abscabs 15187 ⇝𝑟 crli 15438 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-br 5073 df-opab 5135 df-mpt 5154 df-id 5513 df-po 5526 df-so 5527 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-er 8633 df-pm 8766 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-rlim 15442 |
| This theorem is referenced by: divrcnv 15808 divlogrlim 26617 cxplim 26953 cxploglim 26959 |
| Copyright terms: Public domain | W3C validator |