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

Theorem isxms 15174
Description: Express the predicate " <. X ,  D >. is an extended metric space" with underlying set  X and distance function  D. (Contributed by Mario Carneiro, 2-Sep-2015.)
Hypotheses
Ref Expression
isms.j  |-  J  =  ( TopOpen `  K )
isms.x  |-  X  =  ( Base `  K
)
isms.d  |-  D  =  ( ( dist `  K
)  |`  ( X  X.  X ) )
Assertion
Ref Expression
isxms  |-  ( K  e.  *MetSp  <->  ( K  e.  TopSp  /\  J  =  ( MetOpen `  D )
) )

Proof of Theorem isxms
Dummy variable  f is distinct from all other variables.
StepHypRef Expression
1 fveq2 5639 . . . 4  |-  ( f  =  K  ->  ( TopOpen
`  f )  =  ( TopOpen `  K )
)
2 isms.j . . . 4  |-  J  =  ( TopOpen `  K )
31, 2eqtr4di 2282 . . 3  |-  ( f  =  K  ->  ( TopOpen
`  f )  =  J )
4 fveq2 5639 . . . . . 6  |-  ( f  =  K  ->  ( dist `  f )  =  ( dist `  K
) )
5 fveq2 5639 . . . . . . . 8  |-  ( f  =  K  ->  ( Base `  f )  =  ( Base `  K
) )
6 isms.x . . . . . . . 8  |-  X  =  ( Base `  K
)
75, 6eqtr4di 2282 . . . . . . 7  |-  ( f  =  K  ->  ( Base `  f )  =  X )
87sqxpeqd 4751 . . . . . 6  |-  ( f  =  K  ->  (
( Base `  f )  X.  ( Base `  f
) )  =  ( X  X.  X ) )
94, 8reseq12d 5014 . . . . 5  |-  ( f  =  K  ->  (
( dist `  f )  |`  ( ( Base `  f
)  X.  ( Base `  f ) ) )  =  ( ( dist `  K )  |`  ( X  X.  X ) ) )
10 isms.d . . . . 5  |-  D  =  ( ( dist `  K
)  |`  ( X  X.  X ) )
119, 10eqtr4di 2282 . . . 4  |-  ( f  =  K  ->  (
( dist `  f )  |`  ( ( Base `  f
)  X.  ( Base `  f ) ) )  =  D )
1211fveq2d 5643 . . 3  |-  ( f  =  K  ->  ( MetOpen
`  ( ( dist `  f )  |`  (
( Base `  f )  X.  ( Base `  f
) ) ) )  =  ( MetOpen `  D
) )
133, 12eqeq12d 2246 . 2  |-  ( f  =  K  ->  (
( TopOpen `  f )  =  ( MetOpen `  (
( dist `  f )  |`  ( ( Base `  f
)  X.  ( Base `  f ) ) ) )  <->  J  =  ( MetOpen
`  D ) ) )
14 df-xms 15062 . 2  |-  *MetSp  =  { f  e.  TopSp  |  ( TopOpen `  f )  =  ( MetOpen `  (
( dist `  f )  |`  ( ( Base `  f
)  X.  ( Base `  f ) ) ) ) }
1513, 14elrab2 2965 1  |-  ( K  e.  *MetSp  <->  ( K  e.  TopSp  /\  J  =  ( MetOpen `  D )
) )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105    = wceq 1397    e. wcel 2202    X. cxp 4723    |` cres 4727   ` cfv 5326   Basecbs 13081   distcds 13168   TopOpenctopn 13322   MetOpencmopn 14554   TopSpctps 14753   *MetSpcxms 15059
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-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-rex 2516  df-rab 2519  df-v 2804  df-un 3204  df-in 3206  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-xp 4731  df-res 4737  df-iota 5286  df-fv 5334  df-xms 15062
This theorem is referenced by:  isxms2  15175  xmstopn  15178  xmstps  15180  xmspropd  15200
  Copyright terms: Public domain W3C validator