Theorem setsslnid 12382

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

Step	Hyp	Ref	Expression
1		setsslnid.d	. . . . 5 |- D e. NN
2		setsresg 12369	. . . . 5 |- ( ( W e. A /\ D e. NN /\ C e. V ) -> ( ( W sSet <. D , C >. ) |` ( _V \ { D } ) ) = ( W |` ( _V \ { D } ) ) )
3	1, 2	mp3an2 1314	. . . 4 |- ( ( W e. A /\ C e. V ) -> ( ( W sSet <. D , C >. ) |` ( _V \ { D } ) ) = ( W |` ( _V \ { D } ) ) )
4	3	fveq1d 5482	. . 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 )
6	5	simpri 112	. . . . . 6 |- ( E ` ndx ) e. NN
7	6	elexi 2733	. . . . 5 |- ( E ` ndx ) e. _V
8		setsslnid.n	. . . . 5 |- ( E ` ndx ) =/= D
9		eldifsn 3697	. . . . 5 |- ( ( E ` ndx ) e. ( _V \ { D } ) <-> ( ( E ` ndx ) e. _V /\ ( E ` ndx ) =/= D ) )
10	7, 8, 9	mpbir2an 931	. . . 4 |- ( E ` ndx ) e. ( _V \ { D } )
11		fvres 5504	. . . 4 |- ( ( E ` ndx ) e. ( _V \ { D } ) -> ( ( ( W sSet <. D , C >. ) |` ( _V \ { D } ) ) ` ( E ` ndx ) ) = ( ( W sSet <. D , C >. ) ` ( E ` ndx ) ) )
12	10, 11	ax-mp 5	. . 3 |- ( ( ( W sSet <. D , C >. ) |` ( _V \ { D } ) ) ` ( E ` ndx ) ) = ( ( W sSet <. D , C >. ) ` ( E ` ndx ) )
13		fvres 5504	. . . 4 |- ( ( E ` ndx ) e. ( _V \ { D } ) -> ( ( W |` ( _V \ { D } ) ) ` ( E ` ndx ) ) = ( W ` ( E ` ndx ) ) )
14	10, 13	ax-mp 5	. . 3 |- ( ( W |` ( _V \ { D } ) ) ` ( E ` ndx ) ) = ( W ` ( E ` ndx ) )
15	4, 12, 14	3eqtr3g 2220	. 2 |- ( ( W e. A /\ C e. V ) -> ( ( W sSet <. D , C >. ) ` ( E ` ndx ) ) = ( W ` ( E ` ndx ) ) )
16	5	simpli 110	. . 3 |- E = Slot ( E ` ndx )
17		setsex 12363	. . . 4 |- ( ( W e. A /\ D e. NN /\ C e. V ) -> ( W sSet <. D , C >. ) e. _V )
18	1, 17	mp3an2 1314	. . 3 |- ( ( W e. A /\ C e. V ) -> ( W sSet <. D , C >. ) e. _V )
19	6	a1i 9	. . 3 |- ( ( W e. A /\ C e. V ) -> ( E ` ndx ) e. NN )
20	16, 18, 19	strnfvnd 12351	. 2 |- ( ( W e. A /\ C e. V ) -> ( E ` ( W sSet <. D , C >. ) ) = ( ( W sSet <. D , C >. ) ` ( E ` ndx ) ) )
21		simpl 108	. . 3 |- ( ( W e. A /\ C e. V ) -> W e. A )
22	16, 21, 19	strnfvnd 12351	. 2 |- ( ( W e. A /\ C e. V ) -> ( E ` W ) = ( W ` ( E ` ndx ) ) )
23	15, 20, 22	3eqtr4rd 2208	1 |- ( ( W e. A /\ C e. V ) -> ( E ` W ) = ( E ` ( W sSet <. D , C >. ) ) )

Syntax hints:   -> wi 4   /\ wa 103   = wceq 1342   e. wcel 2135   =/= wne 2334   _Vcvv 2721   \ cdif 3108   {csn 3570   <.cop 3573   |` cres 4600   ` cfv 5182  (class class class)co 5836   NNcn 8848   ndxcnx 12328   sSet csts 12329  Slot cslot 12330

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-bndl 1496  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-i5r 1522  ax-13 2137  ax-14 2138  ax-ext 2146  ax-sep 4094  ax-pow 4147  ax-pr 4181  ax-un 4405  ax-setind 4508

This theorem depends on definitions:  df-bi 116  df-3an 969  df-tru 1345  df-fal 1348  df-nf 1448  df-sb 1750  df-eu 2016  df-mo 2017  df-clab 2151  df-cleq 2157  df-clel 2160  df-nfc 2295  df-ne 2335  df-ral 2447  df-rex 2448  df-rab 2451  df-v 2723  df-sbc 2947  df-dif 3113  df-un 3115  df-in 3117  df-ss 3124  df-nul 3405  df-pw 3555  df-sn 3576  df-pr 3577  df-op 3579  df-uni 3784  df-br 3977  df-opab 4038  df-mpt 4039  df-id 4265  df-xp 4604  df-rel 4605  df-cnv 4606  df-co 4607  df-dm 4608  df-rn 4609  df-res 4610  df-iota 5147  df-fun 5184  df-fv 5190  df-ov 5839  df-oprab 5840  df-mpo 5841  df-slot 12335  df-sets 12338

This theorem is referenced by:  setsmsbasg  13020  setsmsdsg  13021