Theorem blvalps 24503

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.) (Revised by Thierry Arnoux, 11-Mar-2018.)

Assertion

Ref	Expression
blvalps	⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) → (𝑃(ball‘𝐷)𝑅) = {𝑥 ∈ 𝑋 ∣ (𝑃𝐷𝑥) < 𝑅})

Distinct variable groups:   𝑥,𝑃   𝑥,𝐷   𝑥,𝑅   𝑥,𝑋

Proof of Theorem blvalps

Dummy variables 𝑟 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		blfvalps 24501	. . 3 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (ball‘𝐷) = (𝑦 ∈ 𝑋, 𝑟 ∈ ℝ* ↦ {𝑥 ∈ 𝑋 ∣ (𝑦𝐷𝑥) < 𝑟}))
2	1	3ad2ant1 1149	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) → (ball‘𝐷) = (𝑦 ∈ 𝑋, 𝑟 ∈ ℝ* ↦ {𝑥 ∈ 𝑋 ∣ (𝑦𝐷𝑥) < 𝑟}))
3		simprl 782	. . . . 5 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃 ∧ 𝑟 = 𝑅)) → 𝑦 = 𝑃)
4	3	oveq1d 7415	. . . 4 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃 ∧ 𝑟 = 𝑅)) → (𝑦𝐷𝑥) = (𝑃𝐷𝑥))
5		simprr 784	. . . 4 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃 ∧ 𝑟 = 𝑅)) → 𝑟 = 𝑅)
6	4, 5	breq12d 5118	. . 3 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃 ∧ 𝑟 = 𝑅)) → ((𝑦𝐷𝑥) < 𝑟 ↔ (𝑃𝐷𝑥) < 𝑅))
7	6	rabbidv 3424	. 2 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃 ∧ 𝑟 = 𝑅)) → {𝑥 ∈ 𝑋 ∣ (𝑦𝐷𝑥) < 𝑟} = {𝑥 ∈ 𝑋 ∣ (𝑃𝐷𝑥) < 𝑅})
8		simp2 1153	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) → 𝑃 ∈ 𝑋)
9		simp3 1154	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) → 𝑅 ∈ ℝ*)
10		elfvdm 6905	. . . 4 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝑋 ∈ dom PsMet)
11	10	3ad2ant1 1149	. . 3 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) → 𝑋 ∈ dom PsMet)
12		rabexg 5298	. . 3 ⊢ (𝑋 ∈ dom PsMet → {𝑥 ∈ 𝑋 ∣ (𝑃𝐷𝑥) < 𝑅} ∈ V)
13	11, 12	syl 18	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) → {𝑥 ∈ 𝑋 ∣ (𝑃𝐷𝑥) < 𝑅} ∈ V)
14	2, 7, 8, 9, 13	ovmpod 7552	1 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) → (𝑃(ball‘𝐷)𝑅) = {𝑥 ∈ 𝑋 ∣ (𝑃𝐷𝑥) < 𝑅})

Syntax hints:   → wi 4   ∧ wa 400   ∧ w3a 1101   = wceq 1563   ∈ wcel 2145  {crab 3417  Vcvv 3457   class class class wbr 5105  dom cdm 5652  ‘cfv 6525  (class class class)co 7400   ∈ cmpo 7402  ℝ^*cxr 11230   < clt 11231  PsMetcpsmet 21466  ballcbl 21469

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-nul 5261  ax-pow 5327  ax-pr 5395  ax-un 7722  ax-cnex 11144  ax-resscn 11145

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-iun 4954  df-br 5106  df-opab 5168  df-mpt 5187  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-fv 6533  df-ov 7403  df-oprab 7404  df-mpo 7405  df-1st 7974  df-2nd 7975  df-map 8814  df-xr 11235  df-psmet 21474  df-bl 21477

This theorem is referenced by:  elblps  24505  blval2  24680