ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  blin2 GIF version

Theorem blin2 13226
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 524 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝐷 ∈ (∞Met‘𝑋))
2 simprl 526 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝐵 ∈ ran (ball‘𝐷))
3 simplr 525 . . . 4 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝑃 ∈ (𝐵𝐶))
43elin1d 3316 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝑃𝐵)
5 blss 13222 . . 3 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐵 ∈ ran (ball‘𝐷) ∧ 𝑃𝐵) → ∃𝑦 ∈ ℝ+ (𝑃(ball‘𝐷)𝑦) ⊆ 𝐵)
61, 2, 4, 5syl3anc 1233 . 2 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → ∃𝑦 ∈ ℝ+ (𝑃(ball‘𝐷)𝑦) ⊆ 𝐵)
7 simprr 527 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝐶 ∈ ran (ball‘𝐷))
83elin2d 3317 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝑃𝐶)
9 blss 13222 . . 3 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐶 ∈ ran (ball‘𝐷) ∧ 𝑃𝐶) → ∃𝑧 ∈ ℝ+ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶)
101, 7, 8, 9syl3anc 1233 . 2 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → ∃𝑧 ∈ ℝ+ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶)
11 reeanv 2639 . . 3 (∃𝑦 ∈ ℝ+𝑧 ∈ ℝ+ ((𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶) ↔ (∃𝑦 ∈ ℝ+ (𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ ∃𝑧 ∈ ℝ+ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶))
12 ss2in 3355 . . . . 5 (((𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶) → ((𝑃(ball‘𝐷)𝑦) ∩ (𝑃(ball‘𝐷)𝑧)) ⊆ (𝐵𝐶))
13 inss1 3347 . . . . . . . . . . 11 (𝐵𝐶) ⊆ 𝐵
14 blf 13204 . . . . . . . . . . . . . 14 (𝐷 ∈ (∞Met‘𝑋) → (ball‘𝐷):(𝑋 × ℝ*)⟶𝒫 𝑋)
15 frn 5356 . . . . . . . . . . . . . 14 ((ball‘𝐷):(𝑋 × ℝ*)⟶𝒫 𝑋 → ran (ball‘𝐷) ⊆ 𝒫 𝑋)
161, 14, 153syl 17 . . . . . . . . . . . . 13 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → ran (ball‘𝐷) ⊆ 𝒫 𝑋)
1716, 2sseldd 3148 . . . . . . . . . . . 12 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝐵 ∈ 𝒫 𝑋)
1817elpwid 3577 . . . . . . . . . . 11 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝐵𝑋)
1913, 18sstrid 3158 . . . . . . . . . 10 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → (𝐵𝐶) ⊆ 𝑋)
2019, 3sseldd 3148 . . . . . . . . 9 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝑃𝑋)
211, 20jca 304 . . . . . . . 8 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → (𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋))
22 rpxr 9618 . . . . . . . . 9 (𝑦 ∈ ℝ+𝑦 ∈ ℝ*)
23 rpxr 9618 . . . . . . . . 9 (𝑧 ∈ ℝ+𝑧 ∈ ℝ*)
2422, 23anim12i 336 . . . . . . . 8 ((𝑦 ∈ ℝ+𝑧 ∈ ℝ+) → (𝑦 ∈ ℝ*𝑧 ∈ ℝ*))
25 blininf 13218 . . . . . . . 8 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋) ∧ (𝑦 ∈ ℝ*𝑧 ∈ ℝ*)) → ((𝑃(ball‘𝐷)𝑦) ∩ (𝑃(ball‘𝐷)𝑧)) = (𝑃(ball‘𝐷)inf({𝑦, 𝑧}, ℝ*, < )))
2621, 24, 25syl2an 287 . . . . . . 7 ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) ∧ (𝑦 ∈ ℝ+𝑧 ∈ ℝ+)) → ((𝑃(ball‘𝐷)𝑦) ∩ (𝑃(ball‘𝐷)𝑧)) = (𝑃(ball‘𝐷)inf({𝑦, 𝑧}, ℝ*, < )))
2726sseq1d 3176 . . . . . 6 ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) ∧ (𝑦 ∈ ℝ+𝑧 ∈ ℝ+)) → (((𝑃(ball‘𝐷)𝑦) ∩ (𝑃(ball‘𝐷)𝑧)) ⊆ (𝐵𝐶) ↔ (𝑃(ball‘𝐷)inf({𝑦, 𝑧}, ℝ*, < )) ⊆ (𝐵𝐶)))
28 xrminrpcl 11237 . . . . . . . 8 ((𝑦 ∈ ℝ+𝑧 ∈ ℝ+) → inf({𝑦, 𝑧}, ℝ*, < ) ∈ ℝ+)
29 oveq2 5861 . . . . . . . . . . 11 (𝑥 = inf({𝑦, 𝑧}, ℝ*, < ) → (𝑃(ball‘𝐷)𝑥) = (𝑃(ball‘𝐷)inf({𝑦, 𝑧}, ℝ*, < )))
3029sseq1d 3176 . . . . . . . . . 10 (𝑥 = inf({𝑦, 𝑧}, ℝ*, < ) → ((𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶) ↔ (𝑃(ball‘𝐷)inf({𝑦, 𝑧}, ℝ*, < )) ⊆ (𝐵𝐶)))
3130rspcev 2834 . . . . . . . . 9 ((inf({𝑦, 𝑧}, ℝ*, < ) ∈ ℝ+ ∧ (𝑃(ball‘𝐷)inf({𝑦, 𝑧}, ℝ*, < )) ⊆ (𝐵𝐶)) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶))
3231ex 114 . . . . . . . 8 (inf({𝑦, 𝑧}, ℝ*, < ) ∈ ℝ+ → ((𝑃(ball‘𝐷)inf({𝑦, 𝑧}, ℝ*, < )) ⊆ (𝐵𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶)))
3328, 32syl 14 . . . . . . 7 ((𝑦 ∈ ℝ+𝑧 ∈ ℝ+) → ((𝑃(ball‘𝐷)inf({𝑦, 𝑧}, ℝ*, < )) ⊆ (𝐵𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶)))
3433adantl 275 . . . . . 6 ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) ∧ (𝑦 ∈ ℝ+𝑧 ∈ ℝ+)) → ((𝑃(ball‘𝐷)inf({𝑦, 𝑧}, ℝ*, < )) ⊆ (𝐵𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶)))
3527, 34sylbid 149 . . . . 5 ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) ∧ (𝑦 ∈ ℝ+𝑧 ∈ ℝ+)) → (((𝑃(ball‘𝐷)𝑦) ∩ (𝑃(ball‘𝐷)𝑧)) ⊆ (𝐵𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶)))
3612, 35syl5 32 . . . 4 ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) ∧ (𝑦 ∈ ℝ+𝑧 ∈ ℝ+)) → (((𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶)))
3736rexlimdvva 2595 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → (∃𝑦 ∈ ℝ+𝑧 ∈ ℝ+ ((𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶)))
3811, 37syl5bir 152 . 2 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → ((∃𝑦 ∈ ℝ+ (𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ ∃𝑧 ∈ ℝ+ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶)))
396, 10, 38mp2and 431 1 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103   = wceq 1348  wcel 2141  wrex 2449  cin 3120  wss 3121  𝒫 cpw 3566  {cpr 3584   × cxp 4609  ran crn 4612  wf 5194  cfv 5198  (class class class)co 5853  infcinf 6960  *cxr 7953   < clt 7954  +crp 9610  ∞Metcxmet 12774  ballcbl 12776
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 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-coll 4104  ax-sep 4107  ax-nul 4115  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-iinf 4572  ax-cnex 7865  ax-resscn 7866  ax-1cn 7867  ax-1re 7868  ax-icn 7869  ax-addcl 7870  ax-addrcl 7871  ax-mulcl 7872  ax-mulrcl 7873  ax-addcom 7874  ax-mulcom 7875  ax-addass 7876  ax-mulass 7877  ax-distr 7878  ax-i2m1 7879  ax-0lt1 7880  ax-1rid 7881  ax-0id 7882  ax-rnegex 7883  ax-precex 7884  ax-cnre 7885  ax-pre-ltirr 7886  ax-pre-ltwlin 7887  ax-pre-lttrn 7888  ax-pre-apti 7889  ax-pre-ltadd 7890  ax-pre-mulgt0 7891  ax-pre-mulext 7892  ax-arch 7893  ax-caucvg 7894
This theorem depends on definitions:  df-bi 116  df-stab 826  df-dc 830  df-3or 974  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-nel 2436  df-ral 2453  df-rex 2454  df-reu 2455  df-rmo 2456  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-if 3527  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-int 3832  df-iun 3875  df-br 3990  df-opab 4051  df-mpt 4052  df-tr 4088  df-id 4278  df-po 4281  df-iso 4282  df-iord 4351  df-on 4353  df-ilim 4354  df-suc 4356  df-iom 4575  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-isom 5207  df-riota 5809  df-ov 5856  df-oprab 5857  df-mpo 5858  df-1st 6119  df-2nd 6120  df-recs 6284  df-frec 6370  df-map 6628  df-sup 6961  df-inf 6962  df-pnf 7956  df-mnf 7957  df-xr 7958  df-ltxr 7959  df-le 7960  df-sub 8092  df-neg 8093  df-reap 8494  df-ap 8501  df-div 8590  df-inn 8879  df-2 8937  df-3 8938  df-4 8939  df-n0 9136  df-z 9213  df-uz 9488  df-q 9579  df-rp 9611  df-xneg 9729  df-xadd 9730  df-seqfrec 10402  df-exp 10476  df-cj 10806  df-re 10807  df-im 10808  df-rsqrt 10962  df-abs 10963  df-psmet 12781  df-xmet 12782  df-bl 12784
This theorem is referenced by:  blbas  13227
  Copyright terms: Public domain W3C validator