Theorem cnco 15322

Description: The composition of two continuous functions is a continuous function. (Contributed by FL, 8-Dec-2006.) (Revised by Mario Carneiro, 21-Aug-2015.)

Assertion

Ref	Expression
cnco	|- ( ( F e. ( J Cn K ) /\ G e. ( K Cn L ) ) -> ( G o. F ) e. ( J Cn L ) )

Proof of Theorem cnco

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cntop1 15302	. . 3 |- ( F e. ( J Cn K ) -> J e. Top )
2		cntop2 15303	. . 3 |- ( G e. ( K Cn L ) -> L e. Top )
3	1, 2	anim12i 338	. 2 |- ( ( F e. ( J Cn K ) /\ G e. ( K Cn L ) ) -> ( J e. Top /\ L e. Top ) )
4		eqid 2238	. . . . 5 |- U. K = U. K
5		eqid 2238	. . . . 5 |- U. L = U. L
6	4, 5	cnf 15305	. . . 4 |- ( G e. ( K Cn L ) -> G : U. K --> U. L )
7		eqid 2238	. . . . 5 |- U. J = U. J
8	7, 4	cnf 15305	. . . 4 |- ( F e. ( J Cn K ) -> F : U. J --> U. K )
9		fco 5552	. . . 4 |- ( ( G : U. K --> U. L /\ F : U. J --> U. K ) -> ( G o. F ) : U. J --> U. L )
10	6, 8, 9	syl2anr 290	. . 3 |- ( ( F e. ( J Cn K ) /\ G e. ( K Cn L ) ) -> ( G o. F ) : U. J --> U. L )
11		cnvco 4965	. . . . . . 7 |- `' ( G o. F ) = ( `' F o. `' G )
12	11	imaeq1i 5123	. . . . . 6 |- ( `' ( G o. F ) " x ) = ( ( `' F o. `' G ) " x )
13		imaco 5293	. . . . . 6 |- ( ( `' F o. `' G ) " x ) = ( `' F " ( `' G " x ) )
14	12, 13	eqtri 2259	. . . . 5 |- ( `' ( G o. F ) " x ) = ( `' F " ( `' G " x ) )
15		simpll 531	. . . . . 6 |- ( ( ( F e. ( J Cn K ) /\ G e. ( K Cn L ) ) /\ x e. L ) -> F e. ( J Cn K ) )
16		cnima 15321	. . . . . . 7 |- ( ( G e. ( K Cn L ) /\ x e. L ) -> ( `' G " x ) e. K )
17	16	adantll 480	. . . . . 6 |- ( ( ( F e. ( J Cn K ) /\ G e. ( K Cn L ) ) /\ x e. L ) -> ( `' G " x ) e. K )
18		cnima 15321	. . . . . 6 |- ( ( F e. ( J Cn K ) /\ ( `' G " x ) e. K ) -> ( `' F " ( `' G " x ) ) e. J )
19	15, 17, 18	syl2anc 415	. . . . 5 |- ( ( ( F e. ( J Cn K ) /\ G e. ( K Cn L ) ) /\ x e. L ) -> ( `' F " ( `' G " x ) ) e. J )
20	14, 19	eqeltrid 2325	. . . 4 |- ( ( ( F e. ( J Cn K ) /\ G e. ( K Cn L ) ) /\ x e. L ) -> ( `' ( G o. F ) " x ) e. J )
21	20	ralrimiva 2623	. . 3 |- ( ( F e. ( J Cn K ) /\ G e. ( K Cn L ) ) -> A. x e. L ( `' ( G o. F ) " x ) e. J )
22	10, 21	jca 306	. 2 |- ( ( F e. ( J Cn K ) /\ G e. ( K Cn L ) ) -> ( ( G o. F ) : U. J --> U. L /\ A. x e. L ( `' ( G o. F ) " x ) e. J ) )
23	7, 5	iscn2 15301	. 2 |- ( ( G o. F ) e. ( J Cn L ) <-> ( ( J e. Top /\ L e. Top ) /\ ( ( G o. F ) : U. J --> U. L /\ A. x e. L ( `' ( G o. F ) " x ) e. J ) ) )
24	3, 22, 23	sylanbrc 421	1 |- ( ( F e. ( J Cn K ) /\ G e. ( K Cn L ) ) -> ( G o. F ) e. ( J Cn L ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   e. wcel 2209   A.wral 2528   U.cuni 3935   `'ccnv 4773   "cima 4777   o. ccom 4778   -->wf 5373  (class class class)co 6085   Topctop 15098   Cn ccn 15286

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

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-top 15099  df-topon 15112  df-cn 15289

This theorem is used by:  txcn  15376  cnmpt11  15384  cnmpt21  15392  hmeoco  15417