MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  blval Structured version   Visualization version   GIF version

Theorem blval 23447
Description: The ball around a point 𝑃 is the set of all points whose distance from 𝑃 is less than the ball's radius 𝑅. (Contributed by NM, 31-Aug-2006.) (Revised by Mario Carneiro, 11-Nov-2013.)
Assertion
Ref Expression
blval ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (𝑃(ball‘𝐷)𝑅) = {𝑥𝑋 ∣ (𝑃𝐷𝑥) < 𝑅})
Distinct variable groups:   𝑥,𝑃   𝑥,𝐷   𝑥,𝑅   𝑥,𝑋

Proof of Theorem blval
Dummy variables 𝑟 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 blfval 23445 . . 3 (𝐷 ∈ (∞Met‘𝑋) → (ball‘𝐷) = (𝑦𝑋, 𝑟 ∈ ℝ* ↦ {𝑥𝑋 ∣ (𝑦𝐷𝑥) < 𝑟}))
213ad2ant1 1131 . 2 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (ball‘𝐷) = (𝑦𝑋, 𝑟 ∈ ℝ* ↦ {𝑥𝑋 ∣ (𝑦𝐷𝑥) < 𝑟}))
3 simprl 767 . . . . 5 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃𝑟 = 𝑅)) → 𝑦 = 𝑃)
43oveq1d 7270 . . . 4 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃𝑟 = 𝑅)) → (𝑦𝐷𝑥) = (𝑃𝐷𝑥))
5 simprr 769 . . . 4 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃𝑟 = 𝑅)) → 𝑟 = 𝑅)
64, 5breq12d 5083 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃𝑟 = 𝑅)) → ((𝑦𝐷𝑥) < 𝑟 ↔ (𝑃𝐷𝑥) < 𝑅))
76rabbidv 3404 . 2 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃𝑟 = 𝑅)) → {𝑥𝑋 ∣ (𝑦𝐷𝑥) < 𝑟} = {𝑥𝑋 ∣ (𝑃𝐷𝑥) < 𝑅})
8 simp2 1135 . 2 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → 𝑃𝑋)
9 simp3 1136 . 2 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → 𝑅 ∈ ℝ*)
10 elfvdm 6788 . . . 4 (𝐷 ∈ (∞Met‘𝑋) → 𝑋 ∈ dom ∞Met)
11103ad2ant1 1131 . . 3 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → 𝑋 ∈ dom ∞Met)
12 rabexg 5250 . . 3 (𝑋 ∈ dom ∞Met → {𝑥𝑋 ∣ (𝑃𝐷𝑥) < 𝑅} ∈ V)
1311, 12syl 17 . 2 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → {𝑥𝑋 ∣ (𝑃𝐷𝑥) < 𝑅} ∈ V)
142, 7, 8, 9, 13ovmpod 7403 1 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (𝑃(ball‘𝐷)𝑅) = {𝑥𝑋 ∣ (𝑃𝐷𝑥) < 𝑅})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1085   = wceq 1539  wcel 2108  {crab 3067  Vcvv 3422   class class class wbr 5070  dom cdm 5580  cfv 6418  (class class class)co 7255  cmpo 7257  *cxr 10939   < clt 10940  ∞Metcxmet 20495  ballcbl 20497
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-cnex 10858  ax-resscn 10859
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-1st 7804  df-2nd 7805  df-map 8575  df-xr 10944  df-psmet 20502  df-xmet 20503  df-bl 20505
This theorem is referenced by:  elbl  23449  metss2lem  23573  stdbdbl  23579  nmhmcn  24189  lgamucov  26092  isbnd3  35869
  Copyright terms: Public domain W3C validator