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

Theorem xmetresbl 15154
Description: An extended metric restricted to any ball (in particular the infinity ball) is a proper metric. Together with xmetec 15151, 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 1021 . . 3 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → 𝐷 ∈ (∞Met‘𝑋))
2 xmetresbl.1 . . . 4 𝐵 = (𝑃(ball‘𝐷)𝑅)
3 blssm 15135 . . . 4 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (𝑃(ball‘𝐷)𝑅) ⊆ 𝑋)
42, 3eqsstrid 3271 . . 3 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → 𝐵𝑋)
5 xmetres2 15093 . . 3 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐵𝑋) → (𝐷 ↾ (𝐵 × 𝐵)) ∈ (∞Met‘𝐵))
61, 4, 5syl2anc 411 . 2 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (𝐷 ↾ (𝐵 × 𝐵)) ∈ (∞Met‘𝐵))
7 xmetf 15064 . . . . . 6 (𝐷 ∈ (∞Met‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ*)
81, 7syl 14 . . . . 5 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → 𝐷:(𝑋 × 𝑋)⟶ℝ*)
9 xpss12 4831 . . . . . 6 ((𝐵𝑋𝐵𝑋) → (𝐵 × 𝐵) ⊆ (𝑋 × 𝑋))
104, 4, 9syl2anc 411 . . . . 5 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (𝐵 × 𝐵) ⊆ (𝑋 × 𝑋))
118, 10fssresd 5510 . . . 4 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (𝐷 ↾ (𝐵 × 𝐵)):(𝐵 × 𝐵)⟶ℝ*)
1211ffnd 5480 . . 3 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (𝐷 ↾ (𝐵 × 𝐵)) Fn (𝐵 × 𝐵))
13 ovres 6157 . . . . . 6 ((𝑥𝐵𝑦𝐵) → (𝑥(𝐷 ↾ (𝐵 × 𝐵))𝑦) = (𝑥𝐷𝑦))
1413adantl 277 . . . . 5 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(𝐷 ↾ (𝐵 × 𝐵))𝑦) = (𝑥𝐷𝑦))
15 simpl1 1024 . . . . . . . . 9 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → 𝐷 ∈ (∞Met‘𝑋))
16 eqid 2229 . . . . . . . . . 10 (𝐷 “ ℝ) = (𝐷 “ ℝ)
1716xmeter 15150 . . . . . . . . 9 (𝐷 ∈ (∞Met‘𝑋) → (𝐷 “ ℝ) Er 𝑋)
1815, 17syl 14 . . . . . . . 8 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → (𝐷 “ ℝ) Er 𝑋)
1916blssec 15152 . . . . . . . . . . . 12 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (𝑃(ball‘𝐷)𝑅) ⊆ [𝑃](𝐷 “ ℝ))
202, 19eqsstrid 3271 . . . . . . . . . . 11 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → 𝐵 ⊆ [𝑃](𝐷 “ ℝ))
2120sselda 3225 . . . . . . . . . 10 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ 𝑥𝐵) → 𝑥 ∈ [𝑃](𝐷 “ ℝ))
2221adantrr 479 . . . . . . . . 9 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → 𝑥 ∈ [𝑃](𝐷 “ ℝ))
23 simpl2 1025 . . . . . . . . . 10 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → 𝑃𝑋)
24 elecg 6737 . . . . . . . . . 10 ((𝑥 ∈ [𝑃](𝐷 “ ℝ) ∧ 𝑃𝑋) → (𝑥 ∈ [𝑃](𝐷 “ ℝ) ↔ 𝑃(𝐷 “ ℝ)𝑥))
2522, 23, 24syl2anc 411 . . . . . . . . 9 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → (𝑥 ∈ [𝑃](𝐷 “ ℝ) ↔ 𝑃(𝐷 “ ℝ)𝑥))
2622, 25mpbid 147 . . . . . . . 8 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → 𝑃(𝐷 “ ℝ)𝑥)
2720sselda 3225 . . . . . . . . . 10 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ 𝑦𝐵) → 𝑦 ∈ [𝑃](𝐷 “ ℝ))
2827adantrl 478 . . . . . . . . 9 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → 𝑦 ∈ [𝑃](𝐷 “ ℝ))
29 elecg 6737 . . . . . . . . . 10 ((𝑦 ∈ [𝑃](𝐷 “ ℝ) ∧ 𝑃𝑋) → (𝑦 ∈ [𝑃](𝐷 “ ℝ) ↔ 𝑃(𝐷 “ ℝ)𝑦))
3028, 23, 29syl2anc 411 . . . . . . . . 9 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → (𝑦 ∈ [𝑃](𝐷 “ ℝ) ↔ 𝑃(𝐷 “ ℝ)𝑦))
3128, 30mpbid 147 . . . . . . . 8 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → 𝑃(𝐷 “ ℝ)𝑦)
3218, 26, 31ertr3d 6715 . . . . . . 7 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → 𝑥(𝐷 “ ℝ)𝑦)
3316xmeterval 15149 . . . . . . . 8 (𝐷 ∈ (∞Met‘𝑋) → (𝑥(𝐷 “ ℝ)𝑦 ↔ (𝑥𝑋𝑦𝑋 ∧ (𝑥𝐷𝑦) ∈ ℝ)))
3415, 33syl 14 . . . . . . 7 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(𝐷 “ ℝ)𝑦 ↔ (𝑥𝑋𝑦𝑋 ∧ (𝑥𝐷𝑦) ∈ ℝ)))
3532, 34mpbid 147 . . . . . 6 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → (𝑥𝑋𝑦𝑋 ∧ (𝑥𝐷𝑦) ∈ ℝ))
3635simp3d 1035 . . . . 5 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → (𝑥𝐷𝑦) ∈ ℝ)
3714, 36eqeltrd 2306 . . . 4 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(𝐷 ↾ (𝐵 × 𝐵))𝑦) ∈ ℝ)
3837ralrimivva 2612 . . 3 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → ∀𝑥𝐵𝑦𝐵 (𝑥(𝐷 ↾ (𝐵 × 𝐵))𝑦) ∈ ℝ)
39 ffnov 6120 . . 3 ((𝐷 ↾ (𝐵 × 𝐵)):(𝐵 × 𝐵)⟶ℝ ↔ ((𝐷 ↾ (𝐵 × 𝐵)) Fn (𝐵 × 𝐵) ∧ ∀𝑥𝐵𝑦𝐵 (𝑥(𝐷 ↾ (𝐵 × 𝐵))𝑦) ∈ ℝ))
4012, 38, 39sylanbrc 417 . 2 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (𝐷 ↾ (𝐵 × 𝐵)):(𝐵 × 𝐵)⟶ℝ)
41 ismet2 15068 . 2 ((𝐷 ↾ (𝐵 × 𝐵)) ∈ (Met‘𝐵) ↔ ((𝐷 ↾ (𝐵 × 𝐵)) ∈ (∞Met‘𝐵) ∧ (𝐷 ↾ (𝐵 × 𝐵)):(𝐵 × 𝐵)⟶ℝ))
426, 40, 41sylanbrc 417 1 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (𝐷 ↾ (𝐵 × 𝐵)) ∈ (Met‘𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 1002   = wceq 1395  wcel 2200  wral 2508  wss 3198   class class class wbr 4086   × cxp 4721  ccnv 4722  cres 4725  cima 4726   Fn wfn 5319  wf 5320  cfv 5324  (class class class)co 6013   Er wer 6694  [cec 6695  cr 8021  *cxr 8203  ∞Metcxmet 14540  Metcmet 14541  ballcbl 14542
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-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-mulrcl 8121  ax-addcom 8122  ax-mulcom 8123  ax-addass 8124  ax-mulass 8125  ax-distr 8126  ax-i2m1 8127  ax-0lt1 8128  ax-1rid 8129  ax-0id 8130  ax-rnegex 8131  ax-precex 8132  ax-cnre 8133  ax-pre-ltirr 8134  ax-pre-ltwlin 8135  ax-pre-lttrn 8136  ax-pre-apti 8137  ax-pre-ltadd 8138  ax-pre-mulgt0 8139
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-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-if 3604  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-po 4391  df-iso 4392  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-er 6697  df-ec 6699  df-map 6814  df-pnf 8206  df-mnf 8207  df-xr 8208  df-ltxr 8209  df-le 8210  df-sub 8342  df-neg 8343  df-2 9192  df-xneg 9997  df-xadd 9998  df-psmet 14547  df-xmet 14548  df-met 14549  df-bl 14550
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator