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

Theorem fnfco 5500
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 5322 . 2  |-  ( G : B --> A  <->  ( G  Fn  B  /\  ran  G  C_  A ) )
2 fnco 5431 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ran  G  C_  A )  ->  ( F  o.  G
)  Fn  B )
323expb 1228 . 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 3197   ran crn 4720    o. ccom 4723    Fn wfn 5313   -->wf 5314
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-br 4084  df-opab 4146  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-fun 5320  df-fn 5321  df-f 5322
This theorem is referenced by:  cocan1  5911  cocan2  5912  ofco  6237  1stcof  6309  2ndcof  6310  cc3  7454
  Copyright terms: Public domain W3C validator