Theorem fco 5555

Description: Composition of two mappings. (Contributed by NM, 29-Aug-1999.) (Proof shortened by Andrew Salmon, 17-Sep-2011.)

Assertion

Ref	Expression
fco	|- ( ( F : B --> C /\ G : A --> B ) -> ( F o. G ) : A --> C )

Proof of Theorem fco

Step	Hyp	Ref	Expression
1		df-f 5384	. . 3 |- ( F : B --> C <-> ( F Fn B /\ ran F C_ C ) )
2		df-f 5384	. . 3 |- ( G : A --> B <-> ( G Fn A /\ ran G C_ B ) )
3		fnco 5494	. . . . . . 7 |- ( ( F Fn B /\ G Fn A /\ ran G C_ B ) -> ( F o. G ) Fn A )
4	3	3expib 1237	. . . . . 6 |- ( F Fn B -> ( ( G Fn A /\ ran G C_ B ) -> ( F o. G ) Fn A ) )
5	4	adantr 276	. . . . 5 |- ( ( F Fn B /\ ran F C_ C ) -> ( ( G Fn A /\ ran G C_ B ) -> ( F o. G ) Fn A ) )
6		rncoss 5055	. . . . . . 7 |- ran ( F o. G ) C_ ran F
7		sstr 3256	. . . . . . 7 |- ( ( ran ( F o. G ) C_ ran F /\ ran F C_ C ) -> ran ( F o. G ) C_ C )
8	6, 7	mpan 428	. . . . . 6 |- ( ran F C_ C -> ran ( F o. G ) C_ C )
9	8	adantl 277	. . . . 5 |- ( ( F Fn B /\ ran F C_ C ) -> ran ( F o. G ) C_ C )
10	5, 9	jctird 317	. . . 4 |- ( ( F Fn B /\ ran F C_ C ) -> ( ( G Fn A /\ ran G C_ B ) -> ( ( F o. G ) Fn A /\ ran ( F o. G ) C_ C ) ) )
11	10	imp 124	. . 3 |- ( ( ( F Fn B /\ ran F C_ C ) /\ ( G Fn A /\ ran G C_ B ) ) -> ( ( F o. G ) Fn A /\ ran ( F o. G ) C_ C ) )
12	1, 2, 11	syl2anb 291	. 2 |- ( ( F : B --> C /\ G : A --> B ) -> ( ( F o. G ) Fn A /\ ran ( F o. G ) C_ C ) )
13		df-f 5384	. 2 |- ( ( F o. G ) : A --> C <-> ( ( F o. G ) Fn A /\ ran ( F o. G ) C_ C ) )
14	12, 13	sylibr 134	1 |- ( ( F : B --> C /\ G : A --> B ) -> ( F o. G ) : A --> C )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   C_ wss 3220   ran crn 4777   o. ccom 4780   Fn wfn 5375   -->wf 5376

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  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 4251  ax-pow 4313  ax-pr 4348

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  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-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4132  df-opab 4194  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-fun 5382  df-fn 5383  df-f 5384

This theorem is used by:  fcod  5556  fco2  5557  f1co  5613  foco  5629  mapen  7150  ctm  7455  enomnilem  7484  enmkvlem  7507  enwomnilem  7515  fnn0nninf  10896  seqf1oglem2  10978  fsumcl2lem  12190  fsumadd  12198  fprodmul  12383  algcvg  12851  mhmco  13856  psrnegcl  15193  cnco  15447  cnptopco  15448  lmtopcnp  15476  cnmpt11  15509  cnmpt21  15517  comet  15725  cnmet  15756  cnfldms  15762  cncfco  15817  limccnpcntop  15901  dvcoapbr  15933  dvcjbr  15934  dvcj  15935