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

Theorem fressnfv 5876
Description: The value of a function restricted to a singleton. (Contributed by NM, 9-Oct-2004.)
Assertion
Ref Expression
fressnfv  |-  ( ( F  Fn  A  /\  B  e.  A )  ->  ( ( F  |`  { B } ) : { B } --> C  <->  ( F `  B )  e.  C
) )

Proof of Theorem fressnfv
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 sneq 3705 . . . . . 6  |-  ( x  =  B  ->  { x }  =  { B } )
2 reseq2 5038 . . . . . . . 8  |-  ( { x }  =  { B }  ->  ( F  |`  { x } )  =  ( F  |`  { B } ) )
32feq1d 5500 . . . . . . 7  |-  ( { x }  =  { B }  ->  ( ( F  |`  { x } ) : {
x } --> C  <->  ( F  |` 
{ B } ) : { x } --> C ) )
4 feq2 5497 . . . . . . 7  |-  ( { x }  =  { B }  ->  ( ( F  |`  { B } ) : {
x } --> C  <->  ( F  |` 
{ B } ) : { B } --> C ) )
53, 4bitrd 188 . . . . . 6  |-  ( { x }  =  { B }  ->  ( ( F  |`  { x } ) : {
x } --> C  <->  ( F  |` 
{ B } ) : { B } --> C ) )
61, 5syl 14 . . . . 5  |-  ( x  =  B  ->  (
( F  |`  { x } ) : {
x } --> C  <->  ( F  |` 
{ B } ) : { B } --> C ) )
7 fveq2 5675 . . . . . 6  |-  ( x  =  B  ->  ( F `  x )  =  ( F `  B ) )
87eleq1d 2303 . . . . 5  |-  ( x  =  B  ->  (
( F `  x
)  e.  C  <->  ( F `  B )  e.  C
) )
96, 8bibi12d 235 . . . 4  |-  ( x  =  B  ->  (
( ( F  |`  { x } ) : { x } --> C 
<->  ( F `  x
)  e.  C )  <-> 
( ( F  |`  { B } ) : { B } --> C  <->  ( F `  B )  e.  C
) ) )
109imbi2d 230 . . 3  |-  ( x  =  B  ->  (
( F  Fn  A  ->  ( ( F  |`  { x } ) : { x } --> C 
<->  ( F `  x
)  e.  C ) )  <->  ( F  Fn  A  ->  ( ( F  |`  { B } ) : { B } --> C 
<->  ( F `  B
)  e.  C ) ) ) )
11 fnressn 5875 . . . . 5  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( F  |`  { x } )  =  { <. x ,  ( F `
 x ) >. } )
12 vsnid 3726 . . . . . . . . . 10  |-  x  e. 
{ x }
13 fvres 5699 . . . . . . . . . 10  |-  ( x  e.  { x }  ->  ( ( F  |`  { x } ) `
 x )  =  ( F `  x
) )
1412, 13ax-mp 5 . . . . . . . . 9  |-  ( ( F  |`  { x } ) `  x
)  =  ( F `
 x )
1514opeq2i 3892 . . . . . . . 8  |-  <. x ,  ( ( F  |`  { x } ) `
 x ) >.  =  <. x ,  ( F `  x )
>.
1615sneqi 3706 . . . . . . 7  |-  { <. x ,  ( ( F  |`  { x } ) `
 x ) >. }  =  { <. x ,  ( F `  x ) >. }
1716eqeq2i 2245 . . . . . 6  |-  ( ( F  |`  { x } )  =  { <. x ,  ( ( F  |`  { x } ) `  x
) >. }  <->  ( F  |` 
{ x } )  =  { <. x ,  ( F `  x ) >. } )
18 vex 2818 . . . . . . . 8  |-  x  e. 
_V
1918fsn2 5856 . . . . . . 7  |-  ( ( F  |`  { x } ) : {
x } --> C  <->  ( (
( F  |`  { x } ) `  x
)  e.  C  /\  ( F  |`  { x } )  =  { <. x ,  ( ( F  |`  { x } ) `  x
) >. } ) )
20 iba 300 . . . . . . . 8  |-  ( ( F  |`  { x } )  =  { <. x ,  ( ( F  |`  { x } ) `  x
) >. }  ->  (
( ( F  |`  { x } ) `
 x )  e.  C  <->  ( ( ( F  |`  { x } ) `  x
)  e.  C  /\  ( F  |`  { x } )  =  { <. x ,  ( ( F  |`  { x } ) `  x
) >. } ) ) )
2114eleq1i 2300 . . . . . . . 8  |-  ( ( ( F  |`  { x } ) `  x
)  e.  C  <->  ( F `  x )  e.  C
)
2220, 21bitr3di 195 . . . . . . 7  |-  ( ( F  |`  { x } )  =  { <. x ,  ( ( F  |`  { x } ) `  x
) >. }  ->  (
( ( ( F  |`  { x } ) `
 x )  e.  C  /\  ( F  |`  { x } )  =  { <. x ,  ( ( F  |`  { x } ) `
 x ) >. } )  <->  ( F `  x )  e.  C
) )
2319, 22bitrid 192 . . . . . 6  |-  ( ( F  |`  { x } )  =  { <. x ,  ( ( F  |`  { x } ) `  x
) >. }  ->  (
( F  |`  { x } ) : {
x } --> C  <->  ( F `  x )  e.  C
) )
2417, 23sylbir 135 . . . . 5  |-  ( ( F  |`  { x } )  =  { <. x ,  ( F `
 x ) >. }  ->  ( ( F  |`  { x } ) : { x } --> C 
<->  ( F `  x
)  e.  C ) )
2511, 24syl 14 . . . 4  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( ( F  |`  { x } ) : { x } --> C 
<->  ( F `  x
)  e.  C ) )
2625expcom 116 . . 3  |-  ( x  e.  A  ->  ( F  Fn  A  ->  ( ( F  |`  { x } ) : {
x } --> C  <->  ( F `  x )  e.  C
) ) )
2710, 26vtoclga 2883 . 2  |-  ( B  e.  A  ->  ( F  Fn  A  ->  ( ( F  |`  { B } ) : { B } --> C  <->  ( F `  B )  e.  C
) ) )
2827impcom 125 1  |-  ( ( F  Fn  A  /\  B  e.  A )  ->  ( ( F  |`  { B } ) : { B } --> C  <->  ( F `  B )  e.  C
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2205   {csn 3694   <.cop 3697    |` cres 4756    Fn wfn 5352   -->wf 5353   ` 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-reu 2529  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-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator