Theorem ressbasd 12770

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 4170	. . . 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 12760	. . . 4 |- ( Base = Slot ( Base ` ndx ) /\ ( Base ` ndx ) e. NN )
6	5	setsslid 12754	. . 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 411	. 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 3365	. 2 |- ( ph -> ( A i^i B ) = ( A i^i ( Base ` W ) ) )
10		ressbasd.r	. . . 4 |- ( ph -> R = ( W ↾s A ) )
11		ressvalsets 12767	. . . . 5 |- ( ( W e. X /\ A e. V ) -> ( W ↾s A ) = ( W sSet <. ( Base ` ndx ) , ( A i^i ( Base ` W ) ) >. ) )
12	1, 2, 11	syl2anc 411	. . . 4 |- ( ph -> ( W ↾s A ) = ( W sSet <. ( Base ` ndx ) , ( A i^i ( Base ` W ) ) >. ) )
13	10, 12	eqtrd 2229	. . 3 |- ( ph -> R = ( W sSet <. ( Base ` ndx ) , ( A i^i ( Base ` W ) ) >. ) )
14	13	fveq2d 5565	. 2 |- ( ph -> ( Base ` R ) = ( Base ` ( W sSet <. ( Base ` ndx ) , ( A i^i ( Base ` W ) ) >. ) ) )
15	7, 9, 14	3eqtr4d 2239	1 |- ( ph -> ( A i^i B ) = ( Base ` R ) )

Syntax hints:   -> wi 4   = wceq 1364   e. wcel 2167   _Vcvv 2763   i^i cin 3156   <.cop 3626   ` cfv 5259  (class class class)co 5925   ndxcnx 12700   sSet csts 12701   Basecbs 12703   ↾_s cress 12704

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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-1re 7990  ax-addrcl 7993

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-rab 2484  df-v 2765  df-sbc 2990  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-iota 5220  df-fun 5261  df-fv 5267  df-ov 5928  df-oprab 5929  df-mpo 5930  df-inn 9008  df-ndx 12706  df-slot 12707  df-base 12709  df-sets 12710  df-iress 12711

This theorem is referenced by:  ressbas2d  12771  ressbasssd  12772  ressbasid  12773  ressressg  12778  grpressid  13263  opprsubgg  13716  subrngpropd  13848  subrgpropd  13885  sralmod  14082  lidlbas  14110