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

Theorem fvelimab 5568
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 2748 . . . 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 3150 . . . . . . . 8  |-  ( ( B  C_  A  /\  u  e.  B )  ->  u  e.  A )
4 funfvex 5528 . . . . . . . . 9  |-  ( ( Fun  F  /\  u  e.  dom  F )  -> 
( F `  u
)  e.  _V )
54funfni 5312 . . . . . . . 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 2240 . . . . . 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 2594 . . . 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 2240 . . . . . . 7  |-  ( v  =  C  ->  (
v  e.  ( F
" B )  <->  C  e.  ( F " B ) ) )
13 eqeq2 2187 . . . . . . . 8  |-  ( v  =  C  ->  (
( F `  u
)  =  v  <->  ( F `  u )  =  C ) )
1413rexbidv 2478 . . . . . . 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 5309 . . . . . . . 8  |-  ( F  Fn  A  ->  Fun  F )
1817adantr 276 . . . . . . 7  |-  ( ( F  Fn  A  /\  B  C_  A )  ->  Fun  F )
19 fndm 5311 . . . . . . . . 9  |-  ( F  Fn  A  ->  dom  F  =  A )
2019sseq2d 3185 . . . . . . . 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 5560 . . . . . . 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 2290 . . . . 5  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( v  e.  ( F " B )  <->  E. u  e.  B  ( F `  u )  =  v ) )
2516, 24vtoclg 2797 . . . 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 916 . 2  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( C  e.  ( F " B )  <->  E. u  e.  B  ( F `  u )  =  C ) )
28 fveq2 5511 . . . 4  |-  ( u  =  x  ->  ( F `  u )  =  ( F `  x ) )
2928eqeq1d 2186 . . 3  |-  ( u  =  x  ->  (
( F `  u
)  =  C  <->  ( F `  x )  =  C ) )
3029cbvrexv 2704 . 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 1353    e. wcel 2148   {cab 2163   E.wrex 2456   _Vcvv 2737    C_ wss 3129   dom cdm 4623   "cima 4626   Fun wfun 5206    Fn wfn 5207   ` cfv 5212
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4118  ax-pow 4171  ax-pr 4206
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2739  df-sbc 2963  df-un 3133  df-in 3135  df-ss 3142  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-br 4001  df-opab 4062  df-id 4290  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-iota 5174  df-fun 5214  df-fn 5215  df-fv 5220
This theorem is referenced by:  ssimaex  5573  foima2  5747  rexima  5750  ralima  5751  f1elima  5768  ovelimab  6019
  Copyright terms: Public domain W3C validator