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

Theorem xmetresbl 13090
Description: An extended metric restricted to any ball (in particular the infinity ball) is a proper metric. Together with xmetec 13087, this shows that any extended metric space can be "factored" into the disjoint union of proper metric spaces, with points in the same region measured by that region's metric, and points in different regions being distance +∞ from each other. (Contributed by Mario Carneiro, 23-Aug-2015.)
Hypothesis
Ref Expression
xmetresbl.1 𝐵 = (𝑃(ball‘𝐷)𝑅)
Assertion
Ref Expression
xmetresbl ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (𝐷 ↾ (𝐵 × 𝐵)) ∈ (Met‘𝐵))

Proof of Theorem xmetresbl
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simp1 987 . . 3 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → 𝐷 ∈ (∞Met‘𝑋))
2 xmetresbl.1 . . . 4 𝐵 = (𝑃(ball‘𝐷)𝑅)
3 blssm 13071 . . . 4 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (𝑃(ball‘𝐷)𝑅) ⊆ 𝑋)
42, 3eqsstrid 3188 . . 3 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → 𝐵𝑋)
5 xmetres2 13029 . . 3 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐵𝑋) → (𝐷 ↾ (𝐵 × 𝐵)) ∈ (∞Met‘𝐵))
61, 4, 5syl2anc 409 . 2 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (𝐷 ↾ (𝐵 × 𝐵)) ∈ (∞Met‘𝐵))
7 xmetf 13000 . . . . . 6 (𝐷 ∈ (∞Met‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ*)
81, 7syl 14 . . . . 5 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → 𝐷:(𝑋 × 𝑋)⟶ℝ*)
9 xpss12 4711 . . . . . 6 ((𝐵𝑋𝐵𝑋) → (𝐵 × 𝐵) ⊆ (𝑋 × 𝑋))
104, 4, 9syl2anc 409 . . . . 5 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (𝐵 × 𝐵) ⊆ (𝑋 × 𝑋))
118, 10fssresd 5364 . . . 4 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (𝐷 ↾ (𝐵 × 𝐵)):(𝐵 × 𝐵)⟶ℝ*)
1211ffnd 5338 . . 3 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (𝐷 ↾ (𝐵 × 𝐵)) Fn (𝐵 × 𝐵))
13 ovres 5981 . . . . . 6 ((𝑥𝐵𝑦𝐵) → (𝑥(𝐷 ↾ (𝐵 × 𝐵))𝑦) = (𝑥𝐷𝑦))
1413adantl 275 . . . . 5 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(𝐷 ↾ (𝐵 × 𝐵))𝑦) = (𝑥𝐷𝑦))
15 simpl1 990 . . . . . . . . 9 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → 𝐷 ∈ (∞Met‘𝑋))
16 eqid 2165 . . . . . . . . . 10 (𝐷 “ ℝ) = (𝐷 “ ℝ)
1716xmeter 13086 . . . . . . . . 9 (𝐷 ∈ (∞Met‘𝑋) → (𝐷 “ ℝ) Er 𝑋)
1815, 17syl 14 . . . . . . . 8 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → (𝐷 “ ℝ) Er 𝑋)
1916blssec 13088 . . . . . . . . . . . 12 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (𝑃(ball‘𝐷)𝑅) ⊆ [𝑃](𝐷 “ ℝ))
202, 19eqsstrid 3188 . . . . . . . . . . 11 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → 𝐵 ⊆ [𝑃](𝐷 “ ℝ))
2120sselda 3142 . . . . . . . . . 10 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ 𝑥𝐵) → 𝑥 ∈ [𝑃](𝐷 “ ℝ))
2221adantrr 471 . . . . . . . . 9 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → 𝑥 ∈ [𝑃](𝐷 “ ℝ))
23 simpl2 991 . . . . . . . . . 10 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → 𝑃𝑋)
24 elecg 6539 . . . . . . . . . 10 ((𝑥 ∈ [𝑃](𝐷 “ ℝ) ∧ 𝑃𝑋) → (𝑥 ∈ [𝑃](𝐷 “ ℝ) ↔ 𝑃(𝐷 “ ℝ)𝑥))
2522, 23, 24syl2anc 409 . . . . . . . . 9 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → (𝑥 ∈ [𝑃](𝐷 “ ℝ) ↔ 𝑃(𝐷 “ ℝ)𝑥))
2622, 25mpbid 146 . . . . . . . 8 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → 𝑃(𝐷 “ ℝ)𝑥)
2720sselda 3142 . . . . . . . . . 10 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ 𝑦𝐵) → 𝑦 ∈ [𝑃](𝐷 “ ℝ))
2827adantrl 470 . . . . . . . . 9 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → 𝑦 ∈ [𝑃](𝐷 “ ℝ))
29 elecg 6539 . . . . . . . . . 10 ((𝑦 ∈ [𝑃](𝐷 “ ℝ) ∧ 𝑃𝑋) → (𝑦 ∈ [𝑃](𝐷 “ ℝ) ↔ 𝑃(𝐷 “ ℝ)𝑦))
3028, 23, 29syl2anc 409 . . . . . . . . 9 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → (𝑦 ∈ [𝑃](𝐷 “ ℝ) ↔ 𝑃(𝐷 “ ℝ)𝑦))
3128, 30mpbid 146 . . . . . . . 8 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → 𝑃(𝐷 “ ℝ)𝑦)
3218, 26, 31ertr3d 6519 . . . . . . 7 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → 𝑥(𝐷 “ ℝ)𝑦)
3316xmeterval 13085 . . . . . . . 8 (𝐷 ∈ (∞Met‘𝑋) → (𝑥(𝐷 “ ℝ)𝑦 ↔ (𝑥𝑋𝑦𝑋 ∧ (𝑥𝐷𝑦) ∈ ℝ)))
3415, 33syl 14 . . . . . . 7 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(𝐷 “ ℝ)𝑦 ↔ (𝑥𝑋𝑦𝑋 ∧ (𝑥𝐷𝑦) ∈ ℝ)))
3532, 34mpbid 146 . . . . . 6 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → (𝑥𝑋𝑦𝑋 ∧ (𝑥𝐷𝑦) ∈ ℝ))
3635simp3d 1001 . . . . 5 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → (𝑥𝐷𝑦) ∈ ℝ)
3714, 36eqeltrd 2243 . . . 4 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(𝐷 ↾ (𝐵 × 𝐵))𝑦) ∈ ℝ)
3837ralrimivva 2548 . . 3 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → ∀𝑥𝐵𝑦𝐵 (𝑥(𝐷 ↾ (𝐵 × 𝐵))𝑦) ∈ ℝ)
39 ffnov 5946 . . 3 ((𝐷 ↾ (𝐵 × 𝐵)):(𝐵 × 𝐵)⟶ℝ ↔ ((𝐷 ↾ (𝐵 × 𝐵)) Fn (𝐵 × 𝐵) ∧ ∀𝑥𝐵𝑦𝐵 (𝑥(𝐷 ↾ (𝐵 × 𝐵))𝑦) ∈ ℝ))
4012, 38, 39sylanbrc 414 . 2 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (𝐷 ↾ (𝐵 × 𝐵)):(𝐵 × 𝐵)⟶ℝ)
41 ismet2 13004 . 2 ((𝐷 ↾ (𝐵 × 𝐵)) ∈ (Met‘𝐵) ↔ ((𝐷 ↾ (𝐵 × 𝐵)) ∈ (∞Met‘𝐵) ∧ (𝐷 ↾ (𝐵 × 𝐵)):(𝐵 × 𝐵)⟶ℝ))
426, 40, 41sylanbrc 414 1 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (𝐷 ↾ (𝐵 × 𝐵)) ∈ (Met‘𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  w3a 968   = wceq 1343  wcel 2136  wral 2444  wss 3116   class class class wbr 3982   × cxp 4602  ccnv 4603  cres 4606  cima 4607   Fn wfn 5183  wf 5184  cfv 5188  (class class class)co 5842   Er wer 6498  [cec 6499  cr 7752  *cxr 7932  ∞Metcxmet 12630  Metcmet 12631  ballcbl 12632
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 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-cnex 7844  ax-resscn 7845  ax-1cn 7846  ax-1re 7847  ax-icn 7848  ax-addcl 7849  ax-addrcl 7850  ax-mulcl 7851  ax-mulrcl 7852  ax-addcom 7853  ax-mulcom 7854  ax-addass 7855  ax-mulass 7856  ax-distr 7857  ax-i2m1 7858  ax-0lt1 7859  ax-1rid 7860  ax-0id 7861  ax-rnegex 7862  ax-precex 7863  ax-cnre 7864  ax-pre-ltirr 7865  ax-pre-ltwlin 7866  ax-pre-lttrn 7867  ax-pre-apti 7868  ax-pre-ltadd 7869  ax-pre-mulgt0 7870
This theorem depends on definitions:  df-bi 116  df-stab 821  df-dc 825  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-nel 2432  df-ral 2449  df-rex 2450  df-reu 2451  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-if 3521  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-id 4271  df-po 4274  df-iso 4275  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-fv 5196  df-riota 5798  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109  df-er 6501  df-ec 6503  df-map 6616  df-pnf 7935  df-mnf 7936  df-xr 7937  df-ltxr 7938  df-le 7939  df-sub 8071  df-neg 8072  df-2 8916  df-xneg 9708  df-xadd 9709  df-psmet 12637  df-xmet 12638  df-met 12639  df-bl 12640
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator