MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fnco Structured version   Visualization version   Unicode version

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

Proof of Theorem fnco
StepHypRef Expression
1 fnfun 5988 . . . 4  |-  ( F  Fn  A  ->  Fun  F )
2 fnfun 5988 . . . 4  |-  ( G  Fn  B  ->  Fun  G )
3 funco 5928 . . . 4  |-  ( ( Fun  F  /\  Fun  G )  ->  Fun  ( F  o.  G ) )
41, 2, 3syl2an 494 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  Fun  ( F  o.  G ) )
543adant3 1081 . 2  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ran  G  C_  A )  ->  Fun  ( F  o.  G ) )
6 fndm 5990 . . . . . . 7  |-  ( F  Fn  A  ->  dom  F  =  A )
76sseq2d 3633 . . . . . 6  |-  ( F  Fn  A  ->  ( ran  G  C_  dom  F  <->  ran  G  C_  A ) )
87biimpar 502 . . . . 5  |-  ( ( F  Fn  A  /\  ran  G  C_  A )  ->  ran  G  C_  dom  F )
9 dmcosseq 5387 . . . . 5  |-  ( ran 
G  C_  dom  F  ->  dom  ( F  o.  G
)  =  dom  G
)
108, 9syl 17 . . . 4  |-  ( ( F  Fn  A  /\  ran  G  C_  A )  ->  dom  ( F  o.  G )  =  dom  G )
11103adant2 1080 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ran  G  C_  A )  ->  dom  ( F  o.  G )  =  dom  G )
12 fndm 5990 . . . 4  |-  ( G  Fn  B  ->  dom  G  =  B )
13123ad2ant2 1083 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ran  G  C_  A )  ->  dom  G  =  B )
1411, 13eqtrd 2656 . 2  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ran  G  C_  A )  ->  dom  ( F  o.  G )  =  B )
15 df-fn 5891 . 2  |-  ( ( F  o.  G )  Fn  B  <->  ( Fun  ( F  o.  G
)  /\  dom  ( F  o.  G )  =  B ) )
165, 14, 15sylanbrc 698 1  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ran  G  C_  A )  ->  ( F  o.  G
)  Fn  B )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 384    /\ w3a 1037    = wceq 1483    C_ wss 3574   dom cdm 5114   ran crn 5115    o. ccom 5118   Fun wfun 5882    Fn wfn 5883
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-opab 4713  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-fun 5890  df-fn 5891
This theorem is referenced by:  fco  6058  fnfco  6069  fipreima  8272  cshco  13582  swrdco  13583  isofn  16435  prdsinvlem  17524  prdsmgp  18610  pws1  18616  evlslem1  19515  frlmbas  20099  frlmup3  20139  frlmup4  20140  upxp  21426  uptx  21428  0vfval  27461  xppreima2  29450  psgnfzto1stlem  29850  sseqfv1  30451  sseqfn  30452  sseqfv2  30456  volsupnfl  33454  ftc1anclem5  33489  ftc1anclem8  33492  choicefi  39392  fourierdlem42  40366
  Copyright terms: Public domain W3C validator