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

Theorem setsslnid 13152
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 13138 . . . . 5  |-  ( ( W  e.  A  /\  D  e.  NN  /\  C  e.  V )  ->  (
( W sSet  <. D ,  C >. )  |`  ( _V  \  { D }
) )  =  ( W  |`  ( _V  \  { D } ) ) )
31, 2mp3an2 1361 . . . 4  |-  ( ( W  e.  A  /\  C  e.  V )  ->  ( ( W sSet  <. D ,  C >. )  |`  ( _V  \  { D } ) )  =  ( W  |`  ( _V  \  { D }
) ) )
43fveq1d 5641 . . 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 2815 . . . . 5  |-  ( E `
 ndx )  e. 
_V
8 setsslnid.n . . . . 5  |-  ( E `
 ndx )  =/= 
D
9 eldifsn 3800 . . . . 5  |-  ( ( E `  ndx )  e.  ( _V  \  { D } )  <->  ( ( E `  ndx )  e. 
_V  /\  ( E `  ndx )  =/=  D
) )
107, 8, 9mpbir2an 950 . . . 4  |-  ( E `
 ndx )  e.  ( _V  \  { D } )
11 fvres 5663 . . . 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 5663 . . . 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 13132 . . . 4  |-  ( ( W  e.  A  /\  D  e.  NN  /\  C  e.  V )  ->  ( W sSet  <. D ,  C >. )  e.  _V )
181, 17mp3an2 1361 . . 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 13120 . 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 13120 . 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 1397    e. wcel 2202    =/= wne 2402   _Vcvv 2802    \ cdif 3197   {csn 3669   <.cop 3672    |` cres 4727   ` cfv 5326  (class class class)co 6018   NNcn 9143   ndxcnx 13097   sSet csts 13098  Slot cslot 13099
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-iota 5286  df-fun 5328  df-fv 5334  df-ov 6021  df-oprab 6022  df-mpo 6023  df-slot 13104  df-sets 13107
This theorem is referenced by:  resseqnbasd  13174  mgpbasg  13958  mgpscag  13959  mgptsetg  13960  mgpdsg  13962  opprsllem  14106  rmodislmod  14384  sralemg  14471  srascag  14475  sravscag  14476  zlmlemg  14661  zlmsca  14665  znbaslemnn  14672  setsmsbasg  15222  setsmsdsg  15223  setsvtx  15921
  Copyright terms: Public domain W3C validator