| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > bl2ioo | Structured version Visualization version GIF version | ||
| Description: A ball in terms of an open interval of reals. (Contributed by NM, 18-May-2007.) (Revised by Mario Carneiro, 13-Nov-2013.) |
| Ref | Expression |
|---|---|
| remet.1 | ⊢ 𝐷 = ((abs ∘ − ) ↾ (ℝ × ℝ)) |
| Ref | Expression |
|---|---|
| bl2ioo | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴(ball‘𝐷)𝐵) = ((𝐴 − 𝐵)(,)(𝐴 + 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | remet.1 | . . . . . . . . . 10 ⊢ 𝐷 = ((abs ∘ − ) ↾ (ℝ × ℝ)) | |
| 2 | 1 | remetdval 24697 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝐴𝐷𝑥) = (abs‘(𝐴 − 𝑥))) |
| 3 | recn 11088 | . . . . . . . . . 10 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 4 | recn 11088 | . . . . . . . . . 10 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℂ) | |
| 5 | abssub 15226 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (abs‘(𝐴 − 𝑥)) = (abs‘(𝑥 − 𝐴))) | |
| 6 | 3, 4, 5 | syl2an 596 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (abs‘(𝐴 − 𝑥)) = (abs‘(𝑥 − 𝐴))) |
| 7 | 2, 6 | eqtrd 2765 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝐴𝐷𝑥) = (abs‘(𝑥 − 𝐴))) |
| 8 | 7 | breq1d 5099 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((𝐴𝐷𝑥) < 𝐵 ↔ (abs‘(𝑥 − 𝐴)) < 𝐵)) |
| 9 | 8 | adantlr 715 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑥 ∈ ℝ) → ((𝐴𝐷𝑥) < 𝐵 ↔ (abs‘(𝑥 − 𝐴)) < 𝐵)) |
| 10 | absdiflt 15217 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((abs‘(𝑥 − 𝐴)) < 𝐵 ↔ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) | |
| 11 | 10 | 3expb 1120 | . . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ)) → ((abs‘(𝑥 − 𝐴)) < 𝐵 ↔ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 12 | 11 | ancoms 458 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑥 ∈ ℝ) → ((abs‘(𝑥 − 𝐴)) < 𝐵 ↔ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 13 | 9, 12 | bitrd 279 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑥 ∈ ℝ) → ((𝐴𝐷𝑥) < 𝐵 ↔ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 14 | 13 | pm5.32da 579 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵) ↔ (𝑥 ∈ ℝ ∧ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵))))) |
| 15 | 3anass 1094 | . . . 4 ⊢ ((𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)) ↔ (𝑥 ∈ ℝ ∧ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) | |
| 16 | 14, 15 | bitr4di 289 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵) ↔ (𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 17 | rexr 11150 | . . . 4 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ*) | |
| 18 | 1 | rexmet 24699 | . . . . 5 ⊢ 𝐷 ∈ (∞Met‘ℝ) |
| 19 | elbl 24296 | . . . . 5 ⊢ ((𝐷 ∈ (∞Met‘ℝ) ∧ 𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) → (𝑥 ∈ (𝐴(ball‘𝐷)𝐵) ↔ (𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵))) | |
| 20 | 18, 19 | mp3an1 1450 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) → (𝑥 ∈ (𝐴(ball‘𝐷)𝐵) ↔ (𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵))) |
| 21 | 17, 20 | sylan2 593 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑥 ∈ (𝐴(ball‘𝐷)𝐵) ↔ (𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵))) |
| 22 | resubcl 11417 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 − 𝐵) ∈ ℝ) | |
| 23 | readdcl 11081 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) ∈ ℝ) | |
| 24 | rexr 11150 | . . . . 5 ⊢ ((𝐴 − 𝐵) ∈ ℝ → (𝐴 − 𝐵) ∈ ℝ*) | |
| 25 | rexr 11150 | . . . . 5 ⊢ ((𝐴 + 𝐵) ∈ ℝ → (𝐴 + 𝐵) ∈ ℝ*) | |
| 26 | elioo2 13278 | . . . . 5 ⊢ (((𝐴 − 𝐵) ∈ ℝ* ∧ (𝐴 + 𝐵) ∈ ℝ*) → (𝑥 ∈ ((𝐴 − 𝐵)(,)(𝐴 + 𝐵)) ↔ (𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) | |
| 27 | 24, 25, 26 | syl2an 596 | . . . 4 ⊢ (((𝐴 − 𝐵) ∈ ℝ ∧ (𝐴 + 𝐵) ∈ ℝ) → (𝑥 ∈ ((𝐴 − 𝐵)(,)(𝐴 + 𝐵)) ↔ (𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 28 | 22, 23, 27 | syl2anc 584 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑥 ∈ ((𝐴 − 𝐵)(,)(𝐴 + 𝐵)) ↔ (𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 29 | 16, 21, 28 | 3bitr4d 311 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑥 ∈ (𝐴(ball‘𝐷)𝐵) ↔ 𝑥 ∈ ((𝐴 − 𝐵)(,)(𝐴 + 𝐵)))) |
| 30 | 29 | eqrdv 2728 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴(ball‘𝐷)𝐵) = ((𝐴 − 𝐵)(,)(𝐴 + 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2110 class class class wbr 5089 × cxp 5612 ↾ cres 5616 ∘ ccom 5618 ‘cfv 6477 (class class class)co 7341 ℂcc 10996 ℝcr 10997 + caddc 11001 ℝ*cxr 11137 < clt 11138 − cmin 11336 (,)cioo 13237 abscabs 15133 ∞Metcxmet 21269 ballcbl 21271 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2112 ax-9 2120 ax-10 2143 ax-11 2159 ax-12 2179 ax-ext 2702 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7663 ax-cnex 11054 ax-resscn 11055 ax-1cn 11056 ax-icn 11057 ax-addcl 11058 ax-addrcl 11059 ax-mulcl 11060 ax-mulrcl 11061 ax-mulcom 11062 ax-addass 11063 ax-mulass 11064 ax-distr 11065 ax-i2m1 11066 ax-1ne0 11067 ax-1rid 11068 ax-rnegex 11069 ax-rrecex 11070 ax-cnre 11071 ax-pre-lttri 11072 ax-pre-lttrn 11073 ax-pre-ltadd 11074 ax-pre-mulgt0 11075 ax-pre-sup 11076 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3344 df-reu 3345 df-rab 3394 df-v 3436 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4282 df-if 4474 df-pw 4550 df-sn 4575 df-pr 4577 df-op 4581 df-uni 4858 df-iun 4941 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6244 df-ord 6305 df-on 6306 df-lim 6307 df-suc 6308 df-iota 6433 df-fun 6479 df-fn 6480 df-f 6481 df-f1 6482 df-fo 6483 df-f1o 6484 df-fv 6485 df-riota 7298 df-ov 7344 df-oprab 7345 df-mpo 7346 df-om 7792 df-1st 7916 df-2nd 7917 df-frecs 8206 df-wrecs 8237 df-recs 8286 df-rdg 8324 df-er 8617 df-map 8747 df-en 8865 df-dom 8866 df-sdom 8867 df-sup 9321 df-pnf 11140 df-mnf 11141 df-xr 11142 df-ltxr 11143 df-le 11144 df-sub 11338 df-neg 11339 df-div 11767 df-nn 12118 df-2 12180 df-3 12181 df-n0 12374 df-z 12461 df-uz 12725 df-rp 12883 df-xadd 13004 df-ioo 13241 df-seq 13901 df-exp 13961 df-cj 14998 df-re 14999 df-im 15000 df-sqrt 15134 df-abs 15135 df-psmet 21276 df-xmet 21277 df-met 21278 df-bl 21279 |
| This theorem is referenced by: ioo2bl 24701 blssioo 24703 tgioo 24704 iccntr 24730 icccmplem2 24732 reconnlem2 24736 opnreen 24740 lebnumii 24885 opnmbllem 25522 lhop 25941 dvcnvre 25944 dya2icoseg2 34281 opnrebl 36333 opnrebl2 36334 opnmbllem0 37675 iooabslt 45518 |
| Copyright terms: Public domain | W3C validator |