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

Theorem fnfco 5546
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 5363 . 2  |-  ( G : B --> A  <->  ( G  Fn  B  /\  ran  G  C_  A ) )
2 fnco 5473 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ran  G  C_  A )  ->  ( F  o.  G
)  Fn  B )
323expb 1231 . 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 3214   ran crn 4757    o. ccom 4760    Fn wfn 5354   -->wf 5355
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4234  ax-pow 4293  ax-pr 4328
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-un 3218  df-in 3220  df-ss 3227  df-pw 3677  df-sn 3701  df-pr 3702  df-op 3704  df-br 4116  df-opab 4178  df-id 4420  df-xp 4762  df-rel 4763  df-cnv 4764  df-co 4765  df-dm 4766  df-rn 4767  df-fun 5361  df-fn 5362  df-f 5363
This theorem is referenced by:  cocan1  5968  cocan2  5969  ofco  6296  1stcof  6372  2ndcof  6373  cc3  7600
  Copyright terms: Public domain W3C validator