Theorem fcoi2 5573

Description: Composition of restricted identity and a mapping. (Contributed by NM, 13-Dec-2003.) (Proof shortened by Andrew Salmon, 17-Sep-2011.)

Assertion

Ref	Expression
fcoi2	|- ( F : A --> B -> ( ( _I |` B ) o. F ) = F )

Proof of Theorem fcoi2

Step	Hyp	Ref	Expression
1		df-f 5381	. 2 |- ( F : A --> B <-> ( F Fn A /\ ran F C_ B ) )
2		cores 5291	. . 3 |- ( ran F C_ B -> ( ( _I |` B ) o. F ) = ( _I o. F ) )
3		fnrel 5479	. . . 4 |- ( F Fn A -> Rel F )
4		coi2 5304	. . . 4 |- ( Rel F -> ( _I o. F ) = F )
5	3, 4	syl 14	. . 3 |- ( F Fn A -> ( _I o. F ) = F )
6	2, 5	sylan9eqr 2293	. 2 |- ( ( F Fn A /\ ran F C_ B ) -> ( ( _I |` B ) o. F ) = F )
7	1, 6	sylbi 121	1 |- ( F : A --> B -> ( ( _I |` B ) o. F ) = F )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   C_ wss 3220   _I cid 4433   ran crn 4775   |` cres 4776   o. ccom 4778   Rel wrel 4779   Fn wfn 5372   -->wf 5373

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 4249  ax-pow 4311  ax-pr 4346

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 4131  df-opab 4193  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-fun 5379  df-fn 5380  df-f 5381

This theorem is used by:  fcof1o  5995  mapen  7146  hashfacen  11284