Theorem blin2 24597

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.

Step	Hyp	Ref	Expression
1		simpll 778	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵 ∩ 𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝐷 ∈ (∞Met‘𝑋))
2		simprl 782	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵 ∩ 𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝐵 ∈ ran (ball‘𝐷))
3		simplr 780	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵 ∩ 𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝑃 ∈ (𝐵 ∩ 𝐶))
4	3	elin1d 4156	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵 ∩ 𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝑃 ∈ 𝐵)
5		blss 24593	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐵 ∈ ran (ball‘𝐷) ∧ 𝑃 ∈ 𝐵) → ∃𝑦 ∈ ℝ+ (𝑃(ball‘𝐷)𝑦) ⊆ 𝐵)
6	1, 2, 4, 5	syl3anc 1397	. 2 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵 ∩ 𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → ∃𝑦 ∈ ℝ+ (𝑃(ball‘𝐷)𝑦) ⊆ 𝐵)
7		simprr 784	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵 ∩ 𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝐶 ∈ ran (ball‘𝐷))
8	3	elin2d 4157	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵 ∩ 𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝑃 ∈ 𝐶)
9		blss 24593	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐶 ∈ ran (ball‘𝐷) ∧ 𝑃 ∈ 𝐶) → ∃𝑧 ∈ ℝ+ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶)
10	1, 7, 8, 9	syl3anc 1397	. 2 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵 ∩ 𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → ∃𝑧 ∈ ℝ+ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶)
11		reeanv 3236	. . 3 ⊢ (∃𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ((𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶) ↔ (∃𝑦 ∈ ℝ+ (𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ ∃𝑧 ∈ ℝ+ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶))
12		ss2in 4196	. . . . 5 ⊢ (((𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶) → ((𝑃(ball‘𝐷)𝑦) ∩ (𝑃(ball‘𝐷)𝑧)) ⊆ (𝐵 ∩ 𝐶))
13		inss1 4188	. . . . . . . . . . 11 ⊢ (𝐵 ∩ 𝐶) ⊆ 𝐵
14		blf 24575	. . . . . . . . . . . . . 14 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (ball‘𝐷):(𝑋 × ℝ*)⟶𝒫 𝑋)
15		frn 6713	. . . . . . . . . . . . . 14 ⊢ ((ball‘𝐷):(𝑋 × ℝ*)⟶𝒫 𝑋 → ran (ball‘𝐷) ⊆ 𝒫 𝑋)
16	1, 14, 15	3syl 19	. . . . . . . . . . . . 13 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵 ∩ 𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → ran (ball‘𝐷) ⊆ 𝒫 𝑋)
17	16, 2	sseldd 3937	. . . . . . . . . . . 12 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵 ∩ 𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝐵 ∈ 𝒫 𝑋)
18	17	elpwid 4570	. . . . . . . . . . 11 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵 ∩ 𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝐵 ⊆ 𝑋)
19	13, 18	sstrid 3947	. . . . . . . . . 10 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵 ∩ 𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → (𝐵 ∩ 𝐶) ⊆ 𝑋)
20	19, 3	sseldd 3937	. . . . . . . . 9 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵 ∩ 𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝑃 ∈ 𝑋)
21	1, 20	jca 520	. . . . . . . 8 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵 ∩ 𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → (𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋))
22		rpxr 13032	. . . . . . . . 9 ⊢ (𝑦 ∈ ℝ+ → 𝑦 ∈ ℝ*)
23		rpxr 13032	. . . . . . . . 9 ⊢ (𝑧 ∈ ℝ+ → 𝑧 ∈ ℝ*)
24	22, 23	anim12i 624	. . . . . . . 8 ⊢ ((𝑦 ∈ ℝ+ ∧ 𝑧 ∈ ℝ+) → (𝑦 ∈ ℝ* ∧ 𝑧 ∈ ℝ*))
25		blin 24589	. . . . . . . 8 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑦 ∈ ℝ* ∧ 𝑧 ∈ ℝ*)) → ((𝑃(ball‘𝐷)𝑦) ∩ (𝑃(ball‘𝐷)𝑧)) = (𝑃(ball‘𝐷)if(𝑦 ≤ 𝑧, 𝑦, 𝑧)))
26	21, 24, 25	syl2an 607	. . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵 ∩ 𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) ∧ (𝑦 ∈ ℝ+ ∧ 𝑧 ∈ ℝ+)) → ((𝑃(ball‘𝐷)𝑦) ∩ (𝑃(ball‘𝐷)𝑧)) = (𝑃(ball‘𝐷)if(𝑦 ≤ 𝑧, 𝑦, 𝑧)))
27	26	sseq1d 3967	. . . . . 6 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵 ∩ 𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) ∧ (𝑦 ∈ ℝ+ ∧ 𝑧 ∈ ℝ+)) → (((𝑃(ball‘𝐷)𝑦) ∩ (𝑃(ball‘𝐷)𝑧)) ⊆ (𝐵 ∩ 𝐶) ↔ (𝑃(ball‘𝐷)if(𝑦 ≤ 𝑧, 𝑦, 𝑧)) ⊆ (𝐵 ∩ 𝐶)))
28		ifcl 4532	. . . . . . . 8 ⊢ ((𝑦 ∈ ℝ+ ∧ 𝑧 ∈ ℝ+) → if(𝑦 ≤ 𝑧, 𝑦, 𝑧) ∈ ℝ+)
29		oveq2 7420	. . . . . . . . . . 11 ⊢ (𝑥 = if(𝑦 ≤ 𝑧, 𝑦, 𝑧) → (𝑃(ball‘𝐷)𝑥) = (𝑃(ball‘𝐷)if(𝑦 ≤ 𝑧, 𝑦, 𝑧)))
30	29	sseq1d 3967	. . . . . . . . . 10 ⊢ (𝑥 = if(𝑦 ≤ 𝑧, 𝑦, 𝑧) → ((𝑃(ball‘𝐷)𝑥) ⊆ (𝐵 ∩ 𝐶) ↔ (𝑃(ball‘𝐷)if(𝑦 ≤ 𝑧, 𝑦, 𝑧)) ⊆ (𝐵 ∩ 𝐶)))
31	30	rspcev 3580	. . . . . . . . 9 ⊢ ((if(𝑦 ≤ 𝑧, 𝑦, 𝑧) ∈ ℝ+ ∧ (𝑃(ball‘𝐷)if(𝑦 ≤ 𝑧, 𝑦, 𝑧)) ⊆ (𝐵 ∩ 𝐶)) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵 ∩ 𝐶))
32	31	ex 417	. . . . . . . 8 ⊢ (if(𝑦 ≤ 𝑧, 𝑦, 𝑧) ∈ ℝ+ → ((𝑃(ball‘𝐷)if(𝑦 ≤ 𝑧, 𝑦, 𝑧)) ⊆ (𝐵 ∩ 𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵 ∩ 𝐶)))
33	28, 32	syl 18	. . . . . . 7 ⊢ ((𝑦 ∈ ℝ+ ∧ 𝑧 ∈ ℝ+) → ((𝑃(ball‘𝐷)if(𝑦 ≤ 𝑧, 𝑦, 𝑧)) ⊆ (𝐵 ∩ 𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵 ∩ 𝐶)))
34	33	adantl 486	. . . . . 6 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵 ∩ 𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) ∧ (𝑦 ∈ ℝ+ ∧ 𝑧 ∈ ℝ+)) → ((𝑃(ball‘𝐷)if(𝑦 ≤ 𝑧, 𝑦, 𝑧)) ⊆ (𝐵 ∩ 𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵 ∩ 𝐶)))
35	27, 34	sylbid 243	. . . . 5 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵 ∩ 𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) ∧ (𝑦 ∈ ℝ+ ∧ 𝑧 ∈ ℝ+)) → (((𝑃(ball‘𝐷)𝑦) ∩ (𝑃(ball‘𝐷)𝑧)) ⊆ (𝐵 ∩ 𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵 ∩ 𝐶)))
36	12, 35	syl5 35	. . . 4 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵 ∩ 𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) ∧ (𝑦 ∈ ℝ+ ∧ 𝑧 ∈ ℝ+)) → (((𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵 ∩ 𝐶)))
37	36	rexlimdvva 3221	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵 ∩ 𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → (∃𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ((𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵 ∩ 𝐶)))
38	11, 37	biimtrrid 246	. 2 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵 ∩ 𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → ((∃𝑦 ∈ ℝ+ (𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ ∃𝑧 ∈ ℝ+ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵 ∩ 𝐶)))
39	6, 10, 38	mp2and 711	1 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵 ∩ 𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵 ∩ 𝐶))

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   = wceq 1569   ∈ wcel 2142  ∃wrex 3088   ∩ cin 3903   ⊆ wss 3904  ifcif 4486  𝒫 cpw 4561   class class class wbr 5108   × cxp 5658  ran crn 5661  ⟶wf 6532  ‘cfv 6536  (class class class)co 7412  ℝ^*cxr 11248   ≤ cle 11250  ℝ⁺crp 13022  ∞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-inf 9401  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-n0 12511  df-z 12598  df-uz 12869  df-q 12979  df-rp 13023  df-xneg 13143  df-xadd 13144  df-xmul 13145  df-psmet 21525  df-xmet 21526  df-bl 21528

This theorem is used by:  blbas  24598