Theorem isxms 14036

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.

Step	Hyp	Ref	Expression
1		fveq2 5517	. . . 4 |- ( f = K -> ( TopOpen ` f ) = ( TopOpen ` K ) )
2		isms.j	. . . 4 |- J = ( TopOpen ` K )
3	1, 2	eqtr4di 2228	. . 3 |- ( f = K -> ( TopOpen ` f ) = J )
4		fveq2 5517	. . . . . 6 |- ( f = K -> ( dist ` f ) = ( dist ` K ) )
5		fveq2 5517	. . . . . . . 8 |- ( f = K -> ( Base ` f ) = ( Base ` K ) )
6		isms.x	. . . . . . . 8 |- X = ( Base ` K )
7	5, 6	eqtr4di 2228	. . . . . . 7 |- ( f = K -> ( Base ` f ) = X )
8	7	sqxpeqd 4654	. . . . . 6 |- ( f = K -> ( ( Base ` f ) X. ( Base ` f ) ) = ( X X. X ) )
9	4, 8	reseq12d 4910	. . . . 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 ) )
11	9, 10	eqtr4di 2228	. . . 4 |- ( f = K -> ( ( dist ` f ) |` ( ( Base ` f ) X. ( Base ` f ) ) ) = D )
12	11	fveq2d 5521	. . 3 |- ( f = K -> ( MetOpen ` ( ( dist ` f ) |` ( ( Base ` f ) X. ( Base ` f ) ) ) ) = ( MetOpen ` D ) )
13	3, 12	eqeq12d 2192	. 2 |- ( f = K -> ( ( TopOpen ` f ) = ( MetOpen ` ( ( dist ` f ) |` ( ( Base ` f ) X. ( Base ` f ) ) ) ) <-> J = ( MetOpen ` D ) ) )
14		df-xms 13924	. 2 |- *MetSp = { f e. TopSp | ( TopOpen ` f ) = ( MetOpen ` ( ( dist ` f ) |` ( ( Base ` f ) X. ( Base ` f ) ) ) ) }
15	13, 14	elrab2 2898	1 |- ( K e. *MetSp <-> ( K e. TopSp /\ J = ( MetOpen ` D ) ) )

Syntax hints:   /\ wa 104   <-> wb 105   = wceq 1353   e. wcel 2148   X. cxp 4626   |` cres 4630   ` cfv 5218   Basecbs 12464   distcds 12547   TopOpenctopn 12694   MetOpencmopn 13530   TopSpctps 13615   *MetSpcxms 13921

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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-rex 2461  df-rab 2464  df-v 2741  df-un 3135  df-in 3137  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-br 4006  df-opab 4067  df-xp 4634  df-res 4640  df-iota 5180  df-fv 5226  df-xms 13924

This theorem is referenced by:  isxms2  14037  xmstopn  14040  xmstps  14042  xmspropd  14062