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

Theorem fnressn 5370
Description: A function restricted to a singleton. (Contributed by NM, 9-Oct-2004.)
Assertion
Ref Expression
fnressn  |-  ( ( F  Fn  A  /\  B  e.  A )  ->  ( F  |`  { B } )  =  { <. B ,  ( F `
 B ) >. } )

Proof of Theorem fnressn
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 sneq 3409 . . . . . 6  |-  ( x  =  B  ->  { x }  =  { B } )
21reseq2d 4630 . . . . 5  |-  ( x  =  B  ->  ( F  |`  { x }
)  =  ( F  |`  { B } ) )
3 fveq2 5198 . . . . . . 7  |-  ( x  =  B  ->  ( F `  x )  =  ( F `  B ) )
4 opeq12 3572 . . . . . . 7  |-  ( ( x  =  B  /\  ( F `  x )  =  ( F `  B ) )  ->  <. x ,  ( F `
 x ) >.  =  <. B ,  ( F `  B )
>. )
53, 4mpdan 412 . . . . . 6  |-  ( x  =  B  ->  <. x ,  ( F `  x ) >.  =  <. B ,  ( F `  B ) >. )
65sneqd 3411 . . . . 5  |-  ( x  =  B  ->  { <. x ,  ( F `  x ) >. }  =  { <. B ,  ( F `  B )
>. } )
72, 6eqeq12d 2095 . . . 4  |-  ( x  =  B  ->  (
( F  |`  { x } )  =  { <. x ,  ( F `
 x ) >. } 
<->  ( F  |`  { B } )  =  { <. B ,  ( F `
 B ) >. } ) )
87imbi2d 228 . . 3  |-  ( x  =  B  ->  (
( F  Fn  A  ->  ( F  |`  { x } )  =  { <. x ,  ( F `
 x ) >. } )  <->  ( F  Fn  A  ->  ( F  |`  { B } )  =  { <. B , 
( F `  B
) >. } ) ) )
9 vex 2604 . . . . . . 7  |-  x  e. 
_V
109snss 3516 . . . . . 6  |-  ( x  e.  A  <->  { x }  C_  A )
11 fnssres 5032 . . . . . 6  |-  ( ( F  Fn  A  /\  { x }  C_  A
)  ->  ( F  |` 
{ x } )  Fn  { x }
)
1210, 11sylan2b 281 . . . . 5  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( F  |`  { x } )  Fn  {
x } )
13 dffn2 5067 . . . . . . 7  |-  ( ( F  |`  { x } )  Fn  {
x }  <->  ( F  |` 
{ x } ) : { x } --> _V )
149fsn2 5358 . . . . . . 7  |-  ( ( F  |`  { x } ) : {
x } --> _V  <->  ( (
( F  |`  { x } ) `  x
)  e.  _V  /\  ( F  |`  { x } )  =  { <. x ,  ( ( F  |`  { x } ) `  x
) >. } ) )
1513, 14bitri 182 . . . . . 6  |-  ( ( F  |`  { x } )  Fn  {
x }  <->  ( (
( F  |`  { x } ) `  x
)  e.  _V  /\  ( F  |`  { x } )  =  { <. x ,  ( ( F  |`  { x } ) `  x
) >. } ) )
16 vsnid 3426 . . . . . . . . . . 11  |-  x  e. 
{ x }
17 fvres 5219 . . . . . . . . . . 11  |-  ( x  e.  { x }  ->  ( ( F  |`  { x } ) `
 x )  =  ( F `  x
) )
1816, 17ax-mp 7 . . . . . . . . . 10  |-  ( ( F  |`  { x } ) `  x
)  =  ( F `
 x )
1918opeq2i 3574 . . . . . . . . 9  |-  <. x ,  ( ( F  |`  { x } ) `
 x ) >.  =  <. x ,  ( F `  x )
>.
2019sneqi 3410 . . . . . . . 8  |-  { <. x ,  ( ( F  |`  { x } ) `
 x ) >. }  =  { <. x ,  ( F `  x ) >. }
2120eqeq2i 2091 . . . . . . 7  |-  ( ( F  |`  { x } )  =  { <. x ,  ( ( F  |`  { x } ) `  x
) >. }  <->  ( F  |` 
{ x } )  =  { <. x ,  ( F `  x ) >. } )
22 snssi 3529 . . . . . . . . . 10  |-  ( x  e.  A  ->  { x }  C_  A )
2322, 11sylan2 280 . . . . . . . . 9  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( F  |`  { x } )  Fn  {
x } )
24 funfvex 5212 . . . . . . . . . 10  |-  ( ( Fun  ( F  |`  { x } )  /\  x  e.  dom  ( F  |`  { x } ) )  -> 
( ( F  |`  { x } ) `
 x )  e. 
_V )
2524funfni 5019 . . . . . . . . 9  |-  ( ( ( F  |`  { x } )  Fn  {
x }  /\  x  e.  { x } )  ->  ( ( F  |`  { x } ) `
 x )  e. 
_V )
2623, 16, 25sylancl 404 . . . . . . . 8  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( ( F  |`  { x } ) `
 x )  e. 
_V )
2726biantrurd 299 . . . . . . 7  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( ( F  |`  { x } )  =  { <. x ,  ( ( F  |`  { x } ) `
 x ) >. } 
<->  ( ( ( F  |`  { x } ) `
 x )  e. 
_V  /\  ( F  |` 
{ x } )  =  { <. x ,  ( ( F  |`  { x } ) `
 x ) >. } ) ) )
2821, 27syl5rbbr 193 . . . . . 6  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( ( ( ( F  |`  { x } ) `  x
)  e.  _V  /\  ( F  |`  { x } )  =  { <. x ,  ( ( F  |`  { x } ) `  x
) >. } )  <->  ( F  |` 
{ x } )  =  { <. x ,  ( F `  x ) >. } ) )
2915, 28syl5bb 190 . . . . 5  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( ( F  |`  { x } )  Fn  { x }  <->  ( F  |`  { x } )  =  { <. x ,  ( F `
 x ) >. } ) )
3012, 29mpbid 145 . . . 4  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( F  |`  { x } )  =  { <. x ,  ( F `
 x ) >. } )
3130expcom 114 . . 3  |-  ( x  e.  A  ->  ( F  Fn  A  ->  ( F  |`  { x } )  =  { <. x ,  ( F `
 x ) >. } ) )
328, 31vtoclga 2664 . 2  |-  ( B  e.  A  ->  ( F  Fn  A  ->  ( F  |`  { B } )  =  { <. B ,  ( F `
 B ) >. } ) )
3332impcom 123 1  |-  ( ( F  Fn  A  /\  B  e.  A )  ->  ( F  |`  { B } )  =  { <. B ,  ( F `
 B ) >. } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    = wceq 1284    e. wcel 1433   _Vcvv 2601    C_ wss 2973   {csn 3398   <.cop 3401    |` cres 4365    Fn wfn 4917   -->wf 4918   ` cfv 4922
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-reu 2355  df-v 2603  df-sbc 2816  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-opab 3840  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-f1o 4929  df-fv 4930
This theorem is referenced by:  fressnfv  5371  dif1en  6364  fnfi  6388  fseq1p1m1  9111
  Copyright terms: Public domain W3C validator