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

Theorem setsslnid 13197
Description: Value of the structure replacement function at an untouched index. (Contributed by Mario Carneiro, 1-Dec-2014.) (Revised by Jim Kingdon, 24-Jan-2023.)
Hypotheses
Ref Expression
setsslid.e  |-  ( E  = Slot  ( E `  ndx )  /\  ( E `  ndx )  e.  NN )
setsslnid.n  |-  ( E `
 ndx )  =/= 
D
setsslnid.d  |-  D  e.  NN
Assertion
Ref Expression
setsslnid  |-  ( ( W  e.  A  /\  C  e.  V )  ->  ( E `  W
)  =  ( E `
 ( W sSet  <. D ,  C >. )
) )

Proof of Theorem setsslnid
StepHypRef Expression
1 setsslnid.d . . . . 5  |-  D  e.  NN
2 setsresg 13183 . . . . 5  |-  ( ( W  e.  A  /\  D  e.  NN  /\  C  e.  V )  ->  (
( W sSet  <. D ,  C >. )  |`  ( _V  \  { D }
) )  =  ( W  |`  ( _V  \  { D } ) ) )
31, 2mp3an2 1362 . . . 4  |-  ( ( W  e.  A  /\  C  e.  V )  ->  ( ( W sSet  <. D ,  C >. )  |`  ( _V  \  { D } ) )  =  ( W  |`  ( _V  \  { D }
) ) )
43fveq1d 5650 . . 3  |-  ( ( W  e.  A  /\  C  e.  V )  ->  ( ( ( W sSet  <. D ,  C >. )  |`  ( _V  \  { D } ) ) `  ( E `  ndx )
)  =  ( ( W  |`  ( _V  \  { D } ) ) `  ( E `
 ndx ) ) )
5 setsslid.e . . . . . . 7  |-  ( E  = Slot  ( E `  ndx )  /\  ( E `  ndx )  e.  NN )
65simpri 113 . . . . . 6  |-  ( E `
 ndx )  e.  NN
76elexi 2816 . . . . 5  |-  ( E `
 ndx )  e. 
_V
8 setsslnid.n . . . . 5  |-  ( E `
 ndx )  =/= 
D
9 eldifsn 3804 . . . . 5  |-  ( ( E `  ndx )  e.  ( _V  \  { D } )  <->  ( ( E `  ndx )  e. 
_V  /\  ( E `  ndx )  =/=  D
) )
107, 8, 9mpbir2an 951 . . . 4  |-  ( E `
 ndx )  e.  ( _V  \  { D } )
11 fvres 5672 . . . 4  |-  ( ( E `  ndx )  e.  ( _V  \  { D } )  ->  (
( ( W sSet  <. D ,  C >. )  |`  ( _V  \  { D } ) ) `  ( E `  ndx )
)  =  ( ( W sSet  <. D ,  C >. ) `  ( E `
 ndx ) ) )
1210, 11ax-mp 5 . . 3  |-  ( ( ( W sSet  <. D ,  C >. )  |`  ( _V  \  { D }
) ) `  ( E `  ndx ) )  =  ( ( W sSet  <. D ,  C >. ) `
 ( E `  ndx ) )
13 fvres 5672 . . . 4  |-  ( ( E `  ndx )  e.  ( _V  \  { D } )  ->  (
( W  |`  ( _V  \  { D }
) ) `  ( E `  ndx ) )  =  ( W `  ( E `  ndx )
) )
1410, 13ax-mp 5 . . 3  |-  ( ( W  |`  ( _V  \  { D } ) ) `  ( E `
 ndx ) )  =  ( W `  ( E `  ndx )
)
154, 12, 143eqtr3g 2287 . 2  |-  ( ( W  e.  A  /\  C  e.  V )  ->  ( ( W sSet  <. D ,  C >. ) `  ( E `  ndx ) )  =  ( W `  ( E `
 ndx ) ) )
165simpli 111 . . 3  |-  E  = Slot  ( E `  ndx )
17 setsex 13177 . . . 4  |-  ( ( W  e.  A  /\  D  e.  NN  /\  C  e.  V )  ->  ( W sSet  <. D ,  C >. )  e.  _V )
181, 17mp3an2 1362 . . 3  |-  ( ( W  e.  A  /\  C  e.  V )  ->  ( W sSet  <. D ,  C >. )  e.  _V )
196a1i 9 . . 3  |-  ( ( W  e.  A  /\  C  e.  V )  ->  ( E `  ndx )  e.  NN )
2016, 18, 19strnfvnd 13165 . 2  |-  ( ( W  e.  A  /\  C  e.  V )  ->  ( E `  ( W sSet  <. D ,  C >. ) )  =  ( ( W sSet  <. D ,  C >. ) `  ( E `  ndx ) ) )
21 simpl 109 . . 3  |-  ( ( W  e.  A  /\  C  e.  V )  ->  W  e.  A )
2216, 21, 19strnfvnd 13165 . 2  |-  ( ( W  e.  A  /\  C  e.  V )  ->  ( E `  W
)  =  ( W `
 ( E `  ndx ) ) )
2315, 20, 223eqtr4rd 2275 1  |-  ( ( W  e.  A  /\  C  e.  V )  ->  ( E `  W
)  =  ( E `
 ( W sSet  <. D ,  C >. )
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2202    =/= wne 2403   _Vcvv 2803    \ cdif 3198   {csn 3673   <.cop 3676    |` cres 4733   ` cfv 5333  (class class class)co 6028   NNcn 9185   ndxcnx 13142   sSet csts 13143  Slot cslot 13144
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-in1 619  ax-in2 620  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-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-iota 5293  df-fun 5335  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-slot 13149  df-sets 13152
This theorem is referenced by:  resseqnbasd  13219  mgpbasg  14003  mgpscag  14004  mgptsetg  14005  mgpdsg  14007  opprsllem  14151  rmodislmod  14430  sralemg  14517  srascag  14521  sravscag  14522  zlmlemg  14707  zlmsca  14711  znbaslemnn  14718  setsmsbasg  15273  setsmsdsg  15274  setsvtx  15975
  Copyright terms: Public domain W3C validator