blvalps - Metamath Proof Explorer

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

Theorem blvalps 24341

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 24339	. . 3 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (ball‘𝐷) = (𝑦 ∈ 𝑋, 𝑟 ∈ ℝ^* ↦ {𝑥 ∈ 𝑋 ∣ (𝑦𝐷𝑥) < 𝑟}))
2	1	3ad2ant1 1134	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ^) → (ball‘𝐷) = (𝑦 ∈ 𝑋, 𝑟 ∈ ℝ^ ↦ {𝑥 ∈ 𝑋 ∣ (𝑦𝐷𝑥) < 𝑟}))
3		simprl 771	. . . . 5 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ^*) ∧ (𝑦 = 𝑃 ∧ 𝑟 = 𝑅)) → 𝑦 = 𝑃)
4	3	oveq1d 7383	. . . 4 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ^*) ∧ (𝑦 = 𝑃 ∧ 𝑟 = 𝑅)) → (𝑦𝐷𝑥) = (𝑃𝐷𝑥))
5		simprr 773	. . . 4 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ^*) ∧ (𝑦 = 𝑃 ∧ 𝑟 = 𝑅)) → 𝑟 = 𝑅)
6	4, 5	breq12d 5113	. . 3 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ^*) ∧ (𝑦 = 𝑃 ∧ 𝑟 = 𝑅)) → ((𝑦𝐷𝑥) < 𝑟 ↔ (𝑃𝐷𝑥) < 𝑅))
7	6	rabbidv 3408	. 2 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ^*) ∧ (𝑦 = 𝑃 ∧ 𝑟 = 𝑅)) → {𝑥 ∈ 𝑋 ∣ (𝑦𝐷𝑥) < 𝑟} = {𝑥 ∈ 𝑋 ∣ (𝑃𝐷𝑥) < 𝑅})
8		simp2 1138	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ^*) → 𝑃 ∈ 𝑋)
9		simp3 1139	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ^) → 𝑅 ∈ ℝ^)
10		elfvdm 6876	. . . 4 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝑋 ∈ dom PsMet)
11	10	3ad2ant1 1134	. . 3 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ^*) → 𝑋 ∈ dom PsMet)
12		rabexg 5284	. . 3 ⊢ (𝑋 ∈ dom PsMet → {𝑥 ∈ 𝑋 ∣ (𝑃𝐷𝑥) < 𝑅} ∈ V)
13	11, 12	syl 17	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ^*) → {𝑥 ∈ 𝑋 ∣ (𝑃𝐷𝑥) < 𝑅} ∈ V)
14	2, 7, 8, 9, 13	ovmpod 7520	1 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ^*) → (𝑃(ball‘𝐷)𝑅) = {𝑥 ∈ 𝑋 ∣ (𝑃𝐷𝑥) < 𝑅})

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 {crab 3401 Vcvv 3442 class class class wbr 5100 dom cdm 5632 ‘cfv 6500 (class class class)co 7368 ∈ cmpo 7370 ℝ^*cxr 11177 < clt 11178 PsMetcpsmet 21305 ballcbl 21308

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-fv 6508 df-ov 7371 df-oprab 7372 df-mpo 7373 df-1st 7943 df-2nd 7944 df-map 8777 df-xr 11182 df-psmet 21313 df-bl 21316

This theorem is referenced by: elblps 24343 blval2 24518

W3C validator