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

Theorem foco2 5318
Description: If a composition of two functions is surjective, then the function on the left is surjective. (Contributed by Jeff Madsen, 16-Jun-2011.)
Assertion
Ref Expression
foco2  |-  ( ( F : B --> C  /\  G : A --> B  /\  ( F  o.  G
) : A -onto-> C
)  ->  F : B -onto-> C )

Proof of Theorem foco2
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simp1 904 . 2  |-  ( ( F : B --> C  /\  G : A --> B  /\  ( F  o.  G
) : A -onto-> C
)  ->  F : B
--> C )
2 foelrn 5317 . . . . . 6  |-  ( ( ( F  o.  G
) : A -onto-> C  /\  y  e.  C
)  ->  E. z  e.  A  y  =  ( ( F  o.  G ) `  z
) )
3 ffvelrn 5300 . . . . . . . . . 10  |-  ( ( G : A --> B  /\  z  e.  A )  ->  ( G `  z
)  e.  B )
43adantll 445 . . . . . . . . 9  |-  ( ( ( F : B --> C  /\  G : A --> B )  /\  z  e.  A )  ->  ( G `  z )  e.  B )
5 fvco3 5244 . . . . . . . . . 10  |-  ( ( G : A --> B  /\  z  e.  A )  ->  ( ( F  o.  G ) `  z
)  =  ( F `
 ( G `  z ) ) )
65adantll 445 . . . . . . . . 9  |-  ( ( ( F : B --> C  /\  G : A --> B )  /\  z  e.  A )  ->  (
( F  o.  G
) `  z )  =  ( F `  ( G `  z ) ) )
7 fveq2 5178 . . . . . . . . . . 11  |-  ( x  =  ( G `  z )  ->  ( F `  x )  =  ( F `  ( G `  z ) ) )
87eqeq2d 2051 . . . . . . . . . 10  |-  ( x  =  ( G `  z )  ->  (
( ( F  o.  G ) `  z
)  =  ( F `
 x )  <->  ( ( F  o.  G ) `  z )  =  ( F `  ( G `
 z ) ) ) )
98rspcev 2656 . . . . . . . . 9  |-  ( ( ( G `  z
)  e.  B  /\  ( ( F  o.  G ) `  z
)  =  ( F `
 ( G `  z ) ) )  ->  E. x  e.  B  ( ( F  o.  G ) `  z
)  =  ( F `
 x ) )
104, 6, 9syl2anc 391 . . . . . . . 8  |-  ( ( ( F : B --> C  /\  G : A --> B )  /\  z  e.  A )  ->  E. x  e.  B  ( ( F  o.  G ) `  z )  =  ( F `  x ) )
11 eqeq1 2046 . . . . . . . . 9  |-  ( y  =  ( ( F  o.  G ) `  z )  ->  (
y  =  ( F `
 x )  <->  ( ( F  o.  G ) `  z )  =  ( F `  x ) ) )
1211rexbidv 2327 . . . . . . . 8  |-  ( y  =  ( ( F  o.  G ) `  z )  ->  ( E. x  e.  B  y  =  ( F `  x )  <->  E. x  e.  B  ( ( F  o.  G ) `  z )  =  ( F `  x ) ) )
1310, 12syl5ibrcom 146 . . . . . . 7  |-  ( ( ( F : B --> C  /\  G : A --> B )  /\  z  e.  A )  ->  (
y  =  ( ( F  o.  G ) `
 z )  ->  E. x  e.  B  y  =  ( F `  x ) ) )
1413rexlimdva 2433 . . . . . 6  |-  ( ( F : B --> C  /\  G : A --> B )  ->  ( E. z  e.  A  y  =  ( ( F  o.  G ) `  z
)  ->  E. x  e.  B  y  =  ( F `  x ) ) )
152, 14syl5 28 . . . . 5  |-  ( ( F : B --> C  /\  G : A --> B )  ->  ( ( ( F  o.  G ) : A -onto-> C  /\  y  e.  C )  ->  E. x  e.  B  y  =  ( F `  x ) ) )
1615impl 362 . . . 4  |-  ( ( ( ( F : B
--> C  /\  G : A
--> B )  /\  ( F  o.  G ) : A -onto-> C )  /\  y  e.  C )  ->  E. x  e.  B  y  =  ( F `  x ) )
1716ralrimiva 2392 . . 3  |-  ( ( ( F : B --> C  /\  G : A --> B )  /\  ( F  o.  G ) : A -onto-> C )  ->  A. y  e.  C  E. x  e.  B  y  =  ( F `  x ) )
18173impa 1099 . 2  |-  ( ( F : B --> C  /\  G : A --> B  /\  ( F  o.  G
) : A -onto-> C
)  ->  A. y  e.  C  E. x  e.  B  y  =  ( F `  x ) )
19 dffo3 5314 . 2  |-  ( F : B -onto-> C  <->  ( F : B --> C  /\  A. y  e.  C  E. x  e.  B  y  =  ( F `  x ) ) )
201, 18, 19sylanbrc 394 1  |-  ( ( F : B --> C  /\  G : A --> B  /\  ( F  o.  G
) : A -onto-> C
)  ->  F : B -onto-> C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 97    /\ w3a 885    = wceq 1243    e. wcel 1393   A.wral 2306   E.wrex 2307    o. ccom 4349   -->wf 4898   -onto->wfo 4900   ` cfv 4902
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-v 2559  df-sbc 2765  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-opab 3819  df-mpt 3820  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-fo 4908  df-fv 4910
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator