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

Theorem blin2 15127
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 527 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝐷 ∈ (∞Met‘𝑋))
2 simprl 529 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝐵 ∈ ran (ball‘𝐷))
3 simplr 528 . . . 4 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝑃 ∈ (𝐵𝐶))
43elin1d 3393 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝑃𝐵)
5 blss 15123 . . 3 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐵 ∈ ran (ball‘𝐷) ∧ 𝑃𝐵) → ∃𝑦 ∈ ℝ+ (𝑃(ball‘𝐷)𝑦) ⊆ 𝐵)
61, 2, 4, 5syl3anc 1271 . 2 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → ∃𝑦 ∈ ℝ+ (𝑃(ball‘𝐷)𝑦) ⊆ 𝐵)
7 simprr 531 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝐶 ∈ ran (ball‘𝐷))
83elin2d 3394 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝑃𝐶)
9 blss 15123 . . 3 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐶 ∈ ran (ball‘𝐷) ∧ 𝑃𝐶) → ∃𝑧 ∈ ℝ+ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶)
101, 7, 8, 9syl3anc 1271 . 2 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → ∃𝑧 ∈ ℝ+ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶)
11 reeanv 2701 . . 3 (∃𝑦 ∈ ℝ+𝑧 ∈ ℝ+ ((𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶) ↔ (∃𝑦 ∈ ℝ+ (𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ ∃𝑧 ∈ ℝ+ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶))
12 ss2in 3432 . . . . 5 (((𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶) → ((𝑃(ball‘𝐷)𝑦) ∩ (𝑃(ball‘𝐷)𝑧)) ⊆ (𝐵𝐶))
13 inss1 3424 . . . . . . . . . . 11 (𝐵𝐶) ⊆ 𝐵
14 blf 15105 . . . . . . . . . . . . . 14 (𝐷 ∈ (∞Met‘𝑋) → (ball‘𝐷):(𝑋 × ℝ*)⟶𝒫 𝑋)
15 frn 5485 . . . . . . . . . . . . . 14 ((ball‘𝐷):(𝑋 × ℝ*)⟶𝒫 𝑋 → ran (ball‘𝐷) ⊆ 𝒫 𝑋)
161, 14, 153syl 17 . . . . . . . . . . . . 13 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → ran (ball‘𝐷) ⊆ 𝒫 𝑋)
1716, 2sseldd 3225 . . . . . . . . . . . 12 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝐵 ∈ 𝒫 𝑋)
1817elpwid 3660 . . . . . . . . . . 11 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝐵𝑋)
1913, 18sstrid 3235 . . . . . . . . . 10 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → (𝐵𝐶) ⊆ 𝑋)
2019, 3sseldd 3225 . . . . . . . . 9 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → 𝑃𝑋)
211, 20jca 306 . . . . . . . 8 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → (𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋))
22 rpxr 9874 . . . . . . . . 9 (𝑦 ∈ ℝ+𝑦 ∈ ℝ*)
23 rpxr 9874 . . . . . . . . 9 (𝑧 ∈ ℝ+𝑧 ∈ ℝ*)
2422, 23anim12i 338 . . . . . . . 8 ((𝑦 ∈ ℝ+𝑧 ∈ ℝ+) → (𝑦 ∈ ℝ*𝑧 ∈ ℝ*))
25 blininf 15119 . . . . . . . 8 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋) ∧ (𝑦 ∈ ℝ*𝑧 ∈ ℝ*)) → ((𝑃(ball‘𝐷)𝑦) ∩ (𝑃(ball‘𝐷)𝑧)) = (𝑃(ball‘𝐷)inf({𝑦, 𝑧}, ℝ*, < )))
2621, 24, 25syl2an 289 . . . . . . 7 ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) ∧ (𝑦 ∈ ℝ+𝑧 ∈ ℝ+)) → ((𝑃(ball‘𝐷)𝑦) ∩ (𝑃(ball‘𝐷)𝑧)) = (𝑃(ball‘𝐷)inf({𝑦, 𝑧}, ℝ*, < )))
2726sseq1d 3253 . . . . . 6 ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) ∧ (𝑦 ∈ ℝ+𝑧 ∈ ℝ+)) → (((𝑃(ball‘𝐷)𝑦) ∩ (𝑃(ball‘𝐷)𝑧)) ⊆ (𝐵𝐶) ↔ (𝑃(ball‘𝐷)inf({𝑦, 𝑧}, ℝ*, < )) ⊆ (𝐵𝐶)))
28 xrminrpcl 11806 . . . . . . . 8 ((𝑦 ∈ ℝ+𝑧 ∈ ℝ+) → inf({𝑦, 𝑧}, ℝ*, < ) ∈ ℝ+)
29 oveq2 6018 . . . . . . . . . . 11 (𝑥 = inf({𝑦, 𝑧}, ℝ*, < ) → (𝑃(ball‘𝐷)𝑥) = (𝑃(ball‘𝐷)inf({𝑦, 𝑧}, ℝ*, < )))
3029sseq1d 3253 . . . . . . . . . 10 (𝑥 = inf({𝑦, 𝑧}, ℝ*, < ) → ((𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶) ↔ (𝑃(ball‘𝐷)inf({𝑦, 𝑧}, ℝ*, < )) ⊆ (𝐵𝐶)))
3130rspcev 2907 . . . . . . . . 9 ((inf({𝑦, 𝑧}, ℝ*, < ) ∈ ℝ+ ∧ (𝑃(ball‘𝐷)inf({𝑦, 𝑧}, ℝ*, < )) ⊆ (𝐵𝐶)) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶))
3231ex 115 . . . . . . . 8 (inf({𝑦, 𝑧}, ℝ*, < ) ∈ ℝ+ → ((𝑃(ball‘𝐷)inf({𝑦, 𝑧}, ℝ*, < )) ⊆ (𝐵𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶)))
3328, 32syl 14 . . . . . . 7 ((𝑦 ∈ ℝ+𝑧 ∈ ℝ+) → ((𝑃(ball‘𝐷)inf({𝑦, 𝑧}, ℝ*, < )) ⊆ (𝐵𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶)))
3433adantl 277 . . . . . 6 ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) ∧ (𝑦 ∈ ℝ+𝑧 ∈ ℝ+)) → ((𝑃(ball‘𝐷)inf({𝑦, 𝑧}, ℝ*, < )) ⊆ (𝐵𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶)))
3527, 34sylbid 150 . . . . 5 ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) ∧ (𝑦 ∈ ℝ+𝑧 ∈ ℝ+)) → (((𝑃(ball‘𝐷)𝑦) ∩ (𝑃(ball‘𝐷)𝑧)) ⊆ (𝐵𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶)))
3612, 35syl5 32 . . . 4 ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) ∧ (𝑦 ∈ ℝ+𝑧 ∈ ℝ+)) → (((𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶)))
3736rexlimdvva 2656 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → (∃𝑦 ∈ ℝ+𝑧 ∈ ℝ+ ((𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶)))
3811, 37biimtrrid 153 . 2 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → ((∃𝑦 ∈ ℝ+ (𝑃(ball‘𝐷)𝑦) ⊆ 𝐵 ∧ ∃𝑧 ∈ ℝ+ (𝑃(ball‘𝐷)𝑧) ⊆ 𝐶) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶)))
396, 10, 38mp2and 433 1 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ (𝐵𝐶)) ∧ (𝐵 ∈ ran (ball‘𝐷) ∧ 𝐶 ∈ ran (ball‘𝐷))) → ∃𝑥 ∈ ℝ+ (𝑃(ball‘𝐷)𝑥) ⊆ (𝐵𝐶))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1395  wcel 2200  wrex 2509  cin 3196  wss 3197  𝒫 cpw 3649  {cpr 3667   × cxp 4718  ran crn 4721  wf 5317  cfv 5321  (class class class)co 6010  infcinf 7166  *cxr 8196   < clt 8197  +crp 9866  ∞Metcxmet 14521  ballcbl 14523
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4259  ax-pr 4294  ax-un 4525  ax-setind 4630  ax-iinf 4681  ax-cnex 8106  ax-resscn 8107  ax-1cn 8108  ax-1re 8109  ax-icn 8110  ax-addcl 8111  ax-addrcl 8112  ax-mulcl 8113  ax-mulrcl 8114  ax-addcom 8115  ax-mulcom 8116  ax-addass 8117  ax-mulass 8118  ax-distr 8119  ax-i2m1 8120  ax-0lt1 8121  ax-1rid 8122  ax-0id 8123  ax-rnegex 8124  ax-precex 8125  ax-cnre 8126  ax-pre-ltirr 8127  ax-pre-ltwlin 8128  ax-pre-lttrn 8129  ax-pre-apti 8130  ax-pre-ltadd 8131  ax-pre-mulgt0 8132  ax-pre-mulext 8133  ax-arch 8134  ax-caucvg 8135
This theorem depends on definitions:  df-bi 117  df-stab 836  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4385  df-po 4388  df-iso 4389  df-iord 4458  df-on 4460  df-ilim 4461  df-suc 4463  df-iom 4684  df-xp 4726  df-rel 4727  df-cnv 4728  df-co 4729  df-dm 4730  df-rn 4731  df-res 4732  df-ima 4733  df-iota 5281  df-fun 5323  df-fn 5324  df-f 5325  df-f1 5326  df-fo 5327  df-f1o 5328  df-fv 5329  df-isom 5330  df-riota 5963  df-ov 6013  df-oprab 6014  df-mpo 6015  df-1st 6295  df-2nd 6296  df-recs 6462  df-frec 6548  df-map 6810  df-sup 7167  df-inf 7168  df-pnf 8199  df-mnf 8200  df-xr 8201  df-ltxr 8202  df-le 8203  df-sub 8335  df-neg 8336  df-reap 8738  df-ap 8745  df-div 8836  df-inn 9127  df-2 9185  df-3 9186  df-4 9187  df-n0 9386  df-z 9463  df-uz 9739  df-q 9832  df-rp 9867  df-xneg 9985  df-xadd 9986  df-seqfrec 10687  df-exp 10778  df-cj 11374  df-re 11375  df-im 11376  df-rsqrt 11530  df-abs 11531  df-psmet 14528  df-xmet 14529  df-bl 14531
This theorem is referenced by:  blbas  15128
  Copyright terms: Public domain W3C validator