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

Theorem fressnfv 5905
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 3720 . . . . . 6  |-  ( x  =  B  ->  { x }  =  { B } )
2 reseq2 5060 . . . . . . . 8  |-  ( { x }  =  { B }  ->  ( F  |`  { x } )  =  ( F  |`  { B } ) )
32feq1d 5523 . . . . . . 7  |-  ( { x }  =  { B }  ->  ( ( F  |`  { x } ) : {
x } --> C  <->  ( F  |` 
{ B } ) : { x } --> C ) )
4 feq2 5520 . . . . . . 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 5698 . . . . . 6  |-  ( x  =  B  ->  ( F `  x )  =  ( F `  B ) )
87eleq1d 2307 . . . . 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 5904 . . . . 5  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( F  |`  { x } )  =  { <. x ,  ( F `
 x ) >. } )
12 vsnid 3741 . . . . . . . . . 10  |-  x  e. 
{ x }
13 fvres 5722 . . . . . . . . . 10  |-  ( x  e.  { x }  ->  ( ( F  |`  { x } ) `
 x )  =  ( F `  x
) )
1412, 13ax-mp 5 . . . . . . . . 9  |-  ( ( F  |`  { x } ) `  x
)  =  ( F `
 x )
1514opeq2i 3908 . . . . . . . 8  |-  <. x ,  ( ( F  |`  { x } ) `
 x ) >.  =  <. x ,  ( F `  x )
>.
1615sneqi 3721 . . . . . . 7  |-  { <. x ,  ( ( F  |`  { x } ) `
 x ) >. }  =  { <. x ,  ( F `  x ) >. }
1716eqeq2i 2249 . . . . . 6  |-  ( ( F  |`  { x } )  =  { <. x ,  ( ( F  |`  { x } ) `  x
) >. }  <->  ( F  |` 
{ x } )  =  { <. x ,  ( F `  x ) >. } )
18 vex 2824 . . . . . . . 8  |-  x  e. 
_V
1918fsn2 5885 . . . . . . 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 2304 . . . . . . . 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 2889 . 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
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   {csn 3709   <.cop 3712    |` cres 4778    Fn wfn 5375   -->wf 5376   ` cfv 5380
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4132  df-opab 4194  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator