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

Theorem blval 22998
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 22996 . . 3 (𝐷 ∈ (∞Met‘𝑋) → (ball‘𝐷) = (𝑦𝑋, 𝑟 ∈ ℝ* ↦ {𝑥𝑋 ∣ (𝑦𝐷𝑥) < 𝑟}))
213ad2ant1 1129 . 2 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (ball‘𝐷) = (𝑦𝑋, 𝑟 ∈ ℝ* ↦ {𝑥𝑋 ∣ (𝑦𝐷𝑥) < 𝑟}))
3 simprl 769 . . . . 5 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃𝑟 = 𝑅)) → 𝑦 = 𝑃)
43oveq1d 7173 . . . 4 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃𝑟 = 𝑅)) → (𝑦𝐷𝑥) = (𝑃𝐷𝑥))
5 simprr 771 . . . 4 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃𝑟 = 𝑅)) → 𝑟 = 𝑅)
64, 5breq12d 5081 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃𝑟 = 𝑅)) → ((𝑦𝐷𝑥) < 𝑟 ↔ (𝑃𝐷𝑥) < 𝑅))
76rabbidv 3482 . 2 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃𝑟 = 𝑅)) → {𝑥𝑋 ∣ (𝑦𝐷𝑥) < 𝑟} = {𝑥𝑋 ∣ (𝑃𝐷𝑥) < 𝑅})
8 simp2 1133 . 2 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → 𝑃𝑋)
9 simp3 1134 . 2 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → 𝑅 ∈ ℝ*)
10 elfvdm 6704 . . . 4 (𝐷 ∈ (∞Met‘𝑋) → 𝑋 ∈ dom ∞Met)
11103ad2ant1 1129 . . 3 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → 𝑋 ∈ dom ∞Met)
12 rabexg 5236 . . 3 (𝑋 ∈ dom ∞Met → {𝑥𝑋 ∣ (𝑃𝐷𝑥) < 𝑅} ∈ V)
1311, 12syl 17 . 2 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → {𝑥𝑋 ∣ (𝑃𝐷𝑥) < 𝑅} ∈ V)
142, 7, 8, 9, 13ovmpod 7304 1 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (𝑃(ball‘𝐷)𝑅) = {𝑥𝑋 ∣ (𝑃𝐷𝑥) < 𝑅})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  w3a 1083   = wceq 1537  wcel 2114  {crab 3144  Vcvv 3496   class class class wbr 5068  dom cdm 5557  cfv 6357  (class class class)co 7158  cmpo 7160  *cxr 10676   < clt 10677  ∞Metcxmet 20532  ballcbl 20534
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-cnex 10595  ax-resscn 10596
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-fv 6365  df-ov 7161  df-oprab 7162  df-mpo 7163  df-1st 7691  df-2nd 7692  df-map 8410  df-xr 10681  df-psmet 20539  df-xmet 20540  df-bl 20542
This theorem is referenced by:  elbl  23000  metss2lem  23123  stdbdbl  23129  nmhmcn  23726  lgamucov  25617  isbnd3  35064
  Copyright terms: Public domain W3C validator