Theorem sraipg 14321

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 13100	. . . . . . 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 13005	. . . . . . . 8 |- Base Fn _V
6	1	elexd 2790	. . . . . . . 8 |- ( ph -> W e. _V )
7		funfvex 5616	. . . . . . . . 9 |- ( ( Fun Base /\ W e. dom Base ) -> ( Base ` W ) e. _V )
8	7	funfni 5395	. . . . . . . 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 4200	. . . . . 6 |- ( ph -> S e. _V )
12		ressex 13012	. . . . . 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 12979	. . . . 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 1250	. . . 4 |- ( ph -> ( W sSet <. (Scalar ` ndx ) , ( W ↾s S ) >. ) e. _V )
16		vscaslid 13110	. . . . . 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 13079	. . . . . 6 |- ( .r = Slot ( .r ` ndx ) /\ ( .r ` ndx ) e. NN )
20	19	slotex 12974	. . . . 5 |- ( W e. X -> ( .r ` W ) e. _V )
21	1, 20	syl 14	. . . 4 |- ( ph -> ( .r ` W ) e. _V )
22		setsex 12979	. . . 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 1250	. . 3 |- ( ph -> ( ( W sSet <. (Scalar ` ndx ) , ( W ↾s S ) >. ) sSet <. ( .s ` ndx ) , ( .r ` W ) >. ) e. _V )
24		ipslid 13118	. . . 4 |- ( .i = Slot ( .i ` ndx ) /\ ( .i ` ndx ) e. NN )
25	24	setsslid 12998	. . 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 14314	. . . . 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 2240	. . 3 |- ( ph -> A = ( ( ( W sSet <. (Scalar ` ndx ) , ( W ↾s S ) >. ) sSet <. ( .s ` ndx ) , ( .r ` W ) >. ) sSet <. ( .i ` ndx ) , ( .r ` W ) >. ) )
31	30	fveq2d 5603	. 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 2243	1 |- ( ph -> ( .r ` W ) = ( .i ` A ) )

Syntax hints:   -> wi 4   = wceq 1373   e. wcel 2178   _Vcvv 2776   C_ wss 3174   <.cop 3646   Fn wfn 5285   ` cfv 5290  (class class class)co 5967   NNcn 9071   ndxcnx 12944   sSet csts 12945  Slot cslot 12946   Basecbs 12947   ↾_s cress 12948   .rcmulr 13025  Scalarcsca 13027   .scvsca 13028   .icip 13029  subringAlg csra 14310

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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-coll 4175  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-cnex 8051  ax-resscn 8052  ax-1re 8054  ax-addrcl 8057

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-ral 2491  df-rex 2492  df-reu 2493  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-nul 3469  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-int 3900  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-ov 5970  df-oprab 5971  df-mpo 5972  df-inn 9072  df-2 9130  df-3 9131  df-4 9132  df-5 9133  df-6 9134  df-7 9135  df-8 9136  df-ndx 12950  df-slot 12951  df-base 12953  df-sets 12954  df-iress 12955  df-mulr 13038  df-sca 13040  df-vsca 13041  df-ip 13042  df-sra 14312

This theorem is referenced by: (None)