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 13080 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝐴𝐷𝑥) = (abs‘(𝐴 − 𝑥))) |
3 | recn 7877 | . . . . . . . . . 10 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
4 | recn 7877 | . . . . . . . . . 10 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℂ) | |
5 | abssub 11029 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (abs‘(𝐴 − 𝑥)) = (abs‘(𝑥 − 𝐴))) | |
6 | 3, 4, 5 | syl2an 287 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (abs‘(𝐴 − 𝑥)) = (abs‘(𝑥 − 𝐴))) |
7 | 2, 6 | eqtrd 2197 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝐴𝐷𝑥) = (abs‘(𝑥 − 𝐴))) |
8 | 7 | breq1d 3986 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((𝐴𝐷𝑥) < 𝐵 ↔ (abs‘(𝑥 − 𝐴)) < 𝐵)) |
9 | 8 | adantlr 469 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑥 ∈ ℝ) → ((𝐴𝐷𝑥) < 𝐵 ↔ (abs‘(𝑥 − 𝐴)) < 𝐵)) |
10 | absdiflt 11020 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((abs‘(𝑥 − 𝐴)) < 𝐵 ↔ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) | |
11 | 10 | 3expb 1193 | . . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ)) → ((abs‘(𝑥 − 𝐴)) < 𝐵 ↔ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
12 | 11 | ancoms 266 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑥 ∈ ℝ) → ((abs‘(𝑥 − 𝐴)) < 𝐵 ↔ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
13 | 9, 12 | bitrd 187 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑥 ∈ ℝ) → ((𝐴𝐷𝑥) < 𝐵 ↔ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
14 | 13 | pm5.32da 448 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵) ↔ (𝑥 ∈ ℝ ∧ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵))))) |
15 | 3anass 971 | . . . 4 ⊢ ((𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)) ↔ (𝑥 ∈ ℝ ∧ ((𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) | |
16 | 14, 15 | bitr4di 197 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵) ↔ (𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
17 | rexr 7935 | . . . 4 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ*) | |
18 | 1 | rexmet 13082 | . . . . 5 ⊢ 𝐷 ∈ (∞Met‘ℝ) |
19 | elbl 12932 | . . . . 5 ⊢ ((𝐷 ∈ (∞Met‘ℝ) ∧ 𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) → (𝑥 ∈ (𝐴(ball‘𝐷)𝐵) ↔ (𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵))) | |
20 | 18, 19 | mp3an1 1313 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) → (𝑥 ∈ (𝐴(ball‘𝐷)𝐵) ↔ (𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵))) |
21 | 17, 20 | sylan2 284 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑥 ∈ (𝐴(ball‘𝐷)𝐵) ↔ (𝑥 ∈ ℝ ∧ (𝐴𝐷𝑥) < 𝐵))) |
22 | resubcl 8153 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 − 𝐵) ∈ ℝ) | |
23 | readdcl 7870 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) ∈ ℝ) | |
24 | rexr 7935 | . . . . 5 ⊢ ((𝐴 − 𝐵) ∈ ℝ → (𝐴 − 𝐵) ∈ ℝ*) | |
25 | rexr 7935 | . . . . 5 ⊢ ((𝐴 + 𝐵) ∈ ℝ → (𝐴 + 𝐵) ∈ ℝ*) | |
26 | elioo2 9848 | . . . . 5 ⊢ (((𝐴 − 𝐵) ∈ ℝ* ∧ (𝐴 + 𝐵) ∈ ℝ*) → (𝑥 ∈ ((𝐴 − 𝐵)(,)(𝐴 + 𝐵)) ↔ (𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) | |
27 | 24, 25, 26 | syl2an 287 | . . . 4 ⊢ (((𝐴 − 𝐵) ∈ ℝ ∧ (𝐴 + 𝐵) ∈ ℝ) → (𝑥 ∈ ((𝐴 − 𝐵)(,)(𝐴 + 𝐵)) ↔ (𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
28 | 22, 23, 27 | syl2anc 409 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑥 ∈ ((𝐴 − 𝐵)(,)(𝐴 + 𝐵)) ↔ (𝑥 ∈ ℝ ∧ (𝐴 − 𝐵) < 𝑥 ∧ 𝑥 < (𝐴 + 𝐵)))) |
29 | 16, 21, 28 | 3bitr4d 219 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑥 ∈ (𝐴(ball‘𝐷)𝐵) ↔ 𝑥 ∈ ((𝐴 − 𝐵)(,)(𝐴 + 𝐵)))) |
30 | 29 | eqrdv 2162 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴(ball‘𝐷)𝐵) = ((𝐴 − 𝐵)(,)(𝐴 + 𝐵))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∧ w3a 967 = wceq 1342 ∈ wcel 2135 class class class wbr 3976 × cxp 4596 ↾ cres 4600 ∘ ccom 4602 ‘cfv 5182 (class class class)co 5836 ℂcc 7742 ℝcr 7743 + caddc 7747 ℝ*cxr 7923 < clt 7924 − cmin 8060 (,)cioo 9815 abscabs 10925 ∞Metcxmet 12521 ballcbl 12523 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-13 2137 ax-14 2138 ax-ext 2146 ax-coll 4091 ax-sep 4094 ax-nul 4102 ax-pow 4147 ax-pr 4181 ax-un 4405 ax-setind 4508 ax-iinf 4559 ax-cnex 7835 ax-resscn 7836 ax-1cn 7837 ax-1re 7838 ax-icn 7839 ax-addcl 7840 ax-addrcl 7841 ax-mulcl 7842 ax-mulrcl 7843 ax-addcom 7844 ax-mulcom 7845 ax-addass 7846 ax-mulass 7847 ax-distr 7848 ax-i2m1 7849 ax-0lt1 7850 ax-1rid 7851 ax-0id 7852 ax-rnegex 7853 ax-precex 7854 ax-cnre 7855 ax-pre-ltirr 7856 ax-pre-ltwlin 7857 ax-pre-lttrn 7858 ax-pre-apti 7859 ax-pre-ltadd 7860 ax-pre-mulgt0 7861 ax-pre-mulext 7862 ax-arch 7863 ax-caucvg 7864 |
This theorem depends on definitions: df-bi 116 df-dc 825 df-3or 968 df-3an 969 df-tru 1345 df-fal 1348 df-nf 1448 df-sb 1750 df-eu 2016 df-mo 2017 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-ne 2335 df-nel 2430 df-ral 2447 df-rex 2448 df-reu 2449 df-rmo 2450 df-rab 2451 df-v 2723 df-sbc 2947 df-csb 3041 df-dif 3113 df-un 3115 df-in 3117 df-ss 3124 df-nul 3405 df-if 3516 df-pw 3555 df-sn 3576 df-pr 3577 df-op 3579 df-uni 3784 df-int 3819 df-iun 3862 df-br 3977 df-opab 4038 df-mpt 4039 df-tr 4075 df-id 4265 df-po 4268 df-iso 4269 df-iord 4338 df-on 4340 df-ilim 4341 df-suc 4343 df-iom 4562 df-xp 4604 df-rel 4605 df-cnv 4606 df-co 4607 df-dm 4608 df-rn 4609 df-res 4610 df-ima 4611 df-iota 5147 df-fun 5184 df-fn 5185 df-f 5186 df-f1 5187 df-fo 5188 df-f1o 5189 df-fv 5190 df-riota 5792 df-ov 5839 df-oprab 5840 df-mpo 5841 df-1st 6100 df-2nd 6101 df-recs 6264 df-frec 6350 df-map 6607 df-pnf 7926 df-mnf 7927 df-xr 7928 df-ltxr 7929 df-le 7930 df-sub 8062 df-neg 8063 df-reap 8464 df-ap 8471 df-div 8560 df-inn 8849 df-2 8907 df-3 8908 df-4 8909 df-n0 9106 df-z 9183 df-uz 9458 df-rp 9581 df-xadd 9700 df-ioo 9819 df-seqfrec 10371 df-exp 10445 df-cj 10770 df-re 10771 df-im 10772 df-rsqrt 10926 df-abs 10927 df-psmet 12528 df-xmet 12529 df-met 12530 df-bl 12531 |
This theorem is referenced by: ioo2bl 13084 blssioo 13086 tgioo 13087 |
Copyright terms: Public domain | W3C validator |