| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > blvalps | GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| blvalps | ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) → (𝑃(ball‘𝐷)𝑅) = {𝑥 ∈ 𝑋 ∣ (𝑃𝐷𝑥) < 𝑅}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | blfvalps 15102 | . . 3 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (ball‘𝐷) = (𝑦 ∈ 𝑋, 𝑟 ∈ ℝ* ↦ {𝑥 ∈ 𝑋 ∣ (𝑦𝐷𝑥) < 𝑟})) | |
| 2 | 1 | 3ad2ant1 1042 | . 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) → (ball‘𝐷) = (𝑦 ∈ 𝑋, 𝑟 ∈ ℝ* ↦ {𝑥 ∈ 𝑋 ∣ (𝑦𝐷𝑥) < 𝑟})) |
| 3 | simprl 529 | . . . . 5 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃 ∧ 𝑟 = 𝑅)) → 𝑦 = 𝑃) | |
| 4 | 3 | oveq1d 6028 | . . . 4 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃 ∧ 𝑟 = 𝑅)) → (𝑦𝐷𝑥) = (𝑃𝐷𝑥)) |
| 5 | simprr 531 | . . . 4 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃 ∧ 𝑟 = 𝑅)) → 𝑟 = 𝑅) | |
| 6 | 4, 5 | breq12d 4099 | . . 3 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃 ∧ 𝑟 = 𝑅)) → ((𝑦𝐷𝑥) < 𝑟 ↔ (𝑃𝐷𝑥) < 𝑅)) |
| 7 | 6 | rabbidv 2789 | . 2 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) ∧ (𝑦 = 𝑃 ∧ 𝑟 = 𝑅)) → {𝑥 ∈ 𝑋 ∣ (𝑦𝐷𝑥) < 𝑟} = {𝑥 ∈ 𝑋 ∣ (𝑃𝐷𝑥) < 𝑅}) |
| 8 | simp2 1022 | . 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) → 𝑃 ∈ 𝑋) | |
| 9 | simp3 1023 | . 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) → 𝑅 ∈ ℝ*) | |
| 10 | psmetrel 15039 | . . . . 5 ⊢ Rel PsMet | |
| 11 | relelfvdm 5667 | . . . . 5 ⊢ ((Rel PsMet ∧ 𝐷 ∈ (PsMet‘𝑋)) → 𝑋 ∈ dom PsMet) | |
| 12 | 10, 11 | mpan 424 | . . . 4 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝑋 ∈ dom PsMet) |
| 13 | 12 | 3ad2ant1 1042 | . . 3 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) → 𝑋 ∈ dom PsMet) |
| 14 | rabexg 4231 | . . 3 ⊢ (𝑋 ∈ dom PsMet → {𝑥 ∈ 𝑋 ∣ (𝑃𝐷𝑥) < 𝑅} ∈ V) | |
| 15 | 13, 14 | syl 14 | . 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) → {𝑥 ∈ 𝑋 ∣ (𝑃𝐷𝑥) < 𝑅} ∈ V) |
| 16 | 2, 7, 8, 9, 15 | ovmpod 6144 | 1 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ*) → (𝑃(ball‘𝐷)𝑅) = {𝑥 ∈ 𝑋 ∣ (𝑃𝐷𝑥) < 𝑅}) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1002 = wceq 1395 ∈ wcel 2200 {crab 2512 Vcvv 2800 class class class wbr 4086 dom cdm 4723 Rel wrel 4728 ‘cfv 5324 (class class class)co 6013 ∈ cmpo 6015 ℝ*cxr 8206 < clt 8207 PsMetcpsmet 14542 ballcbl 14545 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4205 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-cnex 8116 ax-resscn 8117 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-id 4388 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-fv 5332 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-map 6814 df-pnf 8209 df-mnf 8210 df-xr 8211 df-psmet 14550 df-bl 14553 |
| This theorem is referenced by: elblps 15107 |
| Copyright terms: Public domain | W3C validator |