Theorem sraipg 14540

Description: The inner product operation of a subring algebra. (Contributed by Thierry Arnoux, 16-Jun-2019.)

Hypotheses

Ref	Expression
srapart.a	|- ( ph -> A = ( (subringAlg ` W ) ` S ) )
srapart.s	|- ( ph -> S C_ ( Base ` W ) )
srapart.ex	|- ( ph -> W e. X )

Assertion

Ref	Expression
sraipg	|- ( ph -> ( .r ` W ) = ( .i ` A ) )

Proof of Theorem sraipg

Step	Hyp	Ref	Expression
1		srapart.ex	. . . . 5 |- ( ph -> W e. X )
2		scaslid 13316	. . . . . . 7 |- (Scalar = Slot (Scalar ` ndx ) /\ (Scalar ` ndx ) e. NN )
3	2	simpri 113	. . . . . 6 |- (Scalar ` ndx ) e. NN
4	3	a1i 9	. . . . 5 |- ( ph -> (Scalar ` ndx ) e. NN )
5		basfn 13221	. . . . . . . 8 |- Base Fn _V
6	1	elexd 2817	. . . . . . . 8 |- ( ph -> W e. _V )
7		funfvex 5665	. . . . . . . . 9 |- ( ( Fun Base /\ W e. dom Base ) -> ( Base ` W ) e. _V )
8	7	funfni 5439	. . . . . . . 8 |- ( ( Base Fn _V /\ W e. _V ) -> ( Base ` W ) e. _V )
9	5, 6, 8	sylancr 414	. . . . . . 7 |- ( ph -> ( Base ` W ) e. _V )
10		srapart.s	. . . . . . 7 |- ( ph -> S C_ ( Base ` W ) )
11	9, 10	ssexd 4234	. . . . . 6 |- ( ph -> S e. _V )
12		ressex 13228	. . . . . 6 |- ( ( W e. X /\ S e. _V ) -> ( W ↾s S ) e. _V )
13	1, 11, 12	syl2anc 411	. . . . 5 |- ( ph -> ( W ↾s S ) e. _V )
14		setsex 13194	. . . . 5 |- ( ( W e. X /\ (Scalar ` ndx ) e. NN /\ ( W ↾s S ) e. _V ) -> ( W sSet <. (Scalar ` ndx ) , ( W ↾s S ) >. ) e. _V )
15	1, 4, 13, 14	syl3anc 1274	. . . 4 |- ( ph -> ( W sSet <. (Scalar ` ndx ) , ( W ↾s S ) >. ) e. _V )
16		vscaslid 13326	. . . . . 6 |- ( .s = Slot ( .s ` ndx ) /\ ( .s ` ndx ) e. NN )
17	16	simpri 113	. . . . 5 |- ( .s ` ndx ) e. NN
18	17	a1i 9	. . . 4 |- ( ph -> ( .s ` ndx ) e. NN )
19		mulrslid 13295	. . . . . 6 |- ( .r = Slot ( .r ` ndx ) /\ ( .r ` ndx ) e. NN )
20	19	slotex 13189	. . . . 5 |- ( W e. X -> ( .r ` W ) e. _V )
21	1, 20	syl 14	. . . 4 |- ( ph -> ( .r ` W ) e. _V )
22		setsex 13194	. . . 4 |- ( ( ( W sSet <. (Scalar ` ndx ) , ( W ↾s S ) >. ) e. _V /\ ( .s ` ndx ) e. NN /\ ( .r ` W ) e. _V ) -> ( ( W sSet <. (Scalar ` ndx ) , ( W ↾s S ) >. ) sSet <. ( .s ` ndx ) , ( .r ` W ) >. ) e. _V )
23	15, 18, 21, 22	syl3anc 1274	. . 3 |- ( ph -> ( ( W sSet <. (Scalar ` ndx ) , ( W ↾s S ) >. ) sSet <. ( .s ` ndx ) , ( .r ` W ) >. ) e. _V )
24		ipslid 13334	. . . 4 |- ( .i = Slot ( .i ` ndx ) /\ ( .i ` ndx ) e. NN )
25	24	setsslid 13213	. . 3 |- ( ( ( ( W sSet <. (Scalar ` ndx ) , ( W ↾s S ) >. ) sSet <. ( .s ` ndx ) , ( .r ` W ) >. ) e. _V /\ ( .r ` W ) e. _V ) -> ( .r ` W ) = ( .i ` ( ( ( W sSet <. (Scalar ` ndx ) , ( W ↾s S ) >. ) sSet <. ( .s ` ndx ) , ( .r ` W ) >. ) sSet <. ( .i ` ndx ) , ( .r ` W ) >. ) ) )
26	23, 21, 25	syl2anc 411	. 2 |- ( ph -> ( .r ` W ) = ( .i ` ( ( ( W sSet <. (Scalar ` ndx ) , ( W ↾s S ) >. ) sSet <. ( .s ` ndx ) , ( .r ` W ) >. ) sSet <. ( .i ` ndx ) , ( .r ` W ) >. ) ) )
27		srapart.a	. . . 4 |- ( ph -> A = ( (subringAlg ` W ) ` S ) )
28		sraval 14533	. . . . 5 |- ( ( W e. _V /\ S C_ ( Base ` W ) ) -> ( (subringAlg ` W ) ` S ) = ( ( ( W sSet <. (Scalar ` ndx ) , ( W ↾s S ) >. ) sSet <. ( .s ` ndx ) , ( .r ` W ) >. ) sSet <. ( .i ` ndx ) , ( .r ` W ) >. ) )
29	6, 10, 28	syl2anc 411	. . . 4 |- ( ph -> ( (subringAlg ` W ) ` S ) = ( ( ( W sSet <. (Scalar ` ndx ) , ( W ↾s S ) >. ) sSet <. ( .s ` ndx ) , ( .r ` W ) >. ) sSet <. ( .i ` ndx ) , ( .r ` W ) >. ) )
30	27, 29	eqtrd 2264	. . 3 |- ( ph -> A = ( ( ( W sSet <. (Scalar ` ndx ) , ( W ↾s S ) >. ) sSet <. ( .s ` ndx ) , ( .r ` W ) >. ) sSet <. ( .i ` ndx ) , ( .r ` W ) >. ) )
31	30	fveq2d 5652	. 2 |- ( ph -> ( .i ` A ) = ( .i ` ( ( ( W sSet <. (Scalar ` ndx ) , ( W ↾s S ) >. ) sSet <. ( .s ` ndx ) , ( .r ` W ) >. ) sSet <. ( .i ` ndx ) , ( .r ` W ) >. ) ) )
32	26, 31	eqtr4d 2267	1 |- ( ph -> ( .r ` W ) = ( .i ` A ) )

Syntax hints:   -> wi 4   = wceq 1398   e. wcel 2202   _Vcvv 2803   C_ wss 3201   <.cop 3676   Fn wfn 5328   ` cfv 5333  (class class class)co 6028   NNcn 9202   ndxcnx 13159   sSet csts 13160  Slot cslot 13161   Basecbs 13162   ↾_s cress 13163   .rcmulr 13241  Scalarcsca 13243   .scvsca 13244   .icip 13245  subringAlg csra 14529

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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8183  ax-resscn 8184  ax-1re 8186  ax-addrcl 8189

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-inn 9203  df-2 9261  df-3 9262  df-4 9263  df-5 9264  df-6 9265  df-7 9266  df-8 9267  df-ndx 13165  df-slot 13166  df-base 13168  df-sets 13169  df-iress 13170  df-mulr 13254  df-sca 13256  df-vsca 13257  df-ip 13258  df-sra 14531

This theorem is referenced by: (None)