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

Theorem foco 5313
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 5307 . . 3  |-  ( F : B -onto-> C  <->  ( F : B --> C  /\  ran  F  =  C ) )
2 dffo2 5307 . . 3  |-  ( G : A -onto-> B  <->  ( G : A --> B  /\  ran  G  =  B ) )
3 fco 5246 . . . . 5  |-  ( ( F : B --> C  /\  G : A --> B )  ->  ( F  o.  G ) : A --> C )
43ad2ant2r 498 . . . 4  |-  ( ( ( F : B --> C  /\  ran  F  =  C )  /\  ( G : A --> B  /\  ran  G  =  B ) )  ->  ( F  o.  G ) : A --> C )
5 fdm 5236 . . . . . . . 8  |-  ( F : B --> C  ->  dom  F  =  B )
6 eqtr3 2134 . . . . . . . 8  |-  ( ( dom  F  =  B  /\  ran  G  =  B )  ->  dom  F  =  ran  G )
75, 6sylan 279 . . . . . . 7  |-  ( ( F : B --> C  /\  ran  G  =  B )  ->  dom  F  =  ran  G )
8 rncoeq 4770 . . . . . . . . 9  |-  ( dom 
F  =  ran  G  ->  ran  ( F  o.  G )  =  ran  F )
98eqeq1d 2123 . . . . . . . 8  |-  ( dom 
F  =  ran  G  ->  ( ran  ( F  o.  G )  =  C  <->  ran  F  =  C ) )
109biimpar 293 . . . . . . 7  |-  ( ( dom  F  =  ran  G  /\  ran  F  =  C )  ->  ran  ( F  o.  G
)  =  C )
117, 10sylan 279 . . . . . 6  |-  ( ( ( F : B --> C  /\  ran  G  =  B )  /\  ran  F  =  C )  ->  ran  ( F  o.  G
)  =  C )
1211an32s 540 . . . . 5  |-  ( ( ( F : B --> C  /\  ran  F  =  C )  /\  ran  G  =  B )  ->  ran  ( F  o.  G
)  =  C )
1312adantrl 467 . . . 4  |-  ( ( ( F : B --> C  /\  ran  F  =  C )  /\  ( G : A --> B  /\  ran  G  =  B ) )  ->  ran  ( F  o.  G )  =  C )
144, 13jca 302 . . 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 287 . 2  |-  ( ( F : B -onto-> C  /\  G : A -onto-> B
)  ->  ( ( F  o.  G ) : A --> C  /\  ran  ( F  o.  G
)  =  C ) )
16 dffo2 5307 . 2  |-  ( ( F  o.  G ) : A -onto-> C  <->  ( ( F  o.  G ) : A --> C  /\  ran  ( F  o.  G
)  =  C ) )
1715, 16sylibr 133 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 103    = wceq 1314   dom cdm 4499   ran crn 4500    o. ccom 4503   -->wf 5077   -onto->wfo 5079
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-14 1475  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097  ax-sep 4006  ax-pow 4058  ax-pr 4091
This theorem depends on definitions:  df-bi 116  df-3an 947  df-tru 1317  df-nf 1420  df-sb 1719  df-eu 1978  df-mo 1979  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2244  df-ral 2395  df-rex 2396  df-v 2659  df-un 3041  df-in 3043  df-ss 3050  df-pw 3478  df-sn 3499  df-pr 3500  df-op 3502  df-br 3896  df-opab 3950  df-id 4175  df-xp 4505  df-rel 4506  df-cnv 4507  df-co 4508  df-dm 4509  df-rn 4510  df-fun 5083  df-fn 5084  df-f 5085  df-fo 5087
This theorem is referenced by:  f1oco  5346  ennnfonelemnn0  11780  ctinfomlemom  11785  qnnen  11789
  Copyright terms: Public domain W3C validator