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

Theorem fressnfv 5705
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 3605 . . . . . 6  |-  ( x  =  B  ->  { x }  =  { B } )
2 reseq2 4904 . . . . . . . 8  |-  ( { x }  =  { B }  ->  ( F  |`  { x } )  =  ( F  |`  { B } ) )
32feq1d 5354 . . . . . . 7  |-  ( { x }  =  { B }  ->  ( ( F  |`  { x } ) : {
x } --> C  <->  ( F  |` 
{ B } ) : { x } --> C ) )
4 feq2 5351 . . . . . . 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 5517 . . . . . 6  |-  ( x  =  B  ->  ( F `  x )  =  ( F `  B ) )
87eleq1d 2246 . . . . 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 5704 . . . . 5  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( F  |`  { x } )  =  { <. x ,  ( F `
 x ) >. } )
12 vsnid 3626 . . . . . . . . . 10  |-  x  e. 
{ x }
13 fvres 5541 . . . . . . . . . 10  |-  ( x  e.  { x }  ->  ( ( F  |`  { x } ) `
 x )  =  ( F `  x
) )
1412, 13ax-mp 5 . . . . . . . . 9  |-  ( ( F  |`  { x } ) `  x
)  =  ( F `
 x )
1514opeq2i 3784 . . . . . . . 8  |-  <. x ,  ( ( F  |`  { x } ) `
 x ) >.  =  <. x ,  ( F `  x )
>.
1615sneqi 3606 . . . . . . 7  |-  { <. x ,  ( ( F  |`  { x } ) `
 x ) >. }  =  { <. x ,  ( F `  x ) >. }
1716eqeq2i 2188 . . . . . 6  |-  ( ( F  |`  { x } )  =  { <. x ,  ( ( F  |`  { x } ) `  x
) >. }  <->  ( F  |` 
{ x } )  =  { <. x ,  ( F `  x ) >. } )
18 vex 2742 . . . . . . . 8  |-  x  e. 
_V
1918fsn2 5692 . . . . . . 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 2243 . . . . . . . 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 2805 . 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 1353    e. wcel 2148   {csn 3594   <.cop 3597    |` cres 4630    Fn wfn 5213   -->wf 5214   ` cfv 5218
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 4123  ax-pow 4176  ax-pr 4211
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-reu 2462  df-v 2741  df-sbc 2965  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-br 4006  df-opab 4067  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator