Theorem istps 15133

Description: Express the predicate "is a topological space". (Contributed by Mario Carneiro, 13-Aug-2015.)

Hypotheses

Ref	Expression
istps.a	|- A = ( Base ` K )
istps.j	|- J = ( TopOpen ` K )

Assertion

Ref	Expression
istps	|- ( K e. TopSp <-> J e. (TopOn ` A ) )

Proof of Theorem istps

Dummy variable f is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-topsp 15132	. . 3 |- TopSp = { f | ( TopOpen ` f ) e. (TopOn ` ( Base ` f ) ) }
2	1	eleq2i 2305	. 2 |- ( K e. TopSp <-> K e. { f | ( TopOpen ` f ) e. (TopOn ` ( Base ` f ) ) } )
3		topontop 15115	. . . 4 |- ( J e. (TopOn ` A ) -> J e. Top )
4		topnfn 13598	. . . . . . 7 |- TopOpen Fn _V
5		fnrel 5479	. . . . . . 7 |- ( TopOpen Fn _V -> Rel TopOpen )
6	4, 5	ax-mp 5	. . . . . 6 |- Rel TopOpen
7		0opn 15107	. . . . . . 7 |- ( J e. Top -> (/) e. J )
8		istps.j	. . . . . . 7 |- J = ( TopOpen ` K )
9	7, 8	eleqtrdi 2331	. . . . . 6 |- ( J e. Top -> (/) e. ( TopOpen ` K ) )
10		relelfvdm 5727	. . . . . 6 |- ( ( Rel TopOpen /\ (/) e. ( TopOpen ` K ) ) -> K e. dom TopOpen )
11	6, 9, 10	sylancr 418	. . . . 5 |- ( J e. Top -> K e. dom TopOpen )
12	11	elexd 2835	. . . 4 |- ( J e. Top -> K e. _V )
13	3, 12	syl 14	. . 3 |- ( J e. (TopOn ` A ) -> K e. _V )
14		fveq2 5695	. . . . 5 |- ( f = K -> ( TopOpen ` f ) = ( TopOpen ` K ) )
15	14, 8	eqtr4di 2289	. . . 4 |- ( f = K -> ( TopOpen ` f ) = J )
16		fveq2 5695	. . . . . 6 |- ( f = K -> ( Base ` f ) = ( Base ` K ) )
17		istps.a	. . . . . 6 |- A = ( Base ` K )
18	16, 17	eqtr4di 2289	. . . . 5 |- ( f = K -> ( Base ` f ) = A )
19	18	fveq2d 5699	. . . 4 |- ( f = K -> (TopOn ` ( Base ` f ) ) = (TopOn ` A ) )
20	15, 19	eleq12d 2309	. . 3 |- ( f = K -> ( ( TopOpen ` f ) e. (TopOn ` ( Base ` f ) ) <-> J e. (TopOn ` A ) ) )
21	13, 20	elab3 2978	. 2 |- ( K e. { f | ( TopOpen ` f ) e. (TopOn ` ( Base ` f ) ) } <-> J e. (TopOn ` A ) )
22	2, 21	bitri 184	1 |- ( K e. TopSp <-> J e. (TopOn ` A ) )

This proof depends on syntax axioms:   <-> wb 105   = wceq 1402   e. wcel 2209   {cab 2224   _Vcvv 2821   (/)c0 3520   dom cdm 4774   Rel wrel 4779   Fn wfn 5372   ` cfv 5377   Basecbs 13352   TopOpenctopn 13594   Topctop 15098  TopOnctopon 15111   TopSpctps 15131

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-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276

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-ral 2533  df-rex 2534  df-reu 2535  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-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  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-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-inn 9305  df-2 9363  df-3 9364  df-4 9365  df-5 9366  df-6 9367  df-7 9368  df-8 9369  df-9 9370  df-ndx 13355  df-slot 13356  df-base 13358  df-tset 13450  df-rest 13595  df-topn 13596  df-top 15099  df-topon 15112  df-topsp 15132

This theorem is used by:  istps2  15134  tpspropd  15137  tsettps  15139  isxms2  15553  cnfldtopon  15641