Theorem fcoi2 5379

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 5202	. 2 |- ( F : A --> B <-> ( F Fn A /\ ran F C_ B ) )
2		cores 5114	. . 3 |- ( ran F C_ B -> ( ( _I |` B ) o. F ) = ( _I o. F ) )
3		fnrel 5296	. . . 4 |- ( F Fn A -> Rel F )
4		coi2 5127	. . . 4 |- ( Rel F -> ( _I o. F ) = F )
5	3, 4	syl 14	. . 3 |- ( F Fn A -> ( _I o. F ) = F )
6	2, 5	sylan9eqr 2225	. 2 |- ( ( F Fn A /\ ran F C_ B ) -> ( ( _I |` B ) o. F ) = F )
7	1, 6	sylbi 120	1 |- ( F : A --> B -> ( ( _I |` B ) o. F ) = F )

Syntax hints:   -> wi 4   /\ wa 103   = wceq 1348   C_ wss 3121   _I cid 4273   ran crn 4612   |` cres 4613   o. ccom 4615   Rel wrel 4616   Fn wfn 5193   -->wf 5194

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194

This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-br 3990  df-opab 4051  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-fun 5200  df-fn 5201  df-f 5202

This theorem is referenced by:  fcof1o  5768  mapen  6824  hashfacen  10771