Theorem setsslnid 12010

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 11997	. . . . 5 |- ( ( W e. A /\ D e. NN /\ C e. V ) -> ( ( W sSet <. D , C >. ) |` ( _V \ { D } ) ) = ( W |` ( _V \ { D } ) ) )
3	1, 2	mp3an2 1303	. . . 4 |- ( ( W e. A /\ C e. V ) -> ( ( W sSet <. D , C >. ) |` ( _V \ { D } ) ) = ( W |` ( _V \ { D } ) ) )
4	3	fveq1d 5423	. . 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 2698	. . . . 5 |- ( E ` ndx ) e. _V
8		setsslnid.n	. . . . 5 |- ( E ` ndx ) =/= D
9		eldifsn 3650	. . . . 5 |- ( ( E ` ndx ) e. ( _V \ { D } ) <-> ( ( E ` ndx ) e. _V /\ ( E ` ndx ) =/= D ) )
10	7, 8, 9	mpbir2an 926	. . . 4 |- ( E ` ndx ) e. ( _V \ { D } )
11		fvres 5445	. . . 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 5445	. . . 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 2195	. 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 11991	. . . 4 |- ( ( W e. A /\ D e. NN /\ C e. V ) -> ( W sSet <. D , C >. ) e. _V )
18	1, 17	mp3an2 1303	. . 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 11979	. 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 11979	. 2 |- ( ( W e. A /\ C e. V ) -> ( E ` W ) = ( W ` ( E ` ndx ) ) )
23	15, 20, 22	3eqtr4rd 2183	1 |- ( ( W e. A /\ C e. V ) -> ( E ` W ) = ( E ` ( W sSet <. D , C >. ) ) )

Syntax hints:   -> wi 4   /\ wa 103   = wceq 1331   e. wcel 1480   =/= wne 2308   _Vcvv 2686   \ cdif 3068   {csn 3527   <.cop 3530   |` cres 4541   ` cfv 5123  (class class class)co 5774   NNcn 8720   ndxcnx 11956   sSet csts 11957  Slot cslot 11958

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 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-ral 2421  df-rex 2422  df-rab 2425  df-v 2688  df-sbc 2910  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-iota 5088  df-fun 5125  df-fv 5131  df-ov 5777  df-oprab 5778  df-mpo 5779  df-slot 11963  df-sets 11966

This theorem is referenced by:  setsmsbasg  12648  setsmsdsg  12649