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

Theorem blval 15473
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 15470 . . 3 (𝐷 ∈ (∞Met‘𝑋) → (ball‘𝐷) = (𝑦𝑋, 𝑟 ∈ ℝ* ↦ {𝑥𝑋 ∣ (𝑦𝐷𝑥) < 𝑟}))
213ad2ant1 1049 . 2 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (ball‘𝐷) = (𝑦𝑋, 𝑟 ∈ ℝ* ↦ {𝑥𝑋 ∣ (𝑦𝐷𝑥) < 𝑟}))
3 simprl 535 . . . . 5 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃𝑟 = 𝑅)) → 𝑦 = 𝑃)
43oveq1d 6094 . . . 4 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃𝑟 = 𝑅)) → (𝑦𝐷𝑥) = (𝑃𝐷𝑥))
5 simprr 537 . . . 4 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃𝑟 = 𝑅)) → 𝑟 = 𝑅)
64, 5breq12d 4141 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃𝑟 = 𝑅)) → ((𝑦𝐷𝑥) < 𝑟 ↔ (𝑃𝐷𝑥) < 𝑅))
76rabbidv 2810 . 2 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃𝑟 = 𝑅)) → {𝑥𝑋 ∣ (𝑦𝐷𝑥) < 𝑟} = {𝑥𝑋 ∣ (𝑃𝐷𝑥) < 𝑅})
8 simp2 1029 . 2 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → 𝑃𝑋)
9 simp3 1030 . 2 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → 𝑅 ∈ ℝ*)
10 xmetrel 15427 . . . . 5 Rel ∞Met
11 relelfvdm 5725 . . . . 5 ((Rel ∞Met ∧ 𝐷 ∈ (∞Met‘𝑋)) → 𝑋 ∈ dom ∞Met)
1210, 11mpan 428 . . . 4 (𝐷 ∈ (∞Met‘𝑋) → 𝑋 ∈ dom ∞Met)
13123ad2ant1 1049 . . 3 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → 𝑋 ∈ dom ∞Met)
14 rabexg 4277 . . 3 (𝑋 ∈ dom ∞Met → {𝑥𝑋 ∣ (𝑃𝐷𝑥) < 𝑅} ∈ V)
1513, 14syl 14 . 2 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → {𝑥𝑋 ∣ (𝑃𝐷𝑥) < 𝑅} ∈ V)
162, 7, 8, 9, 15ovmpod 6210 1 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃𝑋𝑅 ∈ ℝ*) → (𝑃(ball‘𝐷)𝑅) = {𝑥𝑋 ∣ (𝑃𝐷𝑥) < 𝑅})
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 1009   = wceq 1402  wcel 2209  {crab 2532  Vcvv 2821   class class class wbr 4128  dom cdm 4772  Rel wrel 4777  cfv 5375  (class class class)co 6079  cmpo 6081  *cxr 8353   < clt 8354  ∞Metcxmet 14856  ballcbl 14858
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4247  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-cnex 8264  ax-resscn 8265
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-id 4436  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-fv 5383  df-ov 6082  df-oprab 6083  df-mpo 6084  df-1st 6368  df-2nd 6369  df-map 6918  df-pnf 8356  df-mnf 8357  df-xr 8358  df-psmet 14863  df-xmet 14864  df-bl 14866
This theorem is referenced by:  elbl  15475  metss2lem  15581  bdbl  15587  xmetxpbl  15592
  Copyright terms: Public domain W3C validator