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

Theorem foima2 5930
Description: Given an onto function, an element is in its codomain if and only if it is the image of an element of its domain (see foima 5600). (Contributed by BJ, 6-Jul-2022.)
Assertion
Ref Expression
foima2  |-  ( F : A -onto-> B  -> 
( Y  e.  B  <->  E. x  e.  A  Y  =  ( F `  x ) ) )
Distinct variable groups:    x, A    x, Y    x, F
Allowed substitution hint:    B( x)

Proof of Theorem foima2
StepHypRef Expression
1 foima 5600 . . . 4  |-  ( F : A -onto-> B  -> 
( F " A
)  =  B )
21eqcomd 2240 . . 3  |-  ( F : A -onto-> B  ->  B  =  ( F " A ) )
32eleq2d 2304 . 2  |-  ( F : A -onto-> B  -> 
( Y  e.  B  <->  Y  e.  ( F " A ) ) )
4 fofn 5597 . . 3  |-  ( F : A -onto-> B  ->  F  Fn  A )
5 ssid 3262 . . 3  |-  A  C_  A
6 fvelimab 5738 . . . 4  |-  ( ( F  Fn  A  /\  A  C_  A )  -> 
( Y  e.  ( F " A )  <->  E. x  e.  A  ( F `  x )  =  Y ) )
7 eqcom 2236 . . . . 5  |-  ( ( F `  x )  =  Y  <->  Y  =  ( F `  x ) )
87rexbii 2551 . . . 4  |-  ( E. x  e.  A  ( F `  x )  =  Y  <->  E. x  e.  A  Y  =  ( F `  x ) )
96, 8bitrdi 196 . . 3  |-  ( ( F  Fn  A  /\  A  C_  A )  -> 
( Y  e.  ( F " A )  <->  E. x  e.  A  Y  =  ( F `  x ) ) )
104, 5, 9sylancl 413 . 2  |-  ( F : A -onto-> B  -> 
( Y  e.  ( F " A )  <->  E. x  e.  A  Y  =  ( F `  x ) ) )
113, 10bitrd 188 1  |-  ( F : A -onto-> B  -> 
( Y  e.  B  <->  E. x  e.  A  Y  =  ( F `  x ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2205   E.wrex 2523    C_ wss 3214   "cima 4757    Fn wfn 5352   -onto->wfo 5355   ` cfv 5357
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 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-sbc 3046  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-fo 5363  df-fv 5365
This theorem is referenced by:  foelrn  5931
  Copyright terms: Public domain W3C validator