Theorem blvalps 15489

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 15486	. . 3 |- ( D e. (PsMet ` X ) -> ( ball ` D ) = ( y e. X , r e. RR* |-> { x e. X | ( y D x ) < r } ) )
2	1	3ad2ant1 1049	. 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 535	. . . . 5 |- ( ( ( D e. (PsMet ` X ) /\ P e. X /\ R e. RR* ) /\ ( y = P /\ r = R ) ) -> y = P )
4	3	oveq1d 6100	. . . 4 |- ( ( ( D e. (PsMet ` X ) /\ P e. X /\ R e. RR* ) /\ ( y = P /\ r = R ) ) -> ( y D x ) = ( P D x ) )
5		simprr 537	. . . 4 |- ( ( ( D e. (PsMet ` X ) /\ P e. X /\ R e. RR* ) /\ ( y = P /\ r = R ) ) -> r = R )
6	4, 5	breq12d 4143	. . 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 2810	. 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 1029	. 2 |- ( ( D e. (PsMet ` X ) /\ P e. X /\ R e. RR* ) -> P e. X )
9		simp3 1030	. 2 |- ( ( D e. (PsMet ` X ) /\ P e. X /\ R e. RR* ) -> R e. RR* )
10		psmetrel 15423	. . . . 5 |- Rel PsMet
11		relelfvdm 5727	. . . . 5 |- ( ( Rel PsMet /\ D e. (PsMet ` X ) ) -> X e. dom PsMet )
12	10, 11	mpan 428	. . . 4 |- ( D e. (PsMet ` X ) -> X e. dom PsMet )
13	12	3ad2ant1 1049	. . 3 |- ( ( D e. (PsMet ` X ) /\ P e. X /\ R e. RR* ) -> X e. dom PsMet )
14		rabexg 4279	. . 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 6216	1 |- ( ( D e. (PsMet ` X ) /\ P e. X /\ R e. RR* ) -> ( P ( ball ` D ) R ) = { x e. X | ( P D x ) < R } )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   /\ w3a 1009   = wceq 1402   e. wcel 2209   {crab 2532   _Vcvv 2821   class class class wbr 4130   dom cdm 4774   Rel wrel 4779   ` cfv 5377  (class class class)co 6085   e. cmpo 6087   RR*cxr 8359   < clt 8360  PsMetcpsmet 14872   ballcbl 14875

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-map 6924  df-pnf 8362  df-mnf 8363  df-xr 8364  df-psmet 14880  df-bl 14883

This theorem is used by:  elblps  15491