| 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 24957 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝐴𝐷𝑥) = (abs‘(𝐴 − 𝑥))) |
| 3 | recn 11196 | . . . . . . . . . 10 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 4 | recn 11196 | . . . . . . . . . 10 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℂ) | |
| 5 | abssub 15385 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (abs‘(𝐴 − 𝑥)) = (abs‘(𝑥 − 𝐴))) | |
| 6 | 3, 4, 5 | syl2an 607 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (abs‘(𝐴 − 𝑥)) = (abs‘(𝑥 − 𝐴))) |
| 7 | 2, 6 | eqtrd 2797 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝐴𝐷𝑥) = (abs‘(𝑥 − 𝐴))) |
| 8 | 7 | breq1d 5118 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((𝐴𝐷𝑥) < 𝐵 ↔ (abs‘(𝑥 − 𝐴)) < 𝐵)) |
| 9 | 8 | adantlr 727 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑥 ∈ ℝ) → ((𝐴𝐷𝑥) < 𝐵 ↔ (abs‘(𝑥 − 𝐴)) < 𝐵)) |
| 10 | absdiflt 15376 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((abs‘(𝑥 − 𝐴)) < 𝐵 ↔ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) | |
| 11 | 10 | 3expb 1137 | . . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ)) → ((abs‘(𝑥 − 𝐴)) < 𝐵 ↔ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 12 | 11 | ancoms 463 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑥 ∈ ℝ) → ((abs‘(𝑥 − 𝐴)) < 𝐵 ↔ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 13 | 9, 12 | bitrd 282 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑥 ∈ ℝ) → ((𝐴𝐷𝑥) < 𝐵 ↔ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 14 | 13 | pm5.32da 589 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵) ↔ (𝑥 ∈ ℝ ∧ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵))))) |
| 15 | 3anass 1110 | . . . 4 ⊢ ((𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)) ↔ (𝑥 ∈ ℝ ∧ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) | |
| 16 | 14, 15 | bitr4di 292 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵) ↔ (𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 17 | rexr 11261 | . . . 4 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ*) | |
| 18 | 1 | rexmet 24959 | . . . . 5 ⊢ 𝐷 ∈ (∞Met‘ℝ) |
| 19 | elbl 24556 | . . . . 5 ⊢ ((𝐷 ∈ (∞Met‘ℝ) ∧ 𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) → (𝑥 ∈ (𝐴(ball‘𝐷)𝐵) ↔ (𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵))) | |
| 20 | 18, 19 | mp3an1 1476 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) → (𝑥 ∈ (𝐴(ball‘𝐷)𝐵) ↔ (𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵))) |
| 21 | 17, 20 | sylan2 604 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑥 ∈ (𝐴(ball‘𝐷)𝐵) ↔ (𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵))) |
| 22 | resubcl 11528 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 − 𝐵) ∈ ℝ) | |
| 23 | readdcl 11189 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) ∈ ℝ) | |
| 24 | rexr 11261 | . . . . 5 ⊢ ((𝐴 − 𝐵) ∈ ℝ → (𝐴 − 𝐵) ∈ ℝ*) | |
| 25 | rexr 11261 | . . . . 5 ⊢ ((𝐴 + 𝐵) ∈ ℝ → (𝐴 + 𝐵) ∈ ℝ*) | |
| 26 | elioo2 13419 | . . . . 5 ⊢ (((𝐴 − 𝐵) ∈ ℝ* ∧ (𝐴 + 𝐵) ∈ ℝ*) → (𝑥 ∈ ((𝐴 − 𝐵)(,)(𝐴 + 𝐵)) ↔ (𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) | |
| 27 | 24, 25, 26 | syl2an 607 | . . . 4 ⊢ (((𝐴 − 𝐵) ∈ ℝ ∧ (𝐴 + 𝐵) ∈ ℝ) → (𝑥 ∈ ((𝐴 − 𝐵)(,)(𝐴 + 𝐵)) ↔ (𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 28 | 22, 23, 27 | syl2anc 595 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑥 ∈ ((𝐴 − 𝐵)(,)(𝐴 + 𝐵)) ↔ (𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 29 | 16, 21, 28 | 3bitr4d 314 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑥 ∈ (𝐴(ball‘𝐷)𝐵) ↔ 𝑥 ∈ ((𝐴 − 𝐵)(,)(𝐴 + 𝐵)))) |
| 30 | 29 | eqrdv 2760 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴(ball‘𝐷)𝐵) = ((𝐴 − 𝐵)(,)(𝐴 + 𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1102 = wceq 1569 ∈ wcel 2142 class class class wbr 5108 × cxp 5658 ↾ cres 5662 ∘ ccom 5664 ‘cfv 6536 (class class class)co 7412 ℂcc 11104 ℝcr 11105 + caddc 11109 ℝ*cxr 11248 < clt 11249 − cmin 11447 (,)cioo 13378 abscabs 15292 ∞Metcxmet 21518 ballcbl 21520 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-1st 7984 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-er 8692 df-map 8824 df-en 8942 df-dom 8943 df-sdom 8944 df-sup 9400 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-div 11878 df-nn 12240 df-2 12309 df-3 12310 df-n0 12511 df-z 12598 df-uz 12869 df-rp 13023 df-xadd 13144 df-ioo 13382 df-seq 14045 df-exp 14105 df-cj 15157 df-re 15158 df-im 15159 df-sqrt 15293 df-abs 15294 df-psmet 21525 df-xmet 21526 df-met 21527 df-bl 21528 |
| This theorem is used by: ioo2bl 24961 blssioo 24963 tgioo 24964 iccntr 24990 icccmplem2 24992 reconnlem2 24996 opnreen 25000 lebnumii 25136 opnmbllem 25771 lhop 26186 dvcnvre 26189 dya2icoseg2 34677 opnrebl 36859 opnrebl2 36860 opnmbllem0 38335 iooabslt 46243 |
| Copyright terms: Public domain | W3C validator |