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

Theorem fvelimab 5614
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 2771 . . . 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 3175 . . . . . . . 8  |-  ( ( B  C_  A  /\  u  e.  B )  ->  u  e.  A )
4 funfvex 5572 . . . . . . . . 9  |-  ( ( Fun  F  /\  u  e.  dom  F )  -> 
( F `  u
)  e.  _V )
54funfni 5355 . . . . . . . 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 2256 . . . . . 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 2611 . . . 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 2256 . . . . . . 7  |-  ( v  =  C  ->  (
v  e.  ( F
" B )  <->  C  e.  ( F " B ) ) )
13 eqeq2 2203 . . . . . . . 8  |-  ( v  =  C  ->  (
( F `  u
)  =  v  <->  ( F `  u )  =  C ) )
1413rexbidv 2495 . . . . . . 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 5352 . . . . . . . 8  |-  ( F  Fn  A  ->  Fun  F )
1817adantr 276 . . . . . . 7  |-  ( ( F  Fn  A  /\  B  C_  A )  ->  Fun  F )
19 fndm 5354 . . . . . . . . 9  |-  ( F  Fn  A  ->  dom  F  =  A )
2019sseq2d 3210 . . . . . . . 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 5606 . . . . . . 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 2306 . . . . 5  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( v  e.  ( F " B )  <->  E. u  e.  B  ( F `  u )  =  v ) )
2516, 24vtoclg 2821 . . . 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 917 . 2  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( C  e.  ( F " B )  <->  E. u  e.  B  ( F `  u )  =  C ) )
28 fveq2 5555 . . . 4  |-  ( u  =  x  ->  ( F `  u )  =  ( F `  x ) )
2928eqeq1d 2202 . . 3  |-  ( u  =  x  ->  (
( F `  u
)  =  C  <->  ( F `  x )  =  C ) )
3029cbvrexv 2727 . 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 1364    e. wcel 2164   {cab 2179   E.wrex 2473   _Vcvv 2760    C_ wss 3154   dom cdm 4660   "cima 4663   Fun wfun 5249    Fn wfn 5250   ` cfv 5255
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-pow 4204  ax-pr 4239
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-sbc 2987  df-un 3158  df-in 3160  df-ss 3167  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-br 4031  df-opab 4092  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-fv 5263
This theorem is referenced by:  ssimaex  5619  foima2  5795  rexima  5798  ralima  5799  f1elima  5817  ovelimab  6071
  Copyright terms: Public domain W3C validator