MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dffo4 Structured version   Visualization version   Unicode version

Theorem dffo4 6375
Description: Alternate definition of an onto mapping. (Contributed by NM, 20-Mar-2007.)
Assertion
Ref Expression
dffo4  |-  ( F : A -onto-> B  <->  ( F : A --> B  /\  A. y  e.  B  E. x  e.  A  x F y ) )
Distinct variable groups:    x, y, A    x, B, y    x, F, y

Proof of Theorem dffo4
StepHypRef Expression
1 dffo2 6119 . . 3  |-  ( F : A -onto-> B  <->  ( F : A --> B  /\  ran  F  =  B ) )
2 simpl 473 . . . 4  |-  ( ( F : A --> B  /\  ran  F  =  B )  ->  F : A --> B )
3 vex 3203 . . . . . . . . . 10  |-  y  e. 
_V
43elrn 5366 . . . . . . . . 9  |-  ( y  e.  ran  F  <->  E. x  x F y )
5 eleq2 2690 . . . . . . . . 9  |-  ( ran 
F  =  B  -> 
( y  e.  ran  F  <-> 
y  e.  B ) )
64, 5syl5bbr 274 . . . . . . . 8  |-  ( ran 
F  =  B  -> 
( E. x  x F y  <->  y  e.  B ) )
76biimpar 502 . . . . . . 7  |-  ( ( ran  F  =  B  /\  y  e.  B
)  ->  E. x  x F y )
87adantll 750 . . . . . 6  |-  ( ( ( F : A --> B  /\  ran  F  =  B )  /\  y  e.  B )  ->  E. x  x F y )
9 ffn 6045 . . . . . . . . . . 11  |-  ( F : A --> B  ->  F  Fn  A )
10 fnbr 5993 . . . . . . . . . . . 12  |-  ( ( F  Fn  A  /\  x F y )  ->  x  e.  A )
1110ex 450 . . . . . . . . . . 11  |-  ( F  Fn  A  ->  (
x F y  ->  x  e.  A )
)
129, 11syl 17 . . . . . . . . . 10  |-  ( F : A --> B  -> 
( x F y  ->  x  e.  A
) )
1312ancrd 577 . . . . . . . . 9  |-  ( F : A --> B  -> 
( x F y  ->  ( x  e.  A  /\  x F y ) ) )
1413eximdv 1846 . . . . . . . 8  |-  ( F : A --> B  -> 
( E. x  x F y  ->  E. x
( x  e.  A  /\  x F y ) ) )
15 df-rex 2918 . . . . . . . 8  |-  ( E. x  e.  A  x F y  <->  E. x
( x  e.  A  /\  x F y ) )
1614, 15syl6ibr 242 . . . . . . 7  |-  ( F : A --> B  -> 
( E. x  x F y  ->  E. x  e.  A  x F
y ) )
1716ad2antrr 762 . . . . . 6  |-  ( ( ( F : A --> B  /\  ran  F  =  B )  /\  y  e.  B )  ->  ( E. x  x F
y  ->  E. x  e.  A  x F
y ) )
188, 17mpd 15 . . . . 5  |-  ( ( ( F : A --> B  /\  ran  F  =  B )  /\  y  e.  B )  ->  E. x  e.  A  x F
y )
1918ralrimiva 2966 . . . 4  |-  ( ( F : A --> B  /\  ran  F  =  B )  ->  A. y  e.  B  E. x  e.  A  x F y )
202, 19jca 554 . . 3  |-  ( ( F : A --> B  /\  ran  F  =  B )  ->  ( F : A
--> B  /\  A. y  e.  B  E. x  e.  A  x F
y ) )
211, 20sylbi 207 . 2  |-  ( F : A -onto-> B  -> 
( F : A --> B  /\  A. y  e.  B  E. x  e.  A  x F y ) )
22 fnbrfvb 6236 . . . . . . . . 9  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( ( F `  x )  =  y  <-> 
x F y ) )
2322biimprd 238 . . . . . . . 8  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( x F y  ->  ( F `  x )  =  y ) )
24 eqcom 2629 . . . . . . . 8  |-  ( ( F `  x )  =  y  <->  y  =  ( F `  x ) )
2523, 24syl6ib 241 . . . . . . 7  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( x F y  ->  y  =  ( F `  x ) ) )
269, 25sylan 488 . . . . . 6  |-  ( ( F : A --> B  /\  x  e.  A )  ->  ( x F y  ->  y  =  ( F `  x ) ) )
2726reximdva 3017 . . . . 5  |-  ( F : A --> B  -> 
( E. x  e.  A  x F y  ->  E. x  e.  A  y  =  ( F `  x ) ) )
2827ralimdv 2963 . . . 4  |-  ( F : A --> B  -> 
( A. y  e.  B  E. x  e.  A  x F y  ->  A. y  e.  B  E. x  e.  A  y  =  ( F `  x ) ) )
2928imdistani 726 . . 3  |-  ( ( F : A --> B  /\  A. y  e.  B  E. x  e.  A  x F y )  -> 
( F : A --> B  /\  A. y  e.  B  E. x  e.  A  y  =  ( F `  x ) ) )
30 dffo3 6374 . . 3  |-  ( F : A -onto-> B  <->  ( F : A --> B  /\  A. y  e.  B  E. x  e.  A  y  =  ( F `  x ) ) )
3129, 30sylibr 224 . 2  |-  ( ( F : A --> B  /\  A. y  e.  B  E. x  e.  A  x F y )  ->  F : A -onto-> B )
3221, 31impbii 199 1  |-  ( F : A -onto-> B  <->  ( F : A --> B  /\  A. y  e.  B  E. x  e.  A  x F y ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    /\ wa 384    = wceq 1483   E.wex 1704    e. wcel 1990   A.wral 2912   E.wrex 2913   class class class wbr 4653   ran crn 5115    Fn wfn 5883   -->wf 5884   -onto->wfo 5886   ` cfv 5888
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-fo 5894  df-fv 5896
This theorem is referenced by:  dffo5  6376  exfo  6377  brdom3  9350  phpreu  33393  poimirlem26  33435
  Copyright terms: Public domain W3C validator