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

Theorem fvelimab 5477
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 2697 . . . 4  |-  ( C  e.  ( F " B )  ->  C  e.  _V )
21anim2i 339 . . 3  |-  ( ( ( F  Fn  A  /\  B  C_  A )  /\  C  e.  ( F " B ) )  ->  ( ( F  Fn  A  /\  B  C_  A )  /\  C  e.  _V )
)
3 ssel2 3092 . . . . . . . 8  |-  ( ( B  C_  A  /\  u  e.  B )  ->  u  e.  A )
4 funfvex 5438 . . . . . . . . 9  |-  ( ( Fun  F  /\  u  e.  dom  F )  -> 
( F `  u
)  e.  _V )
54funfni 5223 . . . . . . . 8  |-  ( ( F  Fn  A  /\  u  e.  A )  ->  ( F `  u
)  e.  _V )
63, 5sylan2 284 . . . . . . 7  |-  ( ( F  Fn  A  /\  ( B  C_  A  /\  u  e.  B )
)  ->  ( F `  u )  e.  _V )
76anassrs 397 . . . . . 6  |-  ( ( ( F  Fn  A  /\  B  C_  A )  /\  u  e.  B
)  ->  ( F `  u )  e.  _V )
8 eleq1 2202 . . . . . 6  |-  ( ( F `  u )  =  C  ->  (
( F `  u
)  e.  _V  <->  C  e.  _V ) )
97, 8syl5ibcom 154 . . . . 5  |-  ( ( ( F  Fn  A  /\  B  C_  A )  /\  u  e.  B
)  ->  ( ( F `  u )  =  C  ->  C  e. 
_V ) )
109rexlimdva 2549 . . . 4  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( E. u  e.  B  ( F `  u )  =  C  ->  C  e.  _V ) )
1110imdistani 441 . . 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 2202 . . . . . . 7  |-  ( v  =  C  ->  (
v  e.  ( F
" B )  <->  C  e.  ( F " B ) ) )
13 eqeq2 2149 . . . . . . . 8  |-  ( v  =  C  ->  (
( F `  u
)  =  v  <->  ( F `  u )  =  C ) )
1413rexbidv 2438 . . . . . . 7  |-  ( v  =  C  ->  ( E. u  e.  B  ( F `  u )  =  v  <->  E. u  e.  B  ( F `  u )  =  C ) )
1512, 14bibi12d 234 . . . . . 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 229 . . . . 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 5220 . . . . . . . 8  |-  ( F  Fn  A  ->  Fun  F )
1817adantr 274 . . . . . . 7  |-  ( ( F  Fn  A  /\  B  C_  A )  ->  Fun  F )
19 fndm 5222 . . . . . . . . 9  |-  ( F  Fn  A  ->  dom  F  =  A )
2019sseq2d 3127 . . . . . . . 8  |-  ( F  Fn  A  ->  ( B  C_  dom  F  <->  B  C_  A
) )
2120biimpar 295 . . . . . . 7  |-  ( ( F  Fn  A  /\  B  C_  A )  ->  B  C_  dom  F )
22 dfimafn 5470 . . . . . . 7  |-  ( ( Fun  F  /\  B  C_ 
dom  F )  -> 
( F " B
)  =  { v  |  E. u  e.  B  ( F `  u )  =  v } )
2318, 21, 22syl2anc 408 . . . . . 6  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( F " B
)  =  { v  |  E. u  e.  B  ( F `  u )  =  v } )
2423abeq2d 2252 . . . . 5  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( v  e.  ( F " B )  <->  E. u  e.  B  ( F `  u )  =  v ) )
2516, 24vtoclg 2746 . . . 4  |-  ( C  e.  _V  ->  (
( F  Fn  A  /\  B  C_  A )  ->  ( C  e.  ( F " B
)  <->  E. u  e.  B  ( F `  u )  =  C ) ) )
2625impcom 124 . . 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 901 . 2  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( C  e.  ( F " B )  <->  E. u  e.  B  ( F `  u )  =  C ) )
28 fveq2 5421 . . . 4  |-  ( u  =  x  ->  ( F `  u )  =  ( F `  x ) )
2928eqeq1d 2148 . . 3  |-  ( u  =  x  ->  (
( F `  u
)  =  C  <->  ( F `  x )  =  C ) )
3029cbvrexv 2655 . 2  |-  ( E. u  e.  B  ( F `  u )  =  C  <->  E. x  e.  B  ( F `  x )  =  C )
3127, 30syl6bb 195 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 103    <-> wb 104    = wceq 1331    e. wcel 1480   {cab 2125   E.wrex 2417   _Vcvv 2686    C_ wss 3071   dom cdm 4539   "cima 4542   Fun wfun 5117    Fn wfn 5118   ` cfv 5123
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-sbc 2910  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-fv 5131
This theorem is referenced by:  ssimaex  5482  foima2  5653  rexima  5656  ralima  5657  f1elima  5674  ovelimab  5921
  Copyright terms: Public domain W3C validator