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

Theorem foco 5579
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 5572 . . 3  |-  ( F : B -onto-> C  <->  ( F : B --> C  /\  ran  F  =  C ) )
2 dffo2 5572 . . 3  |-  ( G : A -onto-> B  <->  ( G : A --> B  /\  ran  G  =  B ) )
3 fco 5507 . . . . 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 5495 . . . . . . . 8  |-  ( F : B --> C  ->  dom  F  =  B )
6 eqtr3 2251 . . . . . . . 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 5012 . . . . . . . . 9  |-  ( dom 
F  =  ran  G  ->  ran  ( F  o.  G )  =  ran  F )
98eqeq1d 2240 . . . . . . . 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 570 . . . . 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 5572 . 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 1398   dom cdm 4731   ran crn 4732    o. ccom 4735   -->wf 5329   -onto->wfo 5331
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 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-br 4094  df-opab 4156  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-fun 5335  df-fn 5336  df-f 5337  df-fo 5339
This theorem is referenced by:  f1oco  5615  nninfct  12692  ennnfonelemnn0  13123  ctinfomlemom  13128  qnnen  13132  enctlem  13133
  Copyright terms: Public domain W3C validator