ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fcoi1 Unicode version

Theorem fcoi1 5090
Description: Composition of a mapping and restricted identity. (Contributed by NM, 13-Dec-2003.) (Proof shortened by Andrew Salmon, 17-Sep-2011.)
Assertion
Ref Expression
fcoi1  |-  ( F : A --> B  -> 
( F  o.  (  _I  |`  A ) )  =  F )

Proof of Theorem fcoi1
StepHypRef Expression
1 ffn 5066 . 2  |-  ( F : A --> B  ->  F  Fn  A )
2 df-fn 4925 . . 3  |-  ( F  Fn  A  <->  ( Fun  F  /\  dom  F  =  A ) )
3 eqimss 3051 . . . . 5  |-  ( dom 
F  =  A  ->  dom  F  C_  A )
4 cnvi 4748 . . . . . . . . . 10  |-  `'  _I  =  _I
54reseq1i 4626 . . . . . . . . 9  |-  ( `'  _I  |`  A )  =  (  _I  |`  A )
65cnveqi 4528 . . . . . . . 8  |-  `' ( `'  _I  |`  A )  =  `' (  _I  |`  A )
7 cnvresid 4993 . . . . . . . 8  |-  `' (  _I  |`  A )  =  (  _I  |`  A )
86, 7eqtr2i 2102 . . . . . . 7  |-  (  _I  |`  A )  =  `' ( `'  _I  |`  A )
98coeq2i 4514 . . . . . 6  |-  ( F  o.  (  _I  |`  A ) )  =  ( F  o.  `' ( `'  _I  |`  A )
)
10 cores2 4853 . . . . . 6  |-  ( dom 
F  C_  A  ->  ( F  o.  `' ( `'  _I  |`  A )
)  =  ( F  o.  _I  ) )
119, 10syl5eq 2125 . . . . 5  |-  ( dom 
F  C_  A  ->  ( F  o.  (  _I  |`  A ) )  =  ( F  o.  _I  ) )
123, 11syl 14 . . . 4  |-  ( dom 
F  =  A  -> 
( F  o.  (  _I  |`  A ) )  =  ( F  o.  _I  ) )
13 funrel 4939 . . . . 5  |-  ( Fun 
F  ->  Rel  F )
14 coi1 4856 . . . . 5  |-  ( Rel 
F  ->  ( F  o.  _I  )  =  F )
1513, 14syl 14 . . . 4  |-  ( Fun 
F  ->  ( F  o.  _I  )  =  F )
1612, 15sylan9eqr 2135 . . 3  |-  ( ( Fun  F  /\  dom  F  =  A )  -> 
( F  o.  (  _I  |`  A ) )  =  F )
172, 16sylbi 119 . 2  |-  ( F  Fn  A  ->  ( F  o.  (  _I  |`  A ) )  =  F )
181, 17syl 14 1  |-  ( F : A --> B  -> 
( F  o.  (  _I  |`  A ) )  =  F )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    = wceq 1284    C_ wss 2973    _I cid 4043   `'ccnv 4362   dom cdm 4363    |` cres 4365    o. ccom 4367   Rel wrel 4368   Fun wfun 4916    Fn wfn 4917   -->wf 4918
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-br 3786  df-opab 3840  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-fun 4924  df-fn 4925  df-f 4926
This theorem is referenced by:  fcof1o  5449
  Copyright terms: Public domain W3C validator