| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > bl2in | GIF version | ||
| Description: Two balls are disjoint if they don't overlap. (Contributed by NM, 11-Mar-2007.) (Revised by Mario Carneiro, 23-Aug-2015.) |
| Ref | Expression |
|---|---|
| bl2in | ⊢ (((𝐷 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ ∧ 𝑅 ≤ ((𝑃𝐷𝑄) / 2))) → ((𝑃(ball‘𝐷)𝑅) ∩ (𝑄(ball‘𝐷)𝑅)) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl1 1002 | . . 3 ⊢ (((𝐷 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ ∧ 𝑅 ≤ ((𝑃𝐷𝑄) / 2))) → 𝐷 ∈ (Met‘𝑋)) | |
| 2 | metxmet 14675 | . . 3 ⊢ (𝐷 ∈ (Met‘𝑋) → 𝐷 ∈ (∞Met‘𝑋)) | |
| 3 | 1, 2 | syl 14 | . 2 ⊢ (((𝐷 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ ∧ 𝑅 ≤ ((𝑃𝐷𝑄) / 2))) → 𝐷 ∈ (∞Met‘𝑋)) |
| 4 | simpl2 1003 | . 2 ⊢ (((𝐷 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ ∧ 𝑅 ≤ ((𝑃𝐷𝑄) / 2))) → 𝑃 ∈ 𝑋) | |
| 5 | simpl3 1004 | . 2 ⊢ (((𝐷 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ ∧ 𝑅 ≤ ((𝑃𝐷𝑄) / 2))) → 𝑄 ∈ 𝑋) | |
| 6 | rexr 8089 | . . 3 ⊢ (𝑅 ∈ ℝ → 𝑅 ∈ ℝ*) | |
| 7 | 6 | ad2antrl 490 | . 2 ⊢ (((𝐷 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ ∧ 𝑅 ≤ ((𝑃𝐷𝑄) / 2))) → 𝑅 ∈ ℝ*) |
| 8 | simprl 529 | . . . . 5 ⊢ (((𝐷 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ ∧ 𝑅 ≤ ((𝑃𝐷𝑄) / 2))) → 𝑅 ∈ ℝ) | |
| 9 | rexadd 9944 | . . . . 5 ⊢ ((𝑅 ∈ ℝ ∧ 𝑅 ∈ ℝ) → (𝑅 +𝑒 𝑅) = (𝑅 + 𝑅)) | |
| 10 | 8, 8, 9 | syl2anc 411 | . . . 4 ⊢ (((𝐷 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ ∧ 𝑅 ≤ ((𝑃𝐷𝑄) / 2))) → (𝑅 +𝑒 𝑅) = (𝑅 + 𝑅)) |
| 11 | 8 | recnd 8072 | . . . . 5 ⊢ (((𝐷 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ ∧ 𝑅 ≤ ((𝑃𝐷𝑄) / 2))) → 𝑅 ∈ ℂ) |
| 12 | 11 | 2timesd 9251 | . . . 4 ⊢ (((𝐷 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ ∧ 𝑅 ≤ ((𝑃𝐷𝑄) / 2))) → (2 · 𝑅) = (𝑅 + 𝑅)) |
| 13 | 10, 12 | eqtr4d 2232 | . . 3 ⊢ (((𝐷 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ ∧ 𝑅 ≤ ((𝑃𝐷𝑄) / 2))) → (𝑅 +𝑒 𝑅) = (2 · 𝑅)) |
| 14 | id 19 | . . . . . 6 ⊢ (𝑅 ∈ ℝ → 𝑅 ∈ ℝ) | |
| 15 | metcl 14673 | . . . . . 6 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) → (𝑃𝐷𝑄) ∈ ℝ) | |
| 16 | 2re 9077 | . . . . . . . 8 ⊢ 2 ∈ ℝ | |
| 17 | 2pos 9098 | . . . . . . . 8 ⊢ 0 < 2 | |
| 18 | 16, 17 | pm3.2i 272 | . . . . . . 7 ⊢ (2 ∈ ℝ ∧ 0 < 2) |
| 19 | lemuldiv2 8926 | . . . . . . 7 ⊢ ((𝑅 ∈ ℝ ∧ (𝑃𝐷𝑄) ∈ ℝ ∧ (2 ∈ ℝ ∧ 0 < 2)) → ((2 · 𝑅) ≤ (𝑃𝐷𝑄) ↔ 𝑅 ≤ ((𝑃𝐷𝑄) / 2))) | |
| 20 | 18, 19 | mp3an3 1337 | . . . . . 6 ⊢ ((𝑅 ∈ ℝ ∧ (𝑃𝐷𝑄) ∈ ℝ) → ((2 · 𝑅) ≤ (𝑃𝐷𝑄) ↔ 𝑅 ≤ ((𝑃𝐷𝑄) / 2))) |
| 21 | 14, 15, 20 | syl2anr 290 | . . . . 5 ⊢ (((𝐷 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ 𝑅 ∈ ℝ) → ((2 · 𝑅) ≤ (𝑃𝐷𝑄) ↔ 𝑅 ≤ ((𝑃𝐷𝑄) / 2))) |
| 22 | 21 | biimprd 158 | . . . 4 ⊢ (((𝐷 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ 𝑅 ∈ ℝ) → (𝑅 ≤ ((𝑃𝐷𝑄) / 2) → (2 · 𝑅) ≤ (𝑃𝐷𝑄))) |
| 23 | 22 | impr 379 | . . 3 ⊢ (((𝐷 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ ∧ 𝑅 ≤ ((𝑃𝐷𝑄) / 2))) → (2 · 𝑅) ≤ (𝑃𝐷𝑄)) |
| 24 | 13, 23 | eqbrtrd 4056 | . 2 ⊢ (((𝐷 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ ∧ 𝑅 ≤ ((𝑃𝐷𝑄) / 2))) → (𝑅 +𝑒 𝑅) ≤ (𝑃𝐷𝑄)) |
| 25 | bldisj 14721 | . 2 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ* ∧ 𝑅 ∈ ℝ* ∧ (𝑅 +𝑒 𝑅) ≤ (𝑃𝐷𝑄))) → ((𝑃(ball‘𝐷)𝑅) ∩ (𝑄(ball‘𝐷)𝑅)) = ∅) | |
| 26 | 3, 4, 5, 7, 7, 24, 25 | syl33anc 1264 | 1 ⊢ (((𝐷 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ ∧ 𝑅 ≤ ((𝑃𝐷𝑄) / 2))) → ((𝑃(ball‘𝐷)𝑅) ∩ (𝑄(ball‘𝐷)𝑅)) = ∅) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 980 = wceq 1364 ∈ wcel 2167 ∩ cin 3156 ∅c0 3451 class class class wbr 4034 ‘cfv 5259 (class class class)co 5925 ℝcr 7895 0cc0 7896 + caddc 7899 · cmul 7901 ℝ*cxr 8077 < clt 8078 ≤ cle 8079 / cdiv 8716 2c2 9058 +𝑒 cxad 9862 ∞Metcxmet 14168 Metcmet 14169 ballcbl 14170 |
| 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 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-sep 4152 ax-pow 4208 ax-pr 4243 ax-un 4469 ax-setind 4574 ax-cnex 7987 ax-resscn 7988 ax-1cn 7989 ax-1re 7990 ax-icn 7991 ax-addcl 7992 ax-addrcl 7993 ax-mulcl 7994 ax-mulrcl 7995 ax-addcom 7996 ax-mulcom 7997 ax-addass 7998 ax-mulass 7999 ax-distr 8000 ax-i2m1 8001 ax-0lt1 8002 ax-1rid 8003 ax-0id 8004 ax-rnegex 8005 ax-precex 8006 ax-cnre 8007 ax-pre-ltirr 8008 ax-pre-ltwlin 8009 ax-pre-lttrn 8010 ax-pre-apti 8011 ax-pre-ltadd 8012 ax-pre-mulgt0 8013 ax-pre-mulext 8014 |
| This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-nel 2463 df-ral 2480 df-rex 2481 df-reu 2482 df-rmo 2483 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-nul 3452 df-if 3563 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-uni 3841 df-iun 3919 df-br 4035 df-opab 4096 df-mpt 4097 df-id 4329 df-po 4332 df-iso 4333 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-rn 4675 df-res 4676 df-ima 4677 df-iota 5220 df-fun 5261 df-fn 5262 df-f 5263 df-fv 5267 df-riota 5880 df-ov 5928 df-oprab 5929 df-mpo 5930 df-1st 6207 df-2nd 6208 df-map 6718 df-pnf 8080 df-mnf 8081 df-xr 8082 df-ltxr 8083 df-le 8084 df-sub 8216 df-neg 8217 df-reap 8619 df-ap 8626 df-div 8717 df-2 9066 df-xadd 9865 df-psmet 14175 df-xmet 14176 df-met 14177 df-bl 14178 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |