Theorem sraipg 14010

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 12840	. . . . . . 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 12746	. . . . . . . 8 |- Base Fn _V
6	1	elexd 2776	. . . . . . . 8 |- ( ph -> W e. _V )
7		funfvex 5576	. . . . . . . . 9 |- ( ( Fun Base /\ W e. dom Base ) -> ( Base ` W ) e. _V )
8	7	funfni 5359	. . . . . . . 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 4174	. . . . . 6 |- ( ph -> S e. _V )
12		ressex 12753	. . . . . 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 12720	. . . . 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 1249	. . . 4 |- ( ph -> ( W sSet <. (Scalar ` ndx ) , ( W ↾s S ) >. ) e. _V )
16		vscaslid 12850	. . . . . 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 12819	. . . . . 6 |- ( .r = Slot ( .r ` ndx ) /\ ( .r ` ndx ) e. NN )
20	19	slotex 12715	. . . . 5 |- ( W e. X -> ( .r ` W ) e. _V )
21	1, 20	syl 14	. . . 4 |- ( ph -> ( .r ` W ) e. _V )
22		setsex 12720	. . . 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 1249	. . 3 |- ( ph -> ( ( W sSet <. (Scalar ` ndx ) , ( W ↾s S ) >. ) sSet <. ( .s ` ndx ) , ( .r ` W ) >. ) e. _V )
24		ipslid 12858	. . . 4 |- ( .i = Slot ( .i ` ndx ) /\ ( .i ` ndx ) e. NN )
25	24	setsslid 12739	. . 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 14003	. . . . 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 2229	. . 3 |- ( ph -> A = ( ( ( W sSet <. (Scalar ` ndx ) , ( W ↾s S ) >. ) sSet <. ( .s ` ndx ) , ( .r ` W ) >. ) sSet <. ( .i ` ndx ) , ( .r ` W ) >. ) )
31	30	fveq2d 5563	. 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 2232	1 |- ( ph -> ( .r ` W ) = ( .i ` A ) )

Syntax hints:   -> wi 4   = wceq 1364   e. wcel 2167   _Vcvv 2763   C_ wss 3157   <.cop 3626   Fn wfn 5254   ` cfv 5259  (class class class)co 5923   NNcn 8992   ndxcnx 12685   sSet csts 12686  Slot cslot 12687   Basecbs 12688   ↾_s cress 12689   .rcmulr 12766  Scalarcsca 12768   .scvsca 12769   .icip 12770  subringAlg csra 13999

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-coll 4149  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7972  ax-resscn 7973  ax-1re 7975  ax-addrcl 7978

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-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  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-iun 3919  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-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-ov 5926  df-oprab 5927  df-mpo 5928  df-inn 8993  df-2 9051  df-3 9052  df-4 9053  df-5 9054  df-6 9055  df-7 9056  df-8 9057  df-ndx 12691  df-slot 12692  df-base 12694  df-sets 12695  df-iress 12696  df-mulr 12779  df-sca 12781  df-vsca 12782  df-ip 12783  df-sra 14001

This theorem is referenced by: (None)