Theorem resseqnbasd 13370

Description: The components of an extensible structure except the base set remain unchanged on a structure restriction. (Contributed by Mario Carneiro, 26-Nov-2014.) (Revised by Mario Carneiro, 2-Dec-2014.) (Revised by AV, 19-Oct-2024.)

Hypotheses

Ref	Expression
resseqnbas.r	|- R = ( W ↾s A )
resseqnbas.e	|- C = ( E ` W )
resseqnbasd.f	|- ( E = Slot ( E ` ndx ) /\ ( E ` ndx ) e. NN )
resseqnbas.n	|- ( E ` ndx ) =/= ( Base ` ndx )
resseqnbasd.w	|- ( ph -> W e. X )
resseqnbasd.a	|- ( ph -> A e. V )

Assertion

Ref	Expression
resseqnbasd	|- ( ph -> C = ( E ` R ) )

Proof of Theorem resseqnbasd

Step	Hyp	Ref	Expression
1		resseqnbas.e	. 2 |- C = ( E ` W )
2		resseqnbas.r	. . . . 5 |- R = ( W ↾s A )
3		resseqnbasd.w	. . . . . 6 |- ( ph -> W e. X )
4		resseqnbasd.a	. . . . . 6 |- ( ph -> A e. V )
5		ressvalsets 13361	. . . . . 6 |- ( ( W e. X /\ A e. V ) -> ( W ↾s A ) = ( W sSet <. ( Base ` ndx ) , ( A i^i ( Base ` W ) ) >. ) )
6	3, 4, 5	syl2anc 411	. . . . 5 |- ( ph -> ( W ↾s A ) = ( W sSet <. ( Base ` ndx ) , ( A i^i ( Base ` W ) ) >. ) )
7	2, 6	eqtrid 2279	. . . 4 |- ( ph -> R = ( W sSet <. ( Base ` ndx ) , ( A i^i ( Base ` W ) ) >. ) )
8	7	fveq2d 5679	. . 3 |- ( ph -> ( E ` R ) = ( E ` ( W sSet <. ( Base ` ndx ) , ( A i^i ( Base ` W ) ) >. ) ) )
9		inex1g 4251	. . . . 5 |- ( A e. V -> ( A i^i ( Base ` W ) ) e. _V )
10	4, 9	syl 14	. . . 4 |- ( ph -> ( A i^i ( Base ` W ) ) e. _V )
11		resseqnbasd.f	. . . . 5 |- ( E = Slot ( E ` ndx ) /\ ( E ` ndx ) e. NN )
12		resseqnbas.n	. . . . 5 |- ( E ` ndx ) =/= ( Base ` ndx )
13		basendxnn 13352	. . . . 5 |- ( Base ` ndx ) e. NN
14	11, 12, 13	setsslnid 13348	. . . 4 |- ( ( W e. X /\ ( A i^i ( Base ` W ) ) e. _V ) -> ( E ` W ) = ( E ` ( W sSet <. ( Base ` ndx ) , ( A i^i ( Base ` W ) ) >. ) ) )
15	3, 10, 14	syl2anc 411	. . 3 |- ( ph -> ( E ` W ) = ( E ` ( W sSet <. ( Base ` ndx ) , ( A i^i ( Base ` W ) ) >. ) ) )
16	8, 15	eqtr4d 2270	. 2 |- ( ph -> ( E ` R ) = ( E ` W ) )
17	1, 16	eqtr4id 2286	1 |- ( ph -> C = ( E ` R ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1398   e. wcel 2205   =/= wne 2414   _Vcvv 2815   i^i cin 3213   <.cop 3697   ` cfv 5357  (class class class)co 6058   NNcn 9254   ndxcnx 13293   sSet csts 13294  Slot cslot 13295   Basecbs 13296   ↾_s cress 13297

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 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1re 8237  ax-addrcl 8240

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-iota 5317  df-fun 5359  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-inn 9255  df-ndx 13299  df-slot 13300  df-base 13302  df-sets 13303  df-iress 13304

This theorem is referenced by:  ressplusgd  13426  ressmulrg  13442  ressscag  13480  ressvscag  13481  ressipg  13482