| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > bl2ioo | 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 15300 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝐴𝐷𝑥) = (abs‘(𝐴 − 𝑥))) |
| 3 | recn 8170 | . . . . . . . . . 10 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 4 | recn 8170 | . . . . . . . . . 10 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℂ) | |
| 5 | abssub 11684 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (abs‘(𝐴 − 𝑥)) = (abs‘(𝑥 − 𝐴))) | |
| 6 | 3, 4, 5 | syl2an 289 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (abs‘(𝐴 − 𝑥)) = (abs‘(𝑥 − 𝐴))) |
| 7 | 2, 6 | eqtrd 2263 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝐴𝐷𝑥) = (abs‘(𝑥 − 𝐴))) |
| 8 | 7 | breq1d 4099 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((𝐴𝐷𝑥) < 𝐵 ↔ (abs‘(𝑥 − 𝐴)) < 𝐵)) |
| 9 | 8 | adantlr 477 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑥 ∈ ℝ) → ((𝐴𝐷𝑥) < 𝐵 ↔ (abs‘(𝑥 − 𝐴)) < 𝐵)) |
| 10 | absdiflt 11675 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((abs‘(𝑥 − 𝐴)) < 𝐵 ↔ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) | |
| 11 | 10 | 3expb 1230 | . . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ)) → ((abs‘(𝑥 − 𝐴)) < 𝐵 ↔ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 12 | 11 | ancoms 268 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑥 ∈ ℝ) → ((abs‘(𝑥 − 𝐴)) < 𝐵 ↔ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 13 | 9, 12 | bitrd 188 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑥 ∈ ℝ) → ((𝐴𝐷𝑥) < 𝐵 ↔ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 14 | 13 | pm5.32da 452 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵) ↔ (𝑥 ∈ ℝ ∧ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵))))) |
| 15 | 3anass 1008 | . . . 4 ⊢ ((𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)) ↔ (𝑥 ∈ ℝ ∧ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) | |
| 16 | 14, 15 | bitr4di 198 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵) ↔ (𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 17 | rexr 8230 | . . . 4 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ*) | |
| 18 | 1 | rexmet 15302 | . . . . 5 ⊢ 𝐷 ∈ (∞Met‘ℝ) |
| 19 | elbl 15144 | . . . . 5 ⊢ ((𝐷 ∈ (∞Met‘ℝ) ∧ 𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) → (𝑥 ∈ (𝐴(ball‘𝐷)𝐵) ↔ (𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵))) | |
| 20 | 18, 19 | mp3an1 1360 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) → (𝑥 ∈ (𝐴(ball‘𝐷)𝐵) ↔ (𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵))) |
| 21 | 17, 20 | sylan2 286 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑥 ∈ (𝐴(ball‘𝐷)𝐵) ↔ (𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵))) |
| 22 | resubcl 8448 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 − 𝐵) ∈ ℝ) | |
| 23 | readdcl 8163 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) ∈ ℝ) | |
| 24 | rexr 8230 | . . . . 5 ⊢ ((𝐴 − 𝐵) ∈ ℝ → (𝐴 − 𝐵) ∈ ℝ*) | |
| 25 | rexr 8230 | . . . . 5 ⊢ ((𝐴 + 𝐵) ∈ ℝ → (𝐴 + 𝐵) ∈ ℝ*) | |
| 26 | elioo2 10161 | . . . . 5 ⊢ (((𝐴 − 𝐵) ∈ ℝ* ∧ (𝐴 + 𝐵) ∈ ℝ*) → (𝑥 ∈ ((𝐴 − 𝐵)(,)(𝐴 + 𝐵)) ↔ (𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) | |
| 27 | 24, 25, 26 | syl2an 289 | . . . 4 ⊢ (((𝐴 − 𝐵) ∈ ℝ ∧ (𝐴 + 𝐵) ∈ ℝ) → (𝑥 ∈ ((𝐴 − 𝐵)(,)(𝐴 + 𝐵)) ↔ (𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 28 | 22, 23, 27 | syl2anc 411 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑥 ∈ ((𝐴 − 𝐵)(,)(𝐴 + 𝐵)) ↔ (𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
| 29 | 16, 21, 28 | 3bitr4d 220 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑥 ∈ (𝐴(ball‘𝐷)𝐵) ↔ 𝑥 ∈ ((𝐴 − 𝐵)(,)(𝐴 + 𝐵)))) |
| 30 | 29 | eqrdv 2228 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴(ball‘𝐷)𝐵) = ((𝐴 − 𝐵)(,)(𝐴 + 𝐵))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1004 = wceq 1397 ∈ wcel 2201 class class class wbr 4089 × cxp 4725 ↾ cres 4729 ∘ ccom 4731 ‘cfv 5328 (class class class)co 6023 ℂcc 8035 ℝcr 8036 + caddc 8040 ℝ*cxr 8218 < clt 8219 − cmin 8355 (,)cioo 10128 abscabs 11580 ∞Metcxmet 14574 ballcbl 14576 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2203 ax-14 2204 ax-ext 2212 ax-coll 4205 ax-sep 4208 ax-nul 4216 ax-pow 4266 ax-pr 4301 ax-un 4532 ax-setind 4637 ax-iinf 4688 ax-cnex 8128 ax-resscn 8129 ax-1cn 8130 ax-1re 8131 ax-icn 8132 ax-addcl 8133 ax-addrcl 8134 ax-mulcl 8135 ax-mulrcl 8136 ax-addcom 8137 ax-mulcom 8138 ax-addass 8139 ax-mulass 8140 ax-distr 8141 ax-i2m1 8142 ax-0lt1 8143 ax-1rid 8144 ax-0id 8145 ax-rnegex 8146 ax-precex 8147 ax-cnre 8148 ax-pre-ltirr 8149 ax-pre-ltwlin 8150 ax-pre-lttrn 8151 ax-pre-apti 8152 ax-pre-ltadd 8153 ax-pre-mulgt0 8154 ax-pre-mulext 8155 ax-arch 8156 ax-caucvg 8157 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ne 2402 df-nel 2497 df-ral 2514 df-rex 2515 df-reu 2516 df-rmo 2517 df-rab 2518 df-v 2803 df-sbc 3031 df-csb 3127 df-dif 3201 df-un 3203 df-in 3205 df-ss 3212 df-nul 3494 df-if 3605 df-pw 3655 df-sn 3676 df-pr 3677 df-op 3679 df-uni 3895 df-int 3930 df-iun 3973 df-br 4090 df-opab 4152 df-mpt 4153 df-tr 4189 df-id 4392 df-po 4395 df-iso 4396 df-iord 4465 df-on 4467 df-ilim 4468 df-suc 4470 df-iom 4691 df-xp 4733 df-rel 4734 df-cnv 4735 df-co 4736 df-dm 4737 df-rn 4738 df-res 4739 df-ima 4740 df-iota 5288 df-fun 5330 df-fn 5331 df-f 5332 df-f1 5333 df-fo 5334 df-f1o 5335 df-fv 5336 df-riota 5976 df-ov 6026 df-oprab 6027 df-mpo 6028 df-1st 6308 df-2nd 6309 df-recs 6476 df-frec 6562 df-map 6824 df-pnf 8221 df-mnf 8222 df-xr 8223 df-ltxr 8224 df-le 8225 df-sub 8357 df-neg 8358 df-reap 8760 df-ap 8767 df-div 8858 df-inn 9149 df-2 9207 df-3 9208 df-4 9209 df-n0 9408 df-z 9485 df-uz 9761 df-rp 9894 df-xadd 10013 df-ioo 10132 df-seqfrec 10716 df-exp 10807 df-cj 11425 df-re 11426 df-im 11427 df-rsqrt 11581 df-abs 11582 df-psmet 14581 df-xmet 14582 df-met 14583 df-bl 14584 |
| This theorem is referenced by: ioo2bl 15304 blssioo 15306 tgioo 15307 |
| Copyright terms: Public domain | W3C validator |