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

Theorem foco 5570
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 5563 . . 3  |-  ( F : B -onto-> C  <->  ( F : B --> C  /\  ran  F  =  C ) )
2 dffo2 5563 . . 3  |-  ( G : A -onto-> B  <->  ( G : A --> B  /\  ran  G  =  B ) )
3 fco 5500 . . . . 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 5488 . . . . . . . 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 5006 . . . . . . . . 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 5563 . 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 1397   dom cdm 4725   ran crn 4726    o. ccom 4729   -->wf 5322   -onto->wfo 5324
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-br 4089  df-opab 4151  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-fun 5328  df-fn 5329  df-f 5330  df-fo 5332
This theorem is referenced by:  f1oco  5606  nninfct  12611  ennnfonelemnn0  13042  ctinfomlemom  13047  qnnen  13051  enctlem  13052
  Copyright terms: Public domain W3C validator