Theorem fcoi2 5457

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 5275	. 2 |- ( F : A --> B <-> ( F Fn A /\ ran F C_ B ) )
2		cores 5186	. . 3 |- ( ran F C_ B -> ( ( _I |` B ) o. F ) = ( _I o. F ) )
3		fnrel 5372	. . . 4 |- ( F Fn A -> Rel F )
4		coi2 5199	. . . 4 |- ( Rel F -> ( _I o. F ) = F )
5	3, 4	syl 14	. . 3 |- ( F Fn A -> ( _I o. F ) = F )
6	2, 5	sylan9eqr 2260	. 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 )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1373   C_ wss 3166   _I cid 4335   ran crn 4676   |` cres 4677   o. ccom 4679   Rel wrel 4680   Fn wfn 5266   -->wf 5267

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-pow 4218  ax-pr 4253

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-v 2774  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-br 4045  df-opab 4106  df-id 4340  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-res 4687  df-fun 5273  df-fn 5274  df-f 5275

This theorem is referenced by:  fcof1o  5858  mapen  6943  hashfacen  10981