ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  blfvalps GIF version

Theorem blfvalps 15053
Description: The value of the ball function. (Contributed by NM, 30-Aug-2006.) (Revised by Mario Carneiro, 11-Nov-2013.) (Revised by Thierry Arnoux, 11-Feb-2018.)
Assertion
Ref Expression
blfvalps (𝐷 ∈ (PsMet‘𝑋) → (ball‘𝐷) = (𝑥𝑋, 𝑟 ∈ ℝ* ↦ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}))
Distinct variable groups:   𝑥,𝑟,𝑦,𝐷   𝑋,𝑟,𝑥,𝑦

Proof of Theorem blfvalps
Dummy variable 𝑑 is distinct from all other variables.
StepHypRef Expression
1 df-bl 14504 . . 3 ball = (𝑑 ∈ V ↦ (𝑥 ∈ dom dom 𝑑, 𝑟 ∈ ℝ* ↦ {𝑦 ∈ dom dom 𝑑 ∣ (𝑥𝑑𝑦) < 𝑟}))
21a1i 9 . 2 (𝐷 ∈ (PsMet‘𝑋) → ball = (𝑑 ∈ V ↦ (𝑥 ∈ dom dom 𝑑, 𝑟 ∈ ℝ* ↦ {𝑦 ∈ dom dom 𝑑 ∣ (𝑥𝑑𝑦) < 𝑟})))
3 dmeq 4922 . . . . 5 (𝑑 = 𝐷 → dom 𝑑 = dom 𝐷)
43dmeqd 4924 . . . 4 (𝑑 = 𝐷 → dom dom 𝑑 = dom dom 𝐷)
5 psmetdmdm 14992 . . . . 5 (𝐷 ∈ (PsMet‘𝑋) → 𝑋 = dom dom 𝐷)
65eqcomd 2235 . . . 4 (𝐷 ∈ (PsMet‘𝑋) → dom dom 𝐷 = 𝑋)
74, 6sylan9eqr 2284 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → dom dom 𝑑 = 𝑋)
8 eqidd 2230 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → ℝ* = ℝ*)
9 simpr 110 . . . . . 6 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → 𝑑 = 𝐷)
109oveqd 6017 . . . . 5 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → (𝑥𝑑𝑦) = (𝑥𝐷𝑦))
1110breq1d 4092 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → ((𝑥𝑑𝑦) < 𝑟 ↔ (𝑥𝐷𝑦) < 𝑟))
127, 11rabeqbidv 2794 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → {𝑦 ∈ dom dom 𝑑 ∣ (𝑥𝑑𝑦) < 𝑟} = {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟})
137, 8, 12mpoeq123dv 6065 . 2 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → (𝑥 ∈ dom dom 𝑑, 𝑟 ∈ ℝ* ↦ {𝑦 ∈ dom dom 𝑑 ∣ (𝑥𝑑𝑦) < 𝑟}) = (𝑥𝑋, 𝑟 ∈ ℝ* ↦ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}))
14 elex 2811 . 2 (𝐷 ∈ (PsMet‘𝑋) → 𝐷 ∈ V)
15 ssrab2 3309 . . . . . 6 {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ⊆ 𝑋
16 psmetrel 14990 . . . . . . . . 9 Rel PsMet
17 relelfvdm 5658 . . . . . . . . 9 ((Rel PsMet ∧ 𝐷 ∈ (PsMet‘𝑋)) → 𝑋 ∈ dom PsMet)
1816, 17mpan 424 . . . . . . . 8 (𝐷 ∈ (PsMet‘𝑋) → 𝑋 ∈ dom PsMet)
1918adantr 276 . . . . . . 7 ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝑥𝑋𝑟 ∈ ℝ*)) → 𝑋 ∈ dom PsMet)
20 elpw2g 4239 . . . . . . 7 (𝑋 ∈ dom PsMet → ({𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ∈ 𝒫 𝑋 ↔ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ⊆ 𝑋))
2119, 20syl 14 . . . . . 6 ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝑥𝑋𝑟 ∈ ℝ*)) → ({𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ∈ 𝒫 𝑋 ↔ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ⊆ 𝑋))
2215, 21mpbiri 168 . . . . 5 ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝑥𝑋𝑟 ∈ ℝ*)) → {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ∈ 𝒫 𝑋)
2322ralrimivva 2612 . . . 4 (𝐷 ∈ (PsMet‘𝑋) → ∀𝑥𝑋𝑟 ∈ ℝ* {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ∈ 𝒫 𝑋)
24 eqid 2229 . . . . 5 (𝑥𝑋, 𝑟 ∈ ℝ* ↦ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}) = (𝑥𝑋, 𝑟 ∈ ℝ* ↦ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟})
2524fmpo 6345 . . . 4 (∀𝑥𝑋𝑟 ∈ ℝ* {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ∈ 𝒫 𝑋 ↔ (𝑥𝑋, 𝑟 ∈ ℝ* ↦ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}):(𝑋 × ℝ*)⟶𝒫 𝑋)
2623, 25sylib 122 . . 3 (𝐷 ∈ (PsMet‘𝑋) → (𝑥𝑋, 𝑟 ∈ ℝ* ↦ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}):(𝑋 × ℝ*)⟶𝒫 𝑋)
27 xrex 10048 . . . 4 * ∈ V
28 xpexg 4832 . . . 4 ((𝑋 ∈ dom PsMet ∧ ℝ* ∈ V) → (𝑋 × ℝ*) ∈ V)
2918, 27, 28sylancl 413 . . 3 (𝐷 ∈ (PsMet‘𝑋) → (𝑋 × ℝ*) ∈ V)
3018pwexd 4264 . . 3 (𝐷 ∈ (PsMet‘𝑋) → 𝒫 𝑋 ∈ V)
31 fex2 5491 . . 3 (((𝑥𝑋, 𝑟 ∈ ℝ* ↦ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}):(𝑋 × ℝ*)⟶𝒫 𝑋 ∧ (𝑋 × ℝ*) ∈ V ∧ 𝒫 𝑋 ∈ V) → (𝑥𝑋, 𝑟 ∈ ℝ* ↦ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}) ∈ V)
3226, 29, 30, 31syl3anc 1271 . 2 (𝐷 ∈ (PsMet‘𝑋) → (𝑥𝑋, 𝑟 ∈ ℝ* ↦ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}) ∈ V)
332, 13, 14, 32fvmptd 5714 1 (𝐷 ∈ (PsMet‘𝑋) → (ball‘𝐷) = (𝑥𝑋, 𝑟 ∈ ℝ* ↦ {𝑦𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1395  wcel 2200  wral 2508  {crab 2512  Vcvv 2799  wss 3197  𝒫 cpw 3649   class class class wbr 4082  cmpt 4144   × cxp 4716  dom cdm 4718  Rel wrel 4723  wf 5313  cfv 5317  (class class class)co 6000  cmpo 6002  *cxr 8176   < clt 8177  PsMetcpsmet 14493  ballcbl 14496
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 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-cnex 8086  ax-resscn 8087
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 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-fv 5325  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-map 6795  df-pnf 8179  df-mnf 8180  df-xr 8181  df-psmet 14501  df-bl 14504
This theorem is referenced by:  blfval  15054  blvalps  15056  blfps  15077
  Copyright terms: Public domain W3C validator