Theorem fcoi2 5071

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 4906	. 2 |- ( F : A --> B <-> ( F Fn A /\ ran F C_ B ) )
2		cores 4824	. . 3 |- ( ran F C_ B -> ( ( _I |` B ) o. F ) = ( _I o. F ) )
3		fnrel 4997	. . . 4 |- ( F Fn A -> Rel F )
4		coi2 4837	. . . 4 |- ( Rel F -> ( _I o. F ) = F )
5	3, 4	syl 14	. . 3 |- ( F Fn A -> ( _I o. F ) = F )
6	2, 5	sylan9eqr 2094	. 2 |- ( ( F Fn A /\ ran F C_ B ) -> ( ( _I |` B ) o. F ) = F )
7	1, 6	sylbi 114	1 |- ( F : A --> B -> ( ( _I |` B ) o. F ) = F )

Syntax hints:   -> wi 4   /\ wa 97   = wceq 1243   C_ wss 2917   _I cid 4025   ran crn 4346   |` cres 4347   o. ccom 4349   Rel wrel 4350   Fn wfn 4897   -->wf 4898

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944

This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-v 2559  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-br 3765  df-opab 3819  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-fun 4904  df-fn 4905  df-f 4906

This theorem is referenced by:  fcof1o  5429