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

Theorem fnfco 5392
Description: Composition of two functions. (Contributed by NM, 22-May-2006.)
Assertion
Ref Expression
fnfco  |-  ( ( F  Fn  A  /\  G : B --> A )  ->  ( F  o.  G )  Fn  B
)

Proof of Theorem fnfco
StepHypRef Expression
1 df-f 5222 . 2  |-  ( G : B --> A  <->  ( G  Fn  B  /\  ran  G  C_  A ) )
2 fnco 5326 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ran  G  C_  A )  ->  ( F  o.  G
)  Fn  B )
323expb 1204 . 2  |-  ( ( F  Fn  A  /\  ( G  Fn  B  /\  ran  G  C_  A
) )  ->  ( F  o.  G )  Fn  B )
41, 3sylan2b 287 1  |-  ( ( F  Fn  A  /\  G : B --> A )  ->  ( F  o.  G )  Fn  B
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    C_ wss 3131   ran crn 4629    o. ccom 4632    Fn wfn 5213   -->wf 5214
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-br 4006  df-opab 4067  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-fun 5220  df-fn 5221  df-f 5222
This theorem is referenced by:  cocan1  5790  cocan2  5791  ofco  6103  1stcof  6166  2ndcof  6167  cc3  7269
  Copyright terms: Public domain W3C validator