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

Theorem blfps 24417
Description: Mapping of a ball. (Contributed by NM, 7-May-2007.) (Revised by Mario Carneiro, 23-Aug-2015.) (Revised by Thierry Arnoux, 11-Mar-2018.)
Assertion
Ref Expression
blfps (𝐷 ∈ (PsMet‘𝑋) → (ball‘𝐷):(𝑋 × ℝ*)⟶𝒫 𝑋)

Proof of Theorem blfps
Dummy variables 𝑥 𝑟 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ssrab2 4079 . . . . . 6 {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ⊆ 𝑋
2 elfvdm 6942 . . . . . . 7 (𝐷 ∈ (PsMet‘𝑋) → 𝑋 ∈ dom PsMet)
3 elpw2g 5332 . . . . . . 7 (𝑋 ∈ dom PsMet → ({𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ∈ 𝒫 𝑋 ↔ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ⊆ 𝑋))
42, 3syl 17 . . . . . 6 (𝐷 ∈ (PsMet‘𝑋) → ({𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ∈ 𝒫 𝑋 ↔ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ⊆ 𝑋))
51, 4mpbiri 258 . . . . 5 (𝐷 ∈ (PsMet‘𝑋) → {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ∈ 𝒫 𝑋)
65a1d 25 . . . 4 (𝐷 ∈ (PsMet‘𝑋) → ((𝑥𝑋𝑟 ∈ ℝ*) → {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ∈ 𝒫 𝑋))
76ralrimivv 3199 . . 3 (𝐷 ∈ (PsMet‘𝑋) → ∀𝑥𝑋𝑟 ∈ ℝ* {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ∈ 𝒫 𝑋)
8 eqid 2736 . . . 4 (𝑥𝑋, 𝑟 ∈ ℝ* ↦ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}) = (𝑥𝑋, 𝑟 ∈ ℝ* ↦ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟})
98fmpo 8094 . . 3 (∀𝑥𝑋𝑟 ∈ ℝ* {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ∈ 𝒫 𝑋 ↔ (𝑥𝑋, 𝑟 ∈ ℝ* ↦ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}):(𝑋 × ℝ*)⟶𝒫 𝑋)
107, 9sylib 218 . 2 (𝐷 ∈ (PsMet‘𝑋) → (𝑥𝑋, 𝑟 ∈ ℝ* ↦ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}):(𝑋 × ℝ*)⟶𝒫 𝑋)
11 blfvalps 24394 . . 3 (𝐷 ∈ (PsMet‘𝑋) → (ball‘𝐷) = (𝑥𝑋, 𝑟 ∈ ℝ* ↦ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}))
1211feq1d 6719 . 2 (𝐷 ∈ (PsMet‘𝑋) → ((ball‘𝐷):(𝑋 × ℝ*)⟶𝒫 𝑋 ↔ (𝑥𝑋, 𝑟 ∈ ℝ* ↦ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}):(𝑋 × ℝ*)⟶𝒫 𝑋))
1310, 12mpbird 257 1 (𝐷 ∈ (PsMet‘𝑋) → (ball‘𝐷):(𝑋 × ℝ*)⟶𝒫 𝑋)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wcel 2107  wral 3060  {crab 3435  wss 3950  𝒫 cpw 4599   class class class wbr 5142   × cxp 5682  dom cdm 5684  wf 6556  cfv 6560  (class class class)co 7432  cmpo 7434  *cxr 11295   < clt 11296  PsMetcpsmet 21349  ballcbl 21352
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-sep 5295  ax-nul 5305  ax-pow 5364  ax-pr 5431  ax-un 7756  ax-cnex 11212  ax-resscn 11213
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3436  df-v 3481  df-sbc 3788  df-csb 3899  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-nul 4333  df-if 4525  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-iun 4992  df-br 5143  df-opab 5205  df-mpt 5225  df-id 5577  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-res 5696  df-ima 5697  df-iota 6513  df-fun 6562  df-fn 6563  df-f 6564  df-fv 6568  df-ov 7435  df-oprab 7436  df-mpo 7437  df-1st 8015  df-2nd 8016  df-map 8869  df-xr 11300  df-psmet 21357  df-bl 21360
This theorem is referenced by:  blrnps  24419  blelrnps  24427  unirnblps  24430
  Copyright terms: Public domain W3C validator