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

Theorem foco2 5756
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 997 . 2  |-  ( ( F : B --> C  /\  G : A --> B  /\  ( F  o.  G
) : A -onto-> C
)  ->  F : B
--> C )
2 foelrn 5755 . . . . . 6  |-  ( ( ( F  o.  G
) : A -onto-> C  /\  y  e.  C
)  ->  E. z  e.  A  y  =  ( ( F  o.  G ) `  z
) )
3 ffvelcdm 5651 . . . . . . . . . 10  |-  ( ( G : A --> B  /\  z  e.  A )  ->  ( G `  z
)  e.  B )
43adantll 476 . . . . . . . . 9  |-  ( ( ( F : B --> C  /\  G : A --> B )  /\  z  e.  A )  ->  ( G `  z )  e.  B )
5 fvco3 5589 . . . . . . . . . 10  |-  ( ( G : A --> B  /\  z  e.  A )  ->  ( ( F  o.  G ) `  z
)  =  ( F `
 ( G `  z ) ) )
65adantll 476 . . . . . . . . 9  |-  ( ( ( F : B --> C  /\  G : A --> B )  /\  z  e.  A )  ->  (
( F  o.  G
) `  z )  =  ( F `  ( G `  z ) ) )
7 fveq2 5517 . . . . . . . . . . 11  |-  ( x  =  ( G `  z )  ->  ( F `  x )  =  ( F `  ( G `  z ) ) )
87eqeq2d 2189 . . . . . . . . . 10  |-  ( x  =  ( G `  z )  ->  (
( ( F  o.  G ) `  z
)  =  ( F `
 x )  <->  ( ( F  o.  G ) `  z )  =  ( F `  ( G `
 z ) ) ) )
98rspcev 2843 . . . . . . . . 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 411 . . . . . . . 8  |-  ( ( ( F : B --> C  /\  G : A --> B )  /\  z  e.  A )  ->  E. x  e.  B  ( ( F  o.  G ) `  z )  =  ( F `  x ) )
11 eqeq1 2184 . . . . . . . . 9  |-  ( y  =  ( ( F  o.  G ) `  z )  ->  (
y  =  ( F `
 x )  <->  ( ( F  o.  G ) `  z )  =  ( F `  x ) ) )
1211rexbidv 2478 . . . . . . . 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 157 . . . . . . 7  |-  ( ( ( F : B --> C  /\  G : A --> B )  /\  z  e.  A )  ->  (
y  =  ( ( F  o.  G ) `
 z )  ->  E. x  e.  B  y  =  ( F `  x ) ) )
1413rexlimdva 2594 . . . . . 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 32 . . . . 5  |-  ( ( F : B --> C  /\  G : A --> B )  ->  ( ( ( F  o.  G ) : A -onto-> C  /\  y  e.  C )  ->  E. x  e.  B  y  =  ( F `  x ) ) )
1615impl 380 . . . 4  |-  ( ( ( ( F : B
--> C  /\  G : A
--> B )  /\  ( F  o.  G ) : A -onto-> C )  /\  y  e.  C )  ->  E. x  e.  B  y  =  ( F `  x ) )
1716ralrimiva 2550 . . 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 1194 . 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 5665 . 2  |-  ( F : B -onto-> C  <->  ( F : B --> C  /\  A. y  e.  C  E. x  e.  B  y  =  ( F `  x ) ) )
201, 18, 19sylanbrc 417 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 104    /\ w3a 978    = wceq 1353    e. wcel 2148   A.wral 2455   E.wrex 2456    o. ccom 4632   -->wf 5214   -onto->wfo 5216   ` cfv 5218
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-sbc 2965  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-fo 5224  df-fv 5226
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator