Theorem cpmadugsumlemB 22223

Description: Lemma B for cpmadugsum 22227. (Contributed by AV, 2-Nov-2019.)

Hypotheses

Ref	Expression
cpmadugsum.a	⊢ 𝐴 = (𝑁 Mat 𝑅)
cpmadugsum.b	⊢ 𝐵 = (Base‘𝐴)
cpmadugsum.p	⊢ 𝑃 = (Poly1‘𝑅)
cpmadugsum.y	⊢ 𝑌 = (𝑁 Mat 𝑃)
cpmadugsum.t	⊢ 𝑇 = (𝑁 matToPolyMat 𝑅)
cpmadugsum.x	⊢ 𝑋 = (var1‘𝑅)
cpmadugsum.e	⊢ ↑ = (.g‘(mulGrp‘𝑃))
cpmadugsum.m	⊢ · = ( ·𝑠 ‘𝑌)
cpmadugsum.r	⊢ × = (.r‘𝑌)
cpmadugsum.1	⊢ 1 = (1r‘𝑌)

Assertion

Ref	Expression
cpmadugsumlemB	⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → ((𝑋 · 1 ) × (𝑌 Σg (𝑖 ∈ (0...𝑠) ↦ ((𝑖 ↑ 𝑋) · (𝑇‘(𝑏‘𝑖)))))) = (𝑌 Σg (𝑖 ∈ (0...𝑠) ↦ (((𝑖 + 1) ↑ 𝑋) · (𝑇‘(𝑏‘𝑖))))))

Distinct variable groups:   𝐵,𝑖   𝑖,𝑀   𝑖,𝑁   𝑅,𝑖   𝑖,𝑋   𝑖,𝑌   × ,𝑖   · ,𝑖   1 ,𝑖   𝑖,𝑏   𝑖,𝑠

Allowed substitution hints:   𝐴(𝑖,𝑠,𝑏)   𝐵(𝑠,𝑏)   𝑃(𝑖,𝑠,𝑏)   𝑅(𝑠,𝑏)   𝑇(𝑖,𝑠,𝑏)   · (𝑠,𝑏)   × (𝑠,𝑏)   1 (𝑠,𝑏)   ↑ (𝑖,𝑠,𝑏)   𝑀(𝑠,𝑏)   𝑁(𝑠,𝑏)   𝑋(𝑠,𝑏)   𝑌(𝑠,𝑏)

Proof of Theorem cpmadugsumlemB

Step	Hyp	Ref	Expression
1		crngring 19976	. . . . . . . . . . . 12 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring)
2		cpmadugsum.p	. . . . . . . . . . . . 13 ⊢ 𝑃 = (Poly1‘𝑅)
3	2	ply1ring 21619	. . . . . . . . . . . 12 ⊢ (𝑅 ∈ Ring → 𝑃 ∈ Ring)
4	1, 3	syl 17	. . . . . . . . . . 11 ⊢ (𝑅 ∈ CRing → 𝑃 ∈ Ring)
5	4	3ad2ant2 1134	. . . . . . . . . 10 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → 𝑃 ∈ Ring)
6		eqid 2736	. . . . . . . . . . 11 ⊢ (mulGrp‘𝑃) = (mulGrp‘𝑃)
7	6	ringmgp 19970	. . . . . . . . . 10 ⊢ (𝑃 ∈ Ring → (mulGrp‘𝑃) ∈ Mnd)
8	5, 7	syl 17	. . . . . . . . 9 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (mulGrp‘𝑃) ∈ Mnd)
9	8	ad2antrr 724	. . . . . . . 8 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → (mulGrp‘𝑃) ∈ Mnd)
10		elfznn0 13534	. . . . . . . . 9 ⊢ (𝑖 ∈ (0...𝑠) → 𝑖 ∈ ℕ0)
11	10	adantl 482	. . . . . . . 8 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → 𝑖 ∈ ℕ0)
12		1nn0 12429	. . . . . . . . 9 ⊢ 1 ∈ ℕ0
13	12	a1i 11	. . . . . . . 8 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → 1 ∈ ℕ0)
14	1	3ad2ant2 1134	. . . . . . . . . 10 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → 𝑅 ∈ Ring)
15		cpmadugsum.x	. . . . . . . . . . 11 ⊢ 𝑋 = (var1‘𝑅)
16		eqid 2736	. . . . . . . . . . 11 ⊢ (Base‘𝑃) = (Base‘𝑃)
17	15, 2, 16	vr1cl 21588	. . . . . . . . . 10 ⊢ (𝑅 ∈ Ring → 𝑋 ∈ (Base‘𝑃))
18	14, 17	syl 17	. . . . . . . . 9 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → 𝑋 ∈ (Base‘𝑃))
19	18	ad2antrr 724	. . . . . . . 8 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → 𝑋 ∈ (Base‘𝑃))
20	6, 16	mgpbas 19902	. . . . . . . . 9 ⊢ (Base‘𝑃) = (Base‘(mulGrp‘𝑃))
21		cpmadugsum.e	. . . . . . . . 9 ⊢ ↑ = (.g‘(mulGrp‘𝑃))
22		eqid 2736	. . . . . . . . . 10 ⊢ (.r‘𝑃) = (.r‘𝑃)
23	6, 22	mgpplusg 19900	. . . . . . . . 9 ⊢ (.r‘𝑃) = (+g‘(mulGrp‘𝑃))
24	20, 21, 23	mulgnn0dir 18906	. . . . . . . 8 ⊢ (((mulGrp‘𝑃) ∈ Mnd ∧ (𝑖 ∈ ℕ0 ∧ 1 ∈ ℕ0 ∧ 𝑋 ∈ (Base‘𝑃))) → ((𝑖 + 1) ↑ 𝑋) = ((𝑖 ↑ 𝑋)(.r‘𝑃)(1 ↑ 𝑋)))
25	9, 11, 13, 19, 24	syl13anc 1372	. . . . . . 7 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → ((𝑖 + 1) ↑ 𝑋) = ((𝑖 ↑ 𝑋)(.r‘𝑃)(1 ↑ 𝑋)))
26	2	ply1crng 21569	. . . . . . . . . . . . 13 ⊢ (𝑅 ∈ CRing → 𝑃 ∈ CRing)
27	26	anim2i 617	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → (𝑁 ∈ Fin ∧ 𝑃 ∈ CRing))
28	27	3adant3 1132	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (𝑁 ∈ Fin ∧ 𝑃 ∈ CRing))
29		cpmadugsum.y	. . . . . . . . . . . 12 ⊢ 𝑌 = (𝑁 Mat 𝑃)
30	29	matsca2 21769	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ Fin ∧ 𝑃 ∈ CRing) → 𝑃 = (Scalar‘𝑌))
31	28, 30	syl 17	. . . . . . . . . 10 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → 𝑃 = (Scalar‘𝑌))
32	31	ad2antrr 724	. . . . . . . . 9 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → 𝑃 = (Scalar‘𝑌))
33	32	fveq2d 6846	. . . . . . . 8 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → (.r‘𝑃) = (.r‘(Scalar‘𝑌)))
34		eqidd 2737	. . . . . . . 8 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → (𝑖 ↑ 𝑋) = (𝑖 ↑ 𝑋))
35	20, 21	mulg1 18883	. . . . . . . . . 10 ⊢ (𝑋 ∈ (Base‘𝑃) → (1 ↑ 𝑋) = 𝑋)
36	18, 35	syl 17	. . . . . . . . 9 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (1 ↑ 𝑋) = 𝑋)
37	36	ad2antrr 724	. . . . . . . 8 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → (1 ↑ 𝑋) = 𝑋)
38	33, 34, 37	oveq123d 7378	. . . . . . 7 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → ((𝑖 ↑ 𝑋)(.r‘𝑃)(1 ↑ 𝑋)) = ((𝑖 ↑ 𝑋)(.r‘(Scalar‘𝑌))𝑋))
39	25, 38	eqtrd 2776	. . . . . 6 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → ((𝑖 + 1) ↑ 𝑋) = ((𝑖 ↑ 𝑋)(.r‘(Scalar‘𝑌))𝑋))
40	4	anim2i 617	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → (𝑁 ∈ Fin ∧ 𝑃 ∈ Ring))
41	40	3adant3 1132	. . . . . . . . . 10 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (𝑁 ∈ Fin ∧ 𝑃 ∈ Ring))
42	29	matring 21792	. . . . . . . . . 10 ⊢ ((𝑁 ∈ Fin ∧ 𝑃 ∈ Ring) → 𝑌 ∈ Ring)
43	41, 42	syl 17	. . . . . . . . 9 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → 𝑌 ∈ Ring)
44	43	ad2antrr 724	. . . . . . . 8 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → 𝑌 ∈ Ring)
45		simpll1 1212	. . . . . . . . 9 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → 𝑁 ∈ Fin)
46	14	ad2antrr 724	. . . . . . . . 9 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → 𝑅 ∈ Ring)
47		simplrl 775	. . . . . . . . 9 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → 𝑠 ∈ ℕ0)
48		simprr 771	. . . . . . . . . 10 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → 𝑏 ∈ (𝐵 ↑m (0...𝑠)))
49	48	anim1i 615	. . . . . . . . 9 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → (𝑏 ∈ (𝐵 ↑m (0...𝑠)) ∧ 𝑖 ∈ (0...𝑠)))
50		cpmadugsum.a	. . . . . . . . . 10 ⊢ 𝐴 = (𝑁 Mat 𝑅)
51		cpmadugsum.b	. . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝐴)
52		cpmadugsum.t	. . . . . . . . . 10 ⊢ 𝑇 = (𝑁 matToPolyMat 𝑅)
53	50, 51, 2, 29, 52	m2pmfzmap 22096	. . . . . . . . 9 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑠 ∈ ℕ0) ∧ (𝑏 ∈ (𝐵 ↑m (0...𝑠)) ∧ 𝑖 ∈ (0...𝑠))) → (𝑇‘(𝑏‘𝑖)) ∈ (Base‘𝑌))
54	45, 46, 47, 49, 53	syl31anc 1373	. . . . . . . 8 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → (𝑇‘(𝑏‘𝑖)) ∈ (Base‘𝑌))
55		eqid 2736	. . . . . . . . 9 ⊢ (Base‘𝑌) = (Base‘𝑌)
56		cpmadugsum.r	. . . . . . . . 9 ⊢ × = (.r‘𝑌)
57		cpmadugsum.1	. . . . . . . . 9 ⊢ 1 = (1r‘𝑌)
58	55, 56, 57	ringlidm 19992	. . . . . . . 8 ⊢ ((𝑌 ∈ Ring ∧ (𝑇‘(𝑏‘𝑖)) ∈ (Base‘𝑌)) → ( 1 × (𝑇‘(𝑏‘𝑖))) = (𝑇‘(𝑏‘𝑖)))
59	44, 54, 58	syl2anc 584	. . . . . . 7 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → ( 1 × (𝑇‘(𝑏‘𝑖))) = (𝑇‘(𝑏‘𝑖)))
60	59	eqcomd 2742	. . . . . 6 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → (𝑇‘(𝑏‘𝑖)) = ( 1 × (𝑇‘(𝑏‘𝑖))))
61	39, 60	oveq12d 7375	. . . . 5 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → (((𝑖 + 1) ↑ 𝑋) · (𝑇‘(𝑏‘𝑖))) = (((𝑖 ↑ 𝑋)(.r‘(Scalar‘𝑌))𝑋) · ( 1 × (𝑇‘(𝑏‘𝑖)))))
62	29	matassa 21793	. . . . . . . . . 10 ⊢ ((𝑁 ∈ Fin ∧ 𝑃 ∈ CRing) → 𝑌 ∈ AssAlg)
63	27, 62	syl 17	. . . . . . . . 9 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → 𝑌 ∈ AssAlg)
64	63	3adant3 1132	. . . . . . . 8 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → 𝑌 ∈ AssAlg)
65	64	ad2antrr 724	. . . . . . 7 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → 𝑌 ∈ AssAlg)
66	31	eqcomd 2742	. . . . . . . . . 10 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (Scalar‘𝑌) = 𝑃)
67	66	fveq2d 6846	. . . . . . . . 9 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (Base‘(Scalar‘𝑌)) = (Base‘𝑃))
68	18, 67	eleqtrrd 2841	. . . . . . . 8 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → 𝑋 ∈ (Base‘(Scalar‘𝑌)))
69	68	ad2antrr 724	. . . . . . 7 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → 𝑋 ∈ (Base‘(Scalar‘𝑌)))
70	20, 21, 9, 11, 19	mulgnn0cld 18897	. . . . . . . 8 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → (𝑖 ↑ 𝑋) ∈ (Base‘𝑃))
71	67	ad2antrr 724	. . . . . . . 8 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → (Base‘(Scalar‘𝑌)) = (Base‘𝑃))
72	70, 71	eleqtrrd 2841	. . . . . . 7 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → (𝑖 ↑ 𝑋) ∈ (Base‘(Scalar‘𝑌)))
73	40, 42	syl 17	. . . . . . . . . 10 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → 𝑌 ∈ Ring)
74	73	3adant3 1132	. . . . . . . . 9 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → 𝑌 ∈ Ring)
75	55, 57	ringidcl 19989	. . . . . . . . 9 ⊢ (𝑌 ∈ Ring → 1 ∈ (Base‘𝑌))
76	74, 75	syl 17	. . . . . . . 8 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → 1 ∈ (Base‘𝑌))
77	76	ad2antrr 724	. . . . . . 7 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → 1 ∈ (Base‘𝑌))
78		eqid 2736	. . . . . . . 8 ⊢ (Scalar‘𝑌) = (Scalar‘𝑌)
79		eqid 2736	. . . . . . . 8 ⊢ (Base‘(Scalar‘𝑌)) = (Base‘(Scalar‘𝑌))
80		eqid 2736	. . . . . . . 8 ⊢ (.r‘(Scalar‘𝑌)) = (.r‘(Scalar‘𝑌))
81		cpmadugsum.m	. . . . . . . 8 ⊢ · = ( ·𝑠 ‘𝑌)
82	55, 78, 79, 80, 81, 56	assa2ass 21269	. . . . . . 7 ⊢ ((𝑌 ∈ AssAlg ∧ (𝑋 ∈ (Base‘(Scalar‘𝑌)) ∧ (𝑖 ↑ 𝑋) ∈ (Base‘(Scalar‘𝑌))) ∧ ( 1 ∈ (Base‘𝑌) ∧ (𝑇‘(𝑏‘𝑖)) ∈ (Base‘𝑌))) → ((𝑋 · 1 ) × ((𝑖 ↑ 𝑋) · (𝑇‘(𝑏‘𝑖)))) = (((𝑖 ↑ 𝑋)(.r‘(Scalar‘𝑌))𝑋) · ( 1 × (𝑇‘(𝑏‘𝑖)))))
83	65, 69, 72, 77, 54, 82	syl122anc 1379	. . . . . 6 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → ((𝑋 · 1 ) × ((𝑖 ↑ 𝑋) · (𝑇‘(𝑏‘𝑖)))) = (((𝑖 ↑ 𝑋)(.r‘(Scalar‘𝑌))𝑋) · ( 1 × (𝑇‘(𝑏‘𝑖)))))
84	83	eqcomd 2742	. . . . 5 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → (((𝑖 ↑ 𝑋)(.r‘(Scalar‘𝑌))𝑋) · ( 1 × (𝑇‘(𝑏‘𝑖)))) = ((𝑋 · 1 ) × ((𝑖 ↑ 𝑋) · (𝑇‘(𝑏‘𝑖)))))
85	61, 84	eqtrd 2776	. . . 4 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → (((𝑖 + 1) ↑ 𝑋) · (𝑇‘(𝑏‘𝑖))) = ((𝑋 · 1 ) × ((𝑖 ↑ 𝑋) · (𝑇‘(𝑏‘𝑖)))))
86	85	mpteq2dva 5205	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → (𝑖 ∈ (0...𝑠) ↦ (((𝑖 + 1) ↑ 𝑋) · (𝑇‘(𝑏‘𝑖)))) = (𝑖 ∈ (0...𝑠) ↦ ((𝑋 · 1 ) × ((𝑖 ↑ 𝑋) · (𝑇‘(𝑏‘𝑖))))))
87	86	oveq2d 7373	. 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → (𝑌 Σg (𝑖 ∈ (0...𝑠) ↦ (((𝑖 + 1) ↑ 𝑋) · (𝑇‘(𝑏‘𝑖))))) = (𝑌 Σg (𝑖 ∈ (0...𝑠) ↦ ((𝑋 · 1 ) × ((𝑖 ↑ 𝑋) · (𝑇‘(𝑏‘𝑖)))))))
88		eqid 2736	. . 3 ⊢ (0g‘𝑌) = (0g‘𝑌)
89		eqid 2736	. . 3 ⊢ (+g‘𝑌) = (+g‘𝑌)
90	74	adantr 481	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → 𝑌 ∈ Ring)
91		ovexd 7392	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → (0...𝑠) ∈ V)
92	29	matlmod 21778	. . . . . . 7 ⊢ ((𝑁 ∈ Fin ∧ 𝑃 ∈ Ring) → 𝑌 ∈ LMod)
93	40, 92	syl 17	. . . . . 6 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → 𝑌 ∈ LMod)
94	93	3adant3 1132	. . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → 𝑌 ∈ LMod)
95	1	adantl 482	. . . . . . . 8 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → 𝑅 ∈ Ring)
96	95, 17	syl 17	. . . . . . 7 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → 𝑋 ∈ (Base‘𝑃))
97	27, 30	syl 17	. . . . . . . . 9 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → 𝑃 = (Scalar‘𝑌))
98	97	eqcomd 2742	. . . . . . . 8 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → (Scalar‘𝑌) = 𝑃)
99	98	fveq2d 6846	. . . . . . 7 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → (Base‘(Scalar‘𝑌)) = (Base‘𝑃))
100	96, 99	eleqtrrd 2841	. . . . . 6 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → 𝑋 ∈ (Base‘(Scalar‘𝑌)))
101	100	3adant3 1132	. . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → 𝑋 ∈ (Base‘(Scalar‘𝑌)))
102	43, 75	syl 17	. . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → 1 ∈ (Base‘𝑌))
103	55, 78, 81, 79	lmodvscl 20339	. . . . 5 ⊢ ((𝑌 ∈ LMod ∧ 𝑋 ∈ (Base‘(Scalar‘𝑌)) ∧ 1 ∈ (Base‘𝑌)) → (𝑋 · 1 ) ∈ (Base‘𝑌))
104	94, 101, 102, 103	syl3anc 1371	. . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (𝑋 · 1 ) ∈ (Base‘𝑌))
105	104	adantr 481	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → (𝑋 · 1 ) ∈ (Base‘𝑌))
106	94	ad2antrr 724	. . . 4 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → 𝑌 ∈ LMod)
107	30	eqcomd 2742	. . . . . . . . 9 ⊢ ((𝑁 ∈ Fin ∧ 𝑃 ∈ CRing) → (Scalar‘𝑌) = 𝑃)
108	107	fveq2d 6846	. . . . . . . 8 ⊢ ((𝑁 ∈ Fin ∧ 𝑃 ∈ CRing) → (Base‘(Scalar‘𝑌)) = (Base‘𝑃))
109	28, 108	syl 17	. . . . . . 7 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (Base‘(Scalar‘𝑌)) = (Base‘𝑃))
110	109	eleq2d 2823	. . . . . 6 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → ((𝑖 ↑ 𝑋) ∈ (Base‘(Scalar‘𝑌)) ↔ (𝑖 ↑ 𝑋) ∈ (Base‘𝑃)))
111	110	ad2antrr 724	. . . . 5 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → ((𝑖 ↑ 𝑋) ∈ (Base‘(Scalar‘𝑌)) ↔ (𝑖 ↑ 𝑋) ∈ (Base‘𝑃)))
112	70, 111	mpbird 256	. . . 4 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → (𝑖 ↑ 𝑋) ∈ (Base‘(Scalar‘𝑌)))
113	55, 78, 81, 79	lmodvscl 20339	. . . 4 ⊢ ((𝑌 ∈ LMod ∧ (𝑖 ↑ 𝑋) ∈ (Base‘(Scalar‘𝑌)) ∧ (𝑇‘(𝑏‘𝑖)) ∈ (Base‘𝑌)) → ((𝑖 ↑ 𝑋) · (𝑇‘(𝑏‘𝑖))) ∈ (Base‘𝑌))
114	106, 112, 54, 113	syl3anc 1371	. . 3 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑖 ∈ (0...𝑠)) → ((𝑖 ↑ 𝑋) · (𝑇‘(𝑏‘𝑖))) ∈ (Base‘𝑌))
115		simpl1 1191	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → 𝑁 ∈ Fin)
116	14	adantr 481	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → 𝑅 ∈ Ring)
117		simprl 769	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → 𝑠 ∈ ℕ0)
118		eqid 2736	. . . . 5 ⊢ (𝑖 ∈ (0...𝑠) ↦ ((𝑖 ↑ 𝑋) · (𝑇‘(𝑏‘𝑖)))) = (𝑖 ∈ (0...𝑠) ↦ ((𝑖 ↑ 𝑋) · (𝑇‘(𝑏‘𝑖))))
119		fzfid 13878	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑠 ∈ ℕ0) ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠))) → (0...𝑠) ∈ Fin)
120		ovexd 7392	. . . . 5 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑠 ∈ ℕ0) ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠))) ∧ 𝑖 ∈ (0...𝑠)) → ((𝑖 ↑ 𝑋) · (𝑇‘(𝑏‘𝑖))) ∈ V)
121		fvexd 6857	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑠 ∈ ℕ0) ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠))) → (0g‘𝑌) ∈ V)
122	118, 119, 120, 121	fsuppmptdm 9316	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑠 ∈ ℕ0) ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠))) → (𝑖 ∈ (0...𝑠) ↦ ((𝑖 ↑ 𝑋) · (𝑇‘(𝑏‘𝑖)))) finSupp (0g‘𝑌))
123	115, 116, 117, 48, 122	syl31anc 1373	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → (𝑖 ∈ (0...𝑠) ↦ ((𝑖 ↑ 𝑋) · (𝑇‘(𝑏‘𝑖)))) finSupp (0g‘𝑌))
124	55, 88, 89, 56, 90, 91, 105, 114, 123	gsummulc2 20031	. 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → (𝑌 Σg (𝑖 ∈ (0...𝑠) ↦ ((𝑋 · 1 ) × ((𝑖 ↑ 𝑋) · (𝑇‘(𝑏‘𝑖)))))) = ((𝑋 · 1 ) × (𝑌 Σg (𝑖 ∈ (0...𝑠) ↦ ((𝑖 ↑ 𝑋) · (𝑇‘(𝑏‘𝑖)))))))
125	87, 124	eqtr2d 2777	1 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ0 ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → ((𝑋 · 1 ) × (𝑌 Σg (𝑖 ∈ (0...𝑠) ↦ ((𝑖 ↑ 𝑋) · (𝑇‘(𝑏‘𝑖)))))) = (𝑌 Σg (𝑖 ∈ (0...𝑠) ↦ (((𝑖 + 1) ↑ 𝑋) · (𝑇‘(𝑏‘𝑖))))))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  Vcvv 3445   class class class wbr 5105   ↦ cmpt 5188  ‘cfv 6496  (class class class)co 7357   ↑_m cmap 8765  Fincfn 8883   finSupp cfsupp 9305  0cc0 11051  1c1 11052   + caddc 11054  ℕ₀cn0 12413  ...cfz 13424  Basecbs 17083  +_gcplusg 17133  ._rcmulr 17134  Scalarcsca 17136   ·_𝑠 cvsca 17137  0_gc0g 17321   Σ_g cgsu 17322  Mndcmnd 18556  ._gcmg 18872  mulGrpcmgp 19896  1_rcur 19913  Ringcrg 19964  CRingccrg 19965  LModclmod 20322  AssAlgcasa 21256  var₁cv1 21547  Poly₁cpl1 21548   Mat cmat 21754   matToPolyMat cmat2pmat 22053

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672  ax-cnex 11107  ax-resscn 11108  ax-1cn 11109  ax-icn 11110  ax-addcl 11111  ax-addrcl 11112  ax-mulcl 11113  ax-mulrcl 11114  ax-mulcom 11115  ax-addass 11116  ax-mulass 11117  ax-distr 11118  ax-i2m1 11119  ax-1ne0 11120  ax-1rid 11121  ax-rnegex 11122  ax-rrecex 11123  ax-cnre 11124  ax-pre-lttri 11125  ax-pre-lttrn 11126  ax-pre-ltadd 11127  ax-pre-mulgt0 11128

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3065  df-rex 3074  df-rmo 3353  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-tp 4591  df-op 4593  df-ot 4595  df-uni 4866  df-int 4908  df-iun 4956  df-iin 4957  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-se 5589  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-pred 6253  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-isom 6505  df-riota 7313  df-ov 7360  df-oprab 7361  df-mpo 7362  df-of 7617  df-ofr 7618  df-om 7803  df-1st 7921  df-2nd 7922  df-supp 8093  df-frecs 8212  df-wrecs 8243  df-recs 8317  df-rdg 8356  df-1o 8412  df-er 8648  df-map 8767  df-pm 8768  df-ixp 8836  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-fsupp 9306  df-sup 9378  df-oi 9446  df-card 9875  df-pnf 11191  df-mnf 11192  df-xr 11193  df-ltxr 11194  df-le 11195  df-sub 11387  df-neg 11388  df-nn 12154  df-2 12216  df-3 12217  df-4 12218  df-5 12219  df-6 12220  df-7 12221  df-8 12222  df-9 12223  df-n0 12414  df-z 12500  df-dec 12619  df-uz 12764  df-fz 13425  df-fzo 13568  df-seq 13907  df-hash 14231  df-struct 17019  df-sets 17036  df-slot 17054  df-ndx 17066  df-base 17084  df-ress 17113  df-plusg 17146  df-mulr 17147  df-sca 17149  df-vsca 17150  df-ip 17151  df-tset 17152  df-ple 17153  df-ds 17155  df-hom 17157  df-cco 17158  df-0g 17323  df-gsum 17324  df-prds 17329  df-pws 17331  df-mre 17466  df-mrc 17467  df-acs 17469  df-mgm 18497  df-sgrp 18546  df-mnd 18557  df-mhm 18601  df-submnd 18602  df-grp 18751  df-minusg 18752  df-sbg 18753  df-mulg 18873  df-subg 18925  df-ghm 19006  df-cntz 19097  df-cmn 19564  df-abl 19565  df-mgp 19897  df-ur 19914  df-ring 19966  df-cring 19967  df-subrg 20220  df-lmod 20324  df-lss 20393  df-sra 20633  df-rgmod 20634  df-dsmm 21138  df-frlm 21153  df-assa 21259  df-ascl 21261  df-psr 21311  df-mvr 21312  df-mpl 21313  df-opsr 21315  df-psr1 21551  df-vr1 21552  df-ply1 21553  df-mamu 21733  df-mat 21755  df-mat2pmat 22056

This theorem is referenced by:  cpmadugsumlemF  22225