MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  blin2 Structured version   Visualization version   GIF version

Theorem blin2 24337
Description: Given any two balls and a point in their intersection, there is a ball contained in the intersection with the given center point. (Contributed by Mario Carneiro, 12-Nov-2013.)
Assertion
Ref Expression
blin2 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶))
Distinct variable groups:   𝑥,𝐵   𝑥,𝐶   𝑥,𝐷   𝑥,𝑃   𝑥,𝑋

Proof of Theorem blin2
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpll 766 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝐷 ∈ (∞Met‘𝑋))
2 simprl 770 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝐵 ∈ ran (ball‘𝐷))
3 simplr 768 . . . 4 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝑃 ∈ (𝐵𝐶))
43elin1d 4152 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝑃𝐵)
5 blss 24333 . . 3 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐵 ∈ ran (ball‘𝐷) ∧ 𝑃𝐵) → ∃𝑦 ∈ ℝ+ (𝑃(ball‘𝐷)𝑦) ⊆ 𝐵)
61, 2, 4, 5syl3anc 1373 . 2 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → ∃𝑦 ∈ ℝ+ (𝑃(ball‘𝐷)𝑦) ⊆ 𝐵)
7 simprr 772 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝐶 ∈ ran (ball‘𝐷))
83elin2d 4153 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝑃𝐶)
9 blss 24333 . . 3 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐶 ∈ ran (ball‘𝐷) ∧ 𝑃𝐶) → ∃𝑧 ∈ ℝ+ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶)
101, 7, 8, 9syl3anc 1373 . 2 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → ∃𝑧 ∈ ℝ+ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶)
11 reeanv 3202 . . 3 (∃𝑦 ∈ ℝ+𝑧 ∈ ℝ+ ((𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶) ↔ (∃𝑦 ∈ ℝ+ (𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ ∃𝑧 ∈ ℝ+ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶))
12 ss2in 4193 . . . . 5 (((𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶) → ((𝑃(ball‘𝐷)𝑦) ∩ (𝑃(ball‘𝐷)𝑧)) ⊆ (𝐵𝐶))
13 inss1 4185 . . . . . . . . . . 11 (𝐵𝐶) ⊆ 𝐵
14 blf 24315 . . . . . . . . . . . . . 14 (𝐷 ∈ (∞Met‘𝑋) → (ball‘𝐷):(𝑋 × ℝ*)⟶𝒫 𝑋)
15 frn 6654 . . . . . . . . . . . . . 14 ((ball‘𝐷):(𝑋 × ℝ*)⟶𝒫 𝑋 → ran (ball‘𝐷) ⊆ 𝒫 𝑋)
161, 14, 153syl 18 . . . . . . . . . . . . 13 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → ran (ball‘𝐷) ⊆ 𝒫 𝑋)
1716, 2sseldd 3933 . . . . . . . . . . . 12 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝐵 ∈ 𝒫 𝑋)
1817elpwid 4557 . . . . . . . . . . 11 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝐵𝑋)
1913, 18sstrid 3944 . . . . . . . . . 10 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → (𝐵𝐶) ⊆ 𝑋)
2019, 3sseldd 3933 . . . . . . . . 9 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝑃𝑋)
211, 20jca 511 . . . . . . . 8 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → (𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋))
22 rpxr 12892 . . . . . . . . 9 (𝑦 ∈ ℝ+𝑦 ∈ ℝ*)
23 rpxr 12892 . . . . . . . . 9 (𝑧 ∈ ℝ+𝑧 ∈ ℝ*)
2422, 23anim12i 613 . . . . . . . 8 ((𝑦 ∈ ℝ+𝑧 ∈ ℝ+) → (𝑦 ∈ ℝ*𝑧 ∈ ℝ*))
25 blin 24329 . . . . . . . 8 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋) ∧ (𝑦 ∈ ℝ*𝑧 ∈ ℝ*)) → ((𝑃(ball‘𝐷)𝑦) ∩ (𝑃(ball‘𝐷)𝑧)) = (𝑃(ball‘𝐷)if(𝑦𝑧, 𝑦, 𝑧)))
2621, 24, 25syl2an 596 . . . . . . 7 ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) ∧ (𝑦 ∈ ℝ+𝑧 ∈ ℝ+)) → ((𝑃(ball‘𝐷)𝑦) ∩ (𝑃(ball‘𝐷)𝑧)) = (𝑃(ball‘𝐷)if(𝑦𝑧, 𝑦, 𝑧)))
2726sseq1d 3964 . . . . . 6 ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) ∧ (𝑦 ∈ ℝ+𝑧 ∈ ℝ+)) → (((𝑃(ball‘𝐷)𝑦) ∩ (𝑃(ball‘𝐷)𝑧)) ⊆ (𝐵𝐶) ↔ (𝑃(ball‘𝐷)if(𝑦𝑧, 𝑦, 𝑧)) ⊆ (𝐵𝐶)))
28 ifcl 4519 . . . . . . . 8 ((𝑦 ∈ ℝ+𝑧 ∈ ℝ+) → if(𝑦𝑧, 𝑦, 𝑧) ∈ ℝ+)
29 oveq2 7349 . . . . . . . . . . 11 (𝑥 = if(𝑦𝑧, 𝑦, 𝑧) → (𝑃(ball‘𝐷)𝑥) = (𝑃(ball‘𝐷)if(𝑦𝑧, 𝑦, 𝑧)))
3029sseq1d 3964 . . . . . . . . . 10 (𝑥 = if(𝑦𝑧, 𝑦, 𝑧) → ((𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶) ↔ (𝑃(ball‘𝐷)if(𝑦𝑧, 𝑦, 𝑧)) ⊆ (𝐵𝐶)))
3130rspcev 3575 . . . . . . . . 9 ((if(𝑦𝑧, 𝑦, 𝑧) ∈ ℝ+ ∧ (𝑃(ball‘𝐷)if(𝑦𝑧, 𝑦, 𝑧)) ⊆ (𝐵𝐶)) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶))
3231ex 412 . . . . . . . 8 (if(𝑦𝑧, 𝑦, 𝑧) ∈ ℝ+ → ((𝑃(ball‘𝐷)if(𝑦𝑧, 𝑦, 𝑧)) ⊆ (𝐵𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶)))
3328, 32syl 17 . . . . . . 7 ((𝑦 ∈ ℝ+𝑧 ∈ ℝ+) → ((𝑃(ball‘𝐷)if(𝑦𝑧, 𝑦, 𝑧)) ⊆ (𝐵𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶)))
3433adantl 481 . . . . . 6 ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) ∧ (𝑦 ∈ ℝ+𝑧 ∈ ℝ+)) → ((𝑃(ball‘𝐷)if(𝑦𝑧, 𝑦, 𝑧)) ⊆ (𝐵𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶)))
3527, 34sylbid 240 . . . . 5 ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) ∧ (𝑦 ∈ ℝ+𝑧 ∈ ℝ+)) → (((𝑃(ball‘𝐷)𝑦) ∩ (𝑃(ball‘𝐷)𝑧)) ⊆ (𝐵𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶)))
3612, 35syl5 34 . . . 4 ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) ∧ (𝑦 ∈ ℝ+𝑧 ∈ ℝ+)) → (((𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶)))
3736rexlimdvva 3187 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → (∃𝑦 ∈ ℝ+𝑧 ∈ ℝ+ ((𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶)))
3811, 37biimtrrid 243 . 2 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → ((∃𝑦 ∈ ℝ+ (𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ ∃𝑧 ∈ ℝ+ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶)))
396, 10, 38mp2and 699 1 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2110  wrex 3054  cin 3899  wss 3900  ifcif 4473  𝒫 cpw 4548   class class class wbr 5089   × cxp 5612  ran crn 5615  wf 6473  cfv 6477  (class class class)co 7341  *cxr 11137  cle 11139  +crp 12882  ∞Metcxmet 21269  ballcbl 21271
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2112  ax-9 2120  ax-10 2143  ax-11 2159  ax-12 2179  ax-ext 2702  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7663  ax-cnex 11054  ax-resscn 11055  ax-1cn 11056  ax-icn 11057  ax-addcl 11058  ax-addrcl 11059  ax-mulcl 11060  ax-mulrcl 11061  ax-mulcom 11062  ax-addass 11063  ax-mulass 11064  ax-distr 11065  ax-i2m1 11066  ax-1ne0 11067  ax-1rid 11068  ax-rnegex 11069  ax-rrecex 11070  ax-cnre 11071  ax-pre-lttri 11072  ax-pre-lttrn 11073  ax-pre-ltadd 11074  ax-pre-mulgt0 11075  ax-pre-sup 11076
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-nel 3031  df-ral 3046  df-rex 3055  df-rmo 3344  df-reu 3345  df-rab 3394  df-v 3436  df-sbc 3740  df-csb 3849  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-pss 3920  df-nul 4282  df-if 4474  df-pw 4550  df-sn 4575  df-pr 4577  df-op 4581  df-uni 4858  df-iun 4941  df-br 5090  df-opab 5152  df-mpt 5171  df-tr 5197  df-id 5509  df-eprel 5514  df-po 5522  df-so 5523  df-fr 5567  df-we 5569  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-pred 6244  df-ord 6305  df-on 6306  df-lim 6307  df-suc 6308  df-iota 6433  df-fun 6479  df-fn 6480  df-f 6481  df-f1 6482  df-fo 6483  df-f1o 6484  df-fv 6485  df-riota 7298  df-ov 7344  df-oprab 7345  df-mpo 7346  df-om 7792  df-1st 7916  df-2nd 7917  df-frecs 8206  df-wrecs 8237  df-recs 8286  df-rdg 8324  df-er 8617  df-map 8747  df-en 8865  df-dom 8866  df-sdom 8867  df-sup 9321  df-inf 9322  df-pnf 11140  df-mnf 11141  df-xr 11142  df-ltxr 11143  df-le 11144  df-sub 11338  df-neg 11339  df-div 11767  df-nn 12118  df-2 12180  df-n0 12374  df-z 12461  df-uz 12725  df-q 12839  df-rp 12883  df-xneg 13003  df-xadd 13004  df-xmul 13005  df-psmet 21276  df-xmet 21277  df-bl 21279
This theorem is referenced by:  blbas  24338
  Copyright terms: Public domain W3C validator