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

Theorem blfps 23009
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 4049 . . . . . 6 {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ⊆ 𝑋
2 elfvdm 6695 . . . . . . 7 (𝐷 ∈ (PsMet‘𝑋) → 𝑋 ∈ dom PsMet)
3 elpw2g 5240 . . . . . . 7 (𝑋 ∈ dom PsMet → ({𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ∈ 𝒫 𝑋 ↔ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ⊆ 𝑋))
42, 3syl 17 . . . . . 6 (𝐷 ∈ (PsMet‘𝑋) → ({𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ∈ 𝒫 𝑋 ↔ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ⊆ 𝑋))
51, 4mpbiri 260 . . . . 5 (𝐷 ∈ (PsMet‘𝑋) → {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ∈ 𝒫 𝑋)
65a1d 25 . . . 4 (𝐷 ∈ (PsMet‘𝑋) → ((𝑥𝑋𝑟 ∈ ℝ*) → {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ∈ 𝒫 𝑋))
76ralrimivv 3189 . . 3 (𝐷 ∈ (PsMet‘𝑋) → ∀𝑥𝑋𝑟 ∈ ℝ* {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ∈ 𝒫 𝑋)
8 eqid 2820 . . . 4 (𝑥𝑋, 𝑟 ∈ ℝ* ↦ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}) = (𝑥𝑋, 𝑟 ∈ ℝ* ↦ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟})
98fmpo 7759 . . 3 (∀𝑥𝑋𝑟 ∈ ℝ* {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ∈ 𝒫 𝑋 ↔ (𝑥𝑋, 𝑟 ∈ ℝ* ↦ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}):(𝑋 × ℝ*)⟶𝒫 𝑋)
107, 9sylib 220 . 2 (𝐷 ∈ (PsMet‘𝑋) → (𝑥𝑋, 𝑟 ∈ ℝ* ↦ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}):(𝑋 × ℝ*)⟶𝒫 𝑋)
11 blfvalps 22986 . . 3 (𝐷 ∈ (PsMet‘𝑋) → (ball‘𝐷) = (𝑥𝑋, 𝑟 ∈ ℝ* ↦ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}))
1211feq1d 6492 . 2 (𝐷 ∈ (PsMet‘𝑋) → ((ball‘𝐷):(𝑋 × ℝ*)⟶𝒫 𝑋 ↔ (𝑥𝑋, 𝑟 ∈ ℝ* ↦ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}):(𝑋 × ℝ*)⟶𝒫 𝑋))
1310, 12mpbird 259 1 (𝐷 ∈ (PsMet‘𝑋) → (ball‘𝐷):(𝑋 × ℝ*)⟶𝒫 𝑋)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  wcel 2113  wral 3137  {crab 3141  wss 3929  𝒫 cpw 4532   class class class wbr 5059   × cxp 5546  dom cdm 5548  wf 6344  cfv 6348  (class class class)co 7149  cmpo 7151  *cxr 10667   < clt 10668  PsMetcpsmet 20522  ballcbl 20525
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2792  ax-sep 5196  ax-nul 5203  ax-pow 5259  ax-pr 5323  ax-un 7454  ax-cnex 10586  ax-resscn 10587
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2892  df-nfc 2962  df-ne 3016  df-ral 3142  df-rex 3143  df-rab 3146  df-v 3493  df-sbc 3769  df-csb 3877  df-dif 3932  df-un 3934  df-in 3936  df-ss 3945  df-nul 4285  df-if 4461  df-pw 4534  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-iun 4914  df-br 5060  df-opab 5122  df-mpt 5140  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-fv 6356  df-ov 7152  df-oprab 7153  df-mpo 7154  df-1st 7682  df-2nd 7683  df-map 8401  df-xr 10672  df-psmet 20530  df-bl 20533
This theorem is referenced by:  blrnps  23011  blelrnps  23019  unirnblps  23022
  Copyright terms: Public domain W3C validator