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

Theorem fvelimab 5738
Description: Function value in an image. (Contributed by NM, 20-Jan-2007.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) (Revised by David Abernethy, 17-Dec-2011.)
Assertion
Ref Expression
fvelimab  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( C  e.  ( F " B )  <->  E. x  e.  B  ( F `  x )  =  C ) )
Distinct variable groups:    x, B    x, C    x, F
Allowed substitution hint:    A( x)

Proof of Theorem fvelimab
Dummy variables  v  u are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 2827 . . . 4  |-  ( C  e.  ( F " B )  ->  C  e.  _V )
21anim2i 342 . . 3  |-  ( ( ( F  Fn  A  /\  B  C_  A )  /\  C  e.  ( F " B ) )  ->  ( ( F  Fn  A  /\  B  C_  A )  /\  C  e.  _V )
)
3 ssel2 3237 . . . . . . . 8  |-  ( ( B  C_  A  /\  u  e.  B )  ->  u  e.  A )
4 funfvex 5692 . . . . . . . . 9  |-  ( ( Fun  F  /\  u  e.  dom  F )  -> 
( F `  u
)  e.  _V )
54funfni 5463 . . . . . . . 8  |-  ( ( F  Fn  A  /\  u  e.  A )  ->  ( F `  u
)  e.  _V )
63, 5sylan2 286 . . . . . . 7  |-  ( ( F  Fn  A  /\  ( B  C_  A  /\  u  e.  B )
)  ->  ( F `  u )  e.  _V )
76anassrs 400 . . . . . 6  |-  ( ( ( F  Fn  A  /\  B  C_  A )  /\  u  e.  B
)  ->  ( F `  u )  e.  _V )
8 eleq1 2297 . . . . . 6  |-  ( ( F `  u )  =  C  ->  (
( F `  u
)  e.  _V  <->  C  e.  _V ) )
97, 8syl5ibcom 155 . . . . 5  |-  ( ( ( F  Fn  A  /\  B  C_  A )  /\  u  e.  B
)  ->  ( ( F `  u )  =  C  ->  C  e. 
_V ) )
109rexlimdva 2662 . . . 4  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( E. u  e.  B  ( F `  u )  =  C  ->  C  e.  _V ) )
1110imdistani 445 . . 3  |-  ( ( ( F  Fn  A  /\  B  C_  A )  /\  E. u  e.  B  ( F `  u )  =  C )  ->  ( ( F  Fn  A  /\  B  C_  A )  /\  C  e.  _V )
)
12 eleq1 2297 . . . . . . 7  |-  ( v  =  C  ->  (
v  e.  ( F
" B )  <->  C  e.  ( F " B ) ) )
13 eqeq2 2244 . . . . . . . 8  |-  ( v  =  C  ->  (
( F `  u
)  =  v  <->  ( F `  u )  =  C ) )
1413rexbidv 2545 . . . . . . 7  |-  ( v  =  C  ->  ( E. u  e.  B  ( F `  u )  =  v  <->  E. u  e.  B  ( F `  u )  =  C ) )
1512, 14bibi12d 235 . . . . . 6  |-  ( v  =  C  ->  (
( v  e.  ( F " B )  <->  E. u  e.  B  ( F `  u )  =  v )  <->  ( C  e.  ( F " B
)  <->  E. u  e.  B  ( F `  u )  =  C ) ) )
1615imbi2d 230 . . . . 5  |-  ( v  =  C  ->  (
( ( F  Fn  A  /\  B  C_  A
)  ->  ( v  e.  ( F " B
)  <->  E. u  e.  B  ( F `  u )  =  v ) )  <-> 
( ( F  Fn  A  /\  B  C_  A
)  ->  ( C  e.  ( F " B
)  <->  E. u  e.  B  ( F `  u )  =  C ) ) ) )
17 fnfun 5458 . . . . . . . 8  |-  ( F  Fn  A  ->  Fun  F )
1817adantr 276 . . . . . . 7  |-  ( ( F  Fn  A  /\  B  C_  A )  ->  Fun  F )
19 fndm 5460 . . . . . . . . 9  |-  ( F  Fn  A  ->  dom  F  =  A )
2019sseq2d 3272 . . . . . . . 8  |-  ( F  Fn  A  ->  ( B  C_  dom  F  <->  B  C_  A
) )
2120biimpar 297 . . . . . . 7  |-  ( ( F  Fn  A  /\  B  C_  A )  ->  B  C_  dom  F )
22 dfimafn 5730 . . . . . . 7  |-  ( ( Fun  F  /\  B  C_ 
dom  F )  -> 
( F " B
)  =  { v  |  E. u  e.  B  ( F `  u )  =  v } )
2318, 21, 22syl2anc 411 . . . . . 6  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( F " B
)  =  { v  |  E. u  e.  B  ( F `  u )  =  v } )
2423abeq2d 2347 . . . . 5  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( v  e.  ( F " B )  <->  E. u  e.  B  ( F `  u )  =  v ) )
2516, 24vtoclg 2877 . . . 4  |-  ( C  e.  _V  ->  (
( F  Fn  A  /\  B  C_  A )  ->  ( C  e.  ( F " B
)  <->  E. u  e.  B  ( F `  u )  =  C ) ) )
2625impcom 125 . . 3  |-  ( ( ( F  Fn  A  /\  B  C_  A )  /\  C  e.  _V )  ->  ( C  e.  ( F " B
)  <->  E. u  e.  B  ( F `  u )  =  C ) )
272, 11, 26pm5.21nd 924 . 2  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( C  e.  ( F " B )  <->  E. u  e.  B  ( F `  u )  =  C ) )
28 fveq2 5675 . . . 4  |-  ( u  =  x  ->  ( F `  u )  =  ( F `  x ) )
2928eqeq1d 2243 . . 3  |-  ( u  =  x  ->  (
( F `  u
)  =  C  <->  ( F `  x )  =  C ) )
3029cbvrexv 2781 . 2  |-  ( E. u  e.  B  ( F `  u )  =  C  <->  E. x  e.  B  ( F `  x )  =  C )
3127, 30bitrdi 196 1  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( C  e.  ( F " B )  <->  E. x  e.  B  ( F `  x )  =  C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2205   {cab 2220   E.wrex 2523   _Vcvv 2815    C_ wss 3214   dom cdm 4754   "cima 4757   Fun wfun 5351    Fn wfn 5352   ` 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-fv 5365
This theorem is referenced by:  ssimaex  5743  foima2  5930  rexima  5933  ralima  5934  f1elima  5952  ovelimab  6213  ballotfilemsima  13203
  Copyright terms: Public domain W3C validator