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

Theorem blfps 22211
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  |-  ( D  e.  (PsMet `  X
)  ->  ( ball `  D ) : ( X  X.  RR* ) --> ~P X )

Proof of Theorem blfps
Dummy variables  x  r  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ssrab2 3687 . . . . . 6  |-  { y  e.  X  |  ( x D y )  <  r }  C_  X
2 elfvdm 6220 . . . . . . 7  |-  ( D  e.  (PsMet `  X
)  ->  X  e.  dom PsMet )
3 elpw2g 4827 . . . . . . 7  |-  ( X  e.  dom PsMet  ->  ( { y  e.  X  | 
( x D y )  <  r }  e.  ~P X  <->  { y  e.  X  |  (
x D y )  <  r }  C_  X ) )
42, 3syl 17 . . . . . 6  |-  ( D  e.  (PsMet `  X
)  ->  ( {
y  e.  X  | 
( x D y )  <  r }  e.  ~P X  <->  { y  e.  X  |  (
x D y )  <  r }  C_  X ) )
51, 4mpbiri 248 . . . . 5  |-  ( D  e.  (PsMet `  X
)  ->  { y  e.  X  |  (
x D y )  <  r }  e.  ~P X )
65a1d 25 . . . 4  |-  ( D  e.  (PsMet `  X
)  ->  ( (
x  e.  X  /\  r  e.  RR* )  ->  { y  e.  X  |  ( x D y )  <  r }  e.  ~P X
) )
76ralrimivv 2970 . . 3  |-  ( D  e.  (PsMet `  X
)  ->  A. x  e.  X  A. r  e.  RR*  { y  e.  X  |  ( x D y )  < 
r }  e.  ~P X )
8 eqid 2622 . . . 4  |-  ( x  e.  X ,  r  e.  RR*  |->  { y  e.  X  |  ( x D y )  <  r } )  =  ( x  e.  X ,  r  e. 
RR*  |->  { y  e.  X  |  ( x D y )  < 
r } )
98fmpt2 7237 . . 3  |-  ( A. x  e.  X  A. r  e.  RR*  { y  e.  X  |  ( x D y )  <  r }  e.  ~P X  <->  ( x  e.  X ,  r  e. 
RR*  |->  { y  e.  X  |  ( x D y )  < 
r } ) : ( X  X.  RR* )
--> ~P X )
107, 9sylib 208 . 2  |-  ( D  e.  (PsMet `  X
)  ->  ( x  e.  X ,  r  e. 
RR*  |->  { y  e.  X  |  ( x D y )  < 
r } ) : ( X  X.  RR* )
--> ~P X )
11 blfvalps 22188 . . 3  |-  ( D  e.  (PsMet `  X
)  ->  ( ball `  D )  =  ( x  e.  X , 
r  e.  RR*  |->  { y  e.  X  |  ( x D y )  <  r } ) )
1211feq1d 6030 . 2  |-  ( D  e.  (PsMet `  X
)  ->  ( ( ball `  D ) : ( X  X.  RR* )
--> ~P X  <->  ( x  e.  X ,  r  e. 
RR*  |->  { y  e.  X  |  ( x D y )  < 
r } ) : ( X  X.  RR* )
--> ~P X ) )
1310, 12mpbird 247 1  |-  ( D  e.  (PsMet `  X
)  ->  ( ball `  D ) : ( X  X.  RR* ) --> ~P X )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    /\ wa 384    e. wcel 1990   A.wral 2912   {crab 2916    C_ wss 3574   ~Pcpw 4158   class class class wbr 4653    X. cxp 5112   dom cdm 5114   -->wf 5884   ` cfv 5888  (class class class)co 6650    |-> cmpt2 6652   RR*cxr 10073    < clt 10074  PsMetcpsmet 19730   ballcbl 19733
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-cnex 9992  ax-resscn 9993
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-1st 7168  df-2nd 7169  df-map 7859  df-xr 10078  df-psmet 19738  df-bl 19741
This theorem is referenced by:  blrnps  22213  blelrnps  22221  unirnblps  22224
  Copyright terms: Public domain W3C validator