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

Theorem fnco 5366
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 5355 . . . 4  |-  ( F  Fn  A  ->  Fun  F )
2 fnfun 5355 . . . 4  |-  ( G  Fn  B  ->  Fun  G )
3 funco 5298 . . . 4  |-  ( ( Fun  F  /\  Fun  G )  ->  Fun  ( F  o.  G ) )
41, 2, 3syl2an 289 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  Fun  ( F  o.  G ) )
543adant3 1019 . 2  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ran  G  C_  A )  ->  Fun  ( F  o.  G ) )
6 fndm 5357 . . . . . . 7  |-  ( F  Fn  A  ->  dom  F  =  A )
76sseq2d 3213 . . . . . 6  |-  ( F  Fn  A  ->  ( ran  G  C_  dom  F  <->  ran  G  C_  A ) )
87biimpar 297 . . . . 5  |-  ( ( F  Fn  A  /\  ran  G  C_  A )  ->  ran  G  C_  dom  F )
9 dmcosseq 4937 . . . . 5  |-  ( ran 
G  C_  dom  F  ->  dom  ( F  o.  G
)  =  dom  G
)
108, 9syl 14 . . . 4  |-  ( ( F  Fn  A  /\  ran  G  C_  A )  ->  dom  ( F  o.  G )  =  dom  G )
11103adant2 1018 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ran  G  C_  A )  ->  dom  ( F  o.  G )  =  dom  G )
12 fndm 5357 . . . 4  |-  ( G  Fn  B  ->  dom  G  =  B )
13123ad2ant2 1021 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ran  G  C_  A )  ->  dom  G  =  B )
1411, 13eqtrd 2229 . 2  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ran  G  C_  A )  ->  dom  ( F  o.  G )  =  B )
15 df-fn 5261 . 2  |-  ( ( F  o.  G )  Fn  B  <->  ( Fun  ( F  o.  G
)  /\  dom  ( F  o.  G )  =  B ) )
165, 14, 15sylanbrc 417 1  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ran  G  C_  A )  ->  ( F  o.  G
)  Fn  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 980    = wceq 1364    C_ wss 3157   dom cdm 4663   ran crn 4664    o. ccom 4667   Fun wfun 5252    Fn wfn 5253
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-br 4034  df-opab 4095  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-fun 5260  df-fn 5261
This theorem is referenced by:  fco  5423  fnfco  5432  updjudhcoinlf  7146  updjudhcoinrg  7147  upxp  14508  uptx  14510
  Copyright terms: Public domain W3C validator