| 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 24822 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝐴𝐷𝑥) = (abs‘(𝐴 − 𝑥))) |
| 3 | recn 11153 | . . . . . . . . . 10 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 4 | recn 11153 | . . . . . . . . . 10 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℂ) | |
| 5 | abssub 15330 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (abs‘(𝐴 − 𝑥)) = (abs‘(𝑥 − 𝐴))) | |
| 6 | 3, 4, 5 | syl2an 604 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (abs‘(𝐴 − 𝑥)) = (abs‘(𝑥 − 𝐴))) |
| 7 | 2, 6 | eqtrd 2791 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝐴𝐷𝑥) = (abs‘(𝑥 − 𝐴))) |
| 8 | 7 | breq1d 5104 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((𝐴𝐷𝑥) < 𝐵 ↔ (abs‘(𝑥 − 𝐴)) < 𝐵)) |
| 9 | 8 | adantlr 723 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑥 ∈ ℝ) → ((𝐴𝐷𝑥) < 𝐵 ↔ (abs‘(𝑥 − 𝐴)) < 𝐵)) |
| 10 | absdiflt 15321 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((abs‘(𝑥 − 𝐴)) < 𝐵 ↔ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) | |
| 11 | 10 | 3expb 1129 | . . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ)) → ((abs‘(𝑥 − 𝐴)) < 𝐵 ↔ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 12 | 11 | ancoms 461 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑥 ∈ ℝ) → ((abs‘(𝑥 − 𝐴)) < 𝐵 ↔ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 13 | 9, 12 | bitrd 281 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑥 ∈ ℝ) → ((𝐴𝐷𝑥) < 𝐵 ↔ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 14 | 13 | pm5.32da 586 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵) ↔ (𝑥 ∈ ℝ ∧ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵))))) |
| 15 | 3anass 1103 | . . . 4 ⊢ ((𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)) ↔ (𝑥 ∈ ℝ ∧ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) | |
| 16 | 14, 15 | bitr4di 291 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵) ↔ (𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 17 | rexr 11218 | . . . 4 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ*) | |
| 18 | 1 | rexmet 24824 | . . . . 5 ⊢ 𝐷 ∈ (∞Met‘ℝ) |
| 19 | elbl 24421 | . . . . 5 ⊢ ((𝐷 ∈ (∞Met‘ℝ) ∧ 𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) → (𝑥 ∈ (𝐴(ball‘𝐷)𝐵) ↔ (𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵))) | |
| 20 | 18, 19 | mp3an1 1463 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) → (𝑥 ∈ (𝐴(ball‘𝐷)𝐵) ↔ (𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵))) |
| 21 | 17, 20 | sylan2 601 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑥 ∈ (𝐴(ball‘𝐷)𝐵) ↔ (𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵))) |
| 22 | resubcl 11485 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 − 𝐵) ∈ ℝ) | |
| 23 | readdcl 11146 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) ∈ ℝ) | |
| 24 | rexr 11218 | . . . . 5 ⊢ ((𝐴 − 𝐵) ∈ ℝ → (𝐴 − 𝐵) ∈ ℝ*) | |
| 25 | rexr 11218 | . . . . 5 ⊢ ((𝐴 + 𝐵) ∈ ℝ → (𝐴 + 𝐵) ∈ ℝ*) | |
| 26 | elioo2 13380 | . . . . 5 ⊢ (((𝐴 − 𝐵) ∈ ℝ* ∧ (𝐴 + 𝐵) ∈ ℝ*) → (𝑥 ∈ ((𝐴 − 𝐵)(,)(𝐴 + 𝐵)) ↔ (𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) | |
| 27 | 24, 25, 26 | syl2an 604 | . . . 4 ⊢ (((𝐴 − 𝐵) ∈ ℝ ∧ (𝐴 + 𝐵) ∈ ℝ) → (𝑥 ∈ ((𝐴 − 𝐵)(,)(𝐴 + 𝐵)) ↔ (𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 28 | 22, 23, 27 | syl2anc 592 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑥 ∈ ((𝐴 − 𝐵)(,)(𝐴 + 𝐵)) ↔ (𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 29 | 16, 21, 28 | 3bitr4d 313 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑥 ∈ (𝐴(ball‘𝐷)𝐵) ↔ 𝑥 ∈ ((𝐴 − 𝐵)(,)(𝐴 + 𝐵)))) |
| 30 | 29 | eqrdv 2754 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴(ball‘𝐷)𝐵) = ((𝐴 − 𝐵)(,)(𝐴 + 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1095 = wceq 1554 ∈ wcel 2136 class class class wbr 5094 × cxp 5638 ↾ cres 5642 ∘ ccom 5644 ‘cfv 6510 (class class class)co 7385 ℂcc 11061 ℝcr 11062 + caddc 11066 ℝ*cxr 11205 < clt 11206 − cmin 11404 (,)cioo 13339 abscabs 15237 ∞Metcxmet 21382 ballcbl 21384 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-10 2169 ax-11 2185 ax-12 2206 ax-ext 2728 ax-sep 5240 ax-nul 5250 ax-pow 5316 ax-pr 5384 ax-un 7707 ax-cnex 11119 ax-resscn 11120 ax-1cn 11121 ax-icn 11122 ax-addcl 11123 ax-addrcl 11124 ax-mulcl 11125 ax-mulrcl 11126 ax-mulcom 11127 ax-addass 11128 ax-mulass 11129 ax-distr 11130 ax-i2m1 11131 ax-1ne0 11132 ax-1rid 11133 ax-rnegex 11134 ax-rrecex 11135 ax-cnre 11136 ax-pre-lttri 11137 ax-pre-lttrn 11138 ax-pre-ltadd 11139 ax-pre-mulgt0 11140 ax-pre-sup 11141 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-nf 1798 df-sb 2085 df-mo 2560 df-eu 2590 df-clab 2735 df-cleq 2748 df-clel 2831 df-nfc 2905 df-ne 2952 df-nel 3056 df-ral 3071 df-rex 3081 df-rmo 3361 df-reu 3362 df-rab 3409 df-v 3450 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4281 df-if 4475 df-pw 4551 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-iun 4945 df-br 5095 df-opab 5157 df-mpt 5176 df-tr 5202 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6466 df-fun 6512 df-fn 6513 df-f 6514 df-f1 6515 df-fo 6516 df-f1o 6517 df-fv 6518 df-riota 7342 df-ov 7388 df-oprab 7389 df-mpo 7390 df-om 7836 df-1st 7959 df-2nd 7960 df-frecs 8250 df-wrecs 8281 df-recs 8330 df-rdg 8369 df-er 8666 df-map 8798 df-en 8917 df-dom 8918 df-sdom 8919 df-sup 9378 df-pnf 11208 df-mnf 11209 df-xr 11210 df-ltxr 11211 df-le 11212 df-sub 11406 df-neg 11407 df-div 11835 df-nn 12201 df-2 12270 df-3 12271 df-n0 12472 df-z 12559 df-uz 12830 df-rp 12984 df-xadd 13105 df-ioo 13343 df-seq 14005 df-exp 14065 df-cj 15102 df-re 15103 df-im 15104 df-sqrt 15238 df-abs 15239 df-psmet 21389 df-xmet 21390 df-met 21391 df-bl 21392 |
| This theorem is referenced by: ioo2bl 24826 blssioo 24828 tgioo 24829 iccntr 24855 icccmplem2 24857 reconnlem2 24861 opnreen 24865 lebnumii 25001 opnmbllem 25636 lhop 26051 dvcnvre 26054 dya2icoseg2 34529 opnrebl 36628 opnrebl2 36629 opnmbllem0 38103 iooabslt 46023 |
| Copyright terms: Public domain | W3C validator |