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

Theorem foco 5491
Description: Composition of onto functions. (Contributed by NM, 22-Mar-2006.)
Assertion
Ref Expression
foco  |-  ( ( F : B -onto-> C  /\  G : A -onto-> B
)  ->  ( F  o.  G ) : A -onto-> C )

Proof of Theorem foco
StepHypRef Expression
1 dffo2 5484 . . 3  |-  ( F : B -onto-> C  <->  ( F : B --> C  /\  ran  F  =  C ) )
2 dffo2 5484 . . 3  |-  ( G : A -onto-> B  <->  ( G : A --> B  /\  ran  G  =  B ) )
3 fco 5423 . . . . 5  |-  ( ( F : B --> C  /\  G : A --> B )  ->  ( F  o.  G ) : A --> C )
43ad2ant2r 509 . . . 4  |-  ( ( ( F : B --> C  /\  ran  F  =  C )  /\  ( G : A --> B  /\  ran  G  =  B ) )  ->  ( F  o.  G ) : A --> C )
5 fdm 5413 . . . . . . . 8  |-  ( F : B --> C  ->  dom  F  =  B )
6 eqtr3 2216 . . . . . . . 8  |-  ( ( dom  F  =  B  /\  ran  G  =  B )  ->  dom  F  =  ran  G )
75, 6sylan 283 . . . . . . 7  |-  ( ( F : B --> C  /\  ran  G  =  B )  ->  dom  F  =  ran  G )
8 rncoeq 4939 . . . . . . . . 9  |-  ( dom 
F  =  ran  G  ->  ran  ( F  o.  G )  =  ran  F )
98eqeq1d 2205 . . . . . . . 8  |-  ( dom 
F  =  ran  G  ->  ( ran  ( F  o.  G )  =  C  <->  ran  F  =  C ) )
109biimpar 297 . . . . . . 7  |-  ( ( dom  F  =  ran  G  /\  ran  F  =  C )  ->  ran  ( F  o.  G
)  =  C )
117, 10sylan 283 . . . . . 6  |-  ( ( ( F : B --> C  /\  ran  G  =  B )  /\  ran  F  =  C )  ->  ran  ( F  o.  G
)  =  C )
1211an32s 568 . . . . 5  |-  ( ( ( F : B --> C  /\  ran  F  =  C )  /\  ran  G  =  B )  ->  ran  ( F  o.  G
)  =  C )
1312adantrl 478 . . . 4  |-  ( ( ( F : B --> C  /\  ran  F  =  C )  /\  ( G : A --> B  /\  ran  G  =  B ) )  ->  ran  ( F  o.  G )  =  C )
144, 13jca 306 . . 3  |-  ( ( ( F : B --> C  /\  ran  F  =  C )  /\  ( G : A --> B  /\  ran  G  =  B ) )  ->  ( ( F  o.  G ) : A --> C  /\  ran  ( F  o.  G
)  =  C ) )
151, 2, 14syl2anb 291 . 2  |-  ( ( F : B -onto-> C  /\  G : A -onto-> B
)  ->  ( ( F  o.  G ) : A --> C  /\  ran  ( F  o.  G
)  =  C ) )
16 dffo2 5484 . 2  |-  ( ( F  o.  G ) : A -onto-> C  <->  ( ( F  o.  G ) : A --> C  /\  ran  ( F  o.  G
)  =  C ) )
1715, 16sylibr 134 1  |-  ( ( F : B -onto-> C  /\  G : A -onto-> B
)  ->  ( F  o.  G ) : A -onto-> C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1364   dom cdm 4663   ran crn 4664    o. ccom 4667   -->wf 5254   -onto->wfo 5256
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  df-f 5262  df-fo 5264
This theorem is referenced by:  f1oco  5527  nninfct  12208  ennnfonelemnn0  12639  ctinfomlemom  12644  qnnen  12648  enctlem  12649
  Copyright terms: Public domain W3C validator