Theorem ressbasd 13421

Description: Base set of a structure restriction. (Contributed by Stefan O'Rear, 26-Nov-2014.) (Proof shortened by AV, 7-Nov-2024.)

Hypotheses

Ref	Expression
ressbasd.r	|- ( ph -> R = ( W ↾s A ) )
ressbasd.b	|- ( ph -> B = ( Base ` W ) )
ressbasd.w	|- ( ph -> W e. X )
ressbasd.a	|- ( ph -> A e. V )

Assertion

Ref	Expression
ressbasd	|- ( ph -> ( A i^i B ) = ( Base ` R ) )

Proof of Theorem ressbasd

Step	Hyp	Ref	Expression
1		ressbasd.w	. . 3 |- ( ph -> W e. X )
2		ressbasd.a	. . . 4 |- ( ph -> A e. V )
3		inex1g 4269	. . . 4 |- ( A e. V -> ( A i^i ( Base ` W ) ) e. _V )
4	2, 3	syl 14	. . 3 |- ( ph -> ( A i^i ( Base ` W ) ) e. _V )
5		baseslid 13410	. . . 4 |- ( Base = Slot ( Base ` ndx ) /\ ( Base ` ndx ) e. NN )
6	5	setsslid 13403	. . 3 |- ( ( W e. X /\ ( A i^i ( Base ` W ) ) e. _V ) -> ( A i^i ( Base ` W ) ) = ( Base ` ( W sSet <. ( Base ` ndx ) , ( A i^i ( Base ` W ) ) >. ) ) )
7	1, 4, 6	syl2anc 415	. 2 |- ( ph -> ( A i^i ( Base ` W ) ) = ( Base ` ( W sSet <. ( Base ` ndx ) , ( A i^i ( Base ` W ) ) >. ) ) )
8		ressbasd.b	. . 3 |- ( ph -> B = ( Base ` W ) )
9	8	ineq2d 3432	. 2 |- ( ph -> ( A i^i B ) = ( A i^i ( Base ` W ) ) )
10		ressbasd.r	. . . 4 |- ( ph -> R = ( W ↾s A ) )
11		ressvalsets 13418	. . . . 5 |- ( ( W e. X /\ A e. V ) -> ( W ↾s A ) = ( W sSet <. ( Base ` ndx ) , ( A i^i ( Base ` W ) ) >. ) )
12	1, 2, 11	syl2anc 415	. . . 4 |- ( ph -> ( W ↾s A ) = ( W sSet <. ( Base ` ndx ) , ( A i^i ( Base ` W ) ) >. ) )
13	10, 12	eqtrd 2271	. . 3 |- ( ph -> R = ( W sSet <. ( Base ` ndx ) , ( A i^i ( Base ` W ) ) >. ) )
14	13	fveq2d 5699	. 2 |- ( ph -> ( Base ` R ) = ( Base ` ( W sSet <. ( Base ` ndx ) , ( A i^i ( Base ` W ) ) >. ) ) )
15	7, 9, 14	3eqtr4d 2281	1 |- ( ph -> ( A i^i B ) = ( Base ` R ) )

This proof depends on syntax axioms:   -> wi 4   = wceq 1402   e. wcel 2209   _Vcvv 2821   i^i cin 3219   <.cop 3712   ` cfv 5377  (class class class)co 6085   ndxcnx 13349   sSet csts 13350   Basecbs 13352   ↾_s cress 13353

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-inn 9305  df-ndx 13355  df-slot 13356  df-base 13358  df-sets 13359  df-iress 13360

This theorem is used by:  ressbas2d  13422  ressbasssd  13423  ressbasid  13424  ressressg  13429  grpressid  13866  opprsubgg  14390  subrngpropd  14524  subrgpropd  14561  sralmod  14787  lidlbas  14815