Theorem blvalps 15379

Description: The ball around a point P is the set of all points whose distance from P is less than the ball's radius R. (Contributed by NM, 31-Aug-2006.) (Revised by Mario Carneiro, 11-Nov-2013.) (Revised by Thierry Arnoux, 11-Mar-2018.)

Assertion

Ref	Expression
blvalps	|- ( ( D e. (PsMet ` X ) /\ P e. X /\ R e. RR* ) -> ( P ( ball ` D ) R ) = { x e. X | ( P D x ) < R } )

Distinct variable groups:   x, P   x, D   x, R   x, X

Proof of Theorem blvalps

Dummy variables r y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		blfvalps 15376	. . 3 |- ( D e. (PsMet ` X ) -> ( ball ` D ) = ( y e. X , r e. RR* |-> { x e. X | ( y D x ) < r } ) )
2	1	3ad2ant1 1045	. 2 |- ( ( D e. (PsMet ` X ) /\ P e. X /\ R e. RR* ) -> ( ball ` D ) = ( y e. X , r e. RR* |-> { x e. X | ( y D x ) < r } ) )
3		simprl 531	. . . . 5 |- ( ( ( D e. (PsMet ` X ) /\ P e. X /\ R e. RR* ) /\ ( y = P /\ r = R ) ) -> y = P )
4	3	oveq1d 6073	. . . 4 |- ( ( ( D e. (PsMet ` X ) /\ P e. X /\ R e. RR* ) /\ ( y = P /\ r = R ) ) -> ( y D x ) = ( P D x ) )
5		simprr 533	. . . 4 |- ( ( ( D e. (PsMet ` X ) /\ P e. X /\ R e. RR* ) /\ ( y = P /\ r = R ) ) -> r = R )
6	4, 5	breq12d 4127	. . 3 |- ( ( ( D e. (PsMet ` X ) /\ P e. X /\ R e. RR* ) /\ ( y = P /\ r = R ) ) -> ( ( y D x ) < r <-> ( P D x ) < R ) )
7	6	rabbidv 2804	. 2 |- ( ( ( D e. (PsMet ` X ) /\ P e. X /\ R e. RR* ) /\ ( y = P /\ r = R ) ) -> { x e. X | ( y D x ) < r } = { x e. X | ( P D x ) < R } )
8		simp2 1025	. 2 |- ( ( D e. (PsMet ` X ) /\ P e. X /\ R e. RR* ) -> P e. X )
9		simp3 1026	. 2 |- ( ( D e. (PsMet ` X ) /\ P e. X /\ R e. RR* ) -> R e. RR* )
10		psmetrel 15313	. . . . 5 |- Rel PsMet
11		relelfvdm 5707	. . . . 5 |- ( ( Rel PsMet /\ D e. (PsMet ` X ) ) -> X e. dom PsMet )
12	10, 11	mpan 424	. . . 4 |- ( D e. (PsMet ` X ) -> X e. dom PsMet )
13	12	3ad2ant1 1045	. . 3 |- ( ( D e. (PsMet ` X ) /\ P e. X /\ R e. RR* ) -> X e. dom PsMet )
14		rabexg 4260	. . 3 |- ( X e. dom PsMet -> { x e. X | ( P D x ) < R } e. _V )
15	13, 14	syl 14	. 2 |- ( ( D e. (PsMet ` X ) /\ P e. X /\ R e. RR* ) -> { x e. X | ( P D x ) < R } e. _V )
16	2, 7, 8, 9, 15	ovmpod 6189	1 |- ( ( D e. (PsMet ` X ) /\ P e. X /\ R e. RR* ) -> ( P ( ball ` D ) R ) = { x e. X | ( P D x ) < R } )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1005   = wceq 1398   e. wcel 2205   {crab 2526   _Vcvv 2815   class class class wbr 4114   dom cdm 4754   Rel wrel 4759   ` cfv 5357  (class class class)co 6058   e. cmpo 6060   RR*cxr 8323   < clt 8324  PsMetcpsmet 14809   ballcbl 14812

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-map 6897  df-pnf 8326  df-mnf 8327  df-xr 8328  df-psmet 14817  df-bl 14820

This theorem is referenced by:  elblps  15381