Theorem pm2mpmhmlem1 21425

Description: Lemma 1 for pm2mpmhm 21427. (Contributed by AV, 21-Oct-2019.) (Revised by AV, 6-Dec-2019.)

Hypotheses

Ref	Expression
pm2mpfo.p	⊢ 𝑃 = (Poly1‘𝑅)
pm2mpfo.c	⊢ 𝐶 = (𝑁 Mat 𝑃)
pm2mpfo.b	⊢ 𝐵 = (Base‘𝐶)
pm2mpfo.m	⊢ ∗ = ( ·𝑠 ‘𝑄)
pm2mpfo.e	⊢ ↑ = (.g‘(mulGrp‘𝑄))
pm2mpfo.x	⊢ 𝑋 = (var1‘𝐴)
pm2mpfo.a	⊢ 𝐴 = (𝑁 Mat 𝑅)
pm2mpfo.q	⊢ 𝑄 = (Poly1‘𝐴)
pm2mpfo.l	⊢ 𝐿 = (Base‘𝑄)
pm2mpfo.t	⊢ 𝑇 = (𝑁 pMatToMatPoly 𝑅)

Assertion

Ref	Expression
pm2mpmhmlem1	⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑙 ∈ ℕ0 ↦ ((𝐴 Σg (𝑘 ∈ (0...𝑙) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑙 − 𝑘))))) ∗ (𝑙 ↑ 𝑋))) finSupp (0g‘𝑄))

Distinct variable groups:   𝐴,𝑘   𝐵,𝑘,𝑙   𝐶,𝑘,𝑙   𝑘,𝐿   𝑘,𝑁,𝑙   𝑄,𝑘   𝑅,𝑘   ∗ ,𝑘   𝐴,𝑙   𝑃,𝑘   𝑅,𝑙   𝑋,𝑙   ∗ ,𝑙   ↑ ,𝑙   𝑥,𝑦,𝑘,𝑙

Allowed substitution hints:   𝐴(𝑥,𝑦)   𝐵(𝑥,𝑦)   𝐶(𝑥,𝑦)   𝑃(𝑥,𝑦,𝑙)   𝑄(𝑥,𝑦,𝑙)   𝑅(𝑥,𝑦)   𝑇(𝑥,𝑦,𝑘,𝑙)   ↑ (𝑥,𝑦,𝑘)   ∗ (𝑥,𝑦)   𝐿(𝑥,𝑦,𝑙)   𝑁(𝑥,𝑦)   𝑋(𝑥,𝑦,𝑘)

Proof of Theorem pm2mpmhmlem1

Dummy variables 𝑎 𝑏 𝑖 𝑗 𝑛 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fvexd 6684	. 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (0g‘𝑄) ∈ V)
2		ovexd 7190	. 2 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑙 ∈ ℕ0) → ((𝐴 Σg (𝑘 ∈ (0...𝑙) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑙 − 𝑘))))) ∗ (𝑙 ↑ 𝑋)) ∈ V)
3		oveq2 7163	. . . . 5 ⊢ (𝑙 = 𝑛 → (0...𝑙) = (0...𝑛))
4		oveq1 7162	. . . . . . 7 ⊢ (𝑙 = 𝑛 → (𝑙 − 𝑘) = (𝑛 − 𝑘))
5	4	oveq2d 7171	. . . . . 6 ⊢ (𝑙 = 𝑛 → (𝑦 decompPMat (𝑙 − 𝑘)) = (𝑦 decompPMat (𝑛 − 𝑘)))
6	5	oveq2d 7171	. . . . 5 ⊢ (𝑙 = 𝑛 → ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑙 − 𝑘))) = ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))
7	3, 6	mpteq12dv 5150	. . . 4 ⊢ (𝑙 = 𝑛 → (𝑘 ∈ (0...𝑙) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑙 − 𝑘)))) = (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘)))))
8	7	oveq2d 7171	. . 3 ⊢ (𝑙 = 𝑛 → (𝐴 Σg (𝑘 ∈ (0...𝑙) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑙 − 𝑘))))) = (𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))))
9		oveq1 7162	. . 3 ⊢ (𝑙 = 𝑛 → (𝑙 ↑ 𝑋) = (𝑛 ↑ 𝑋))
10	8, 9	oveq12d 7173	. 2 ⊢ (𝑙 = 𝑛 → ((𝐴 Σg (𝑘 ∈ (0...𝑙) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑙 − 𝑘))))) ∗ (𝑙 ↑ 𝑋)) = ((𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))) ∗ (𝑛 ↑ 𝑋)))
11		simpll 765	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑁 ∈ Fin)
12		simplr 767	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑅 ∈ Ring)
13		pm2mpfo.p	. . . . . . . . . 10 ⊢ 𝑃 = (Poly1‘𝑅)
14		pm2mpfo.c	. . . . . . . . . 10 ⊢ 𝐶 = (𝑁 Mat 𝑃)
15	13, 14	pmatring 21300	. . . . . . . . 9 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐶 ∈ Ring)
16	15	anim1i 616	. . . . . . . 8 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝐶 ∈ Ring ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)))
17		3anass 1091	. . . . . . . 8 ⊢ ((𝐶 ∈ Ring ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ↔ (𝐶 ∈ Ring ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)))
18	16, 17	sylibr 236	. . . . . . 7 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝐶 ∈ Ring ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵))
19		pm2mpfo.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝐶)
20		eqid 2821	. . . . . . . 8 ⊢ (.r‘𝐶) = (.r‘𝐶)
21	19, 20	ringcl 19310	. . . . . . 7 ⊢ ((𝐶 ∈ Ring ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥(.r‘𝐶)𝑦) ∈ 𝐵)
22	18, 21	syl 17	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(.r‘𝐶)𝑦) ∈ 𝐵)
23		eqid 2821	. . . . . . 7 ⊢ (0g‘𝑅) = (0g‘𝑅)
24	13, 14, 19, 23	pmatcoe1fsupp 21308	. . . . . 6 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ (𝑥(.r‘𝐶)𝑦) ∈ 𝐵) → ∃𝑠 ∈ ℕ0 ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)))
25	11, 12, 22, 24	syl3anc 1367	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∃𝑠 ∈ ℕ0 ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)))
26		fvoveq1 7178	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 = 𝑖 → (coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏)) = (coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑏)))
27	26	fveq1d 6671	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑎 = 𝑖 → ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛))
28	27	eqeq1d 2823	. . . . . . . . . . . . . . . . 17 ⊢ (𝑎 = 𝑖 → (((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅) ↔ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)))
29		oveq2 7163	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑏 = 𝑗 → (𝑖(𝑥(.r‘𝐶)𝑦)𝑏) = (𝑖(𝑥(.r‘𝐶)𝑦)𝑗))
30	29	fveq2d 6673	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑏 = 𝑗 → (coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑏)) = (coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗)))
31	30	fveq1d 6671	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑏 = 𝑗 → ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛))
32	31	eqeq1d 2823	. . . . . . . . . . . . . . . . 17 ⊢ (𝑏 = 𝑗 → (((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅) ↔ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛) = (0g‘𝑅)))
33	28, 32	rspc2va 3633	. . . . . . . . . . . . . . . 16 ⊢ (((𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛) = (0g‘𝑅))
34	33	expcom 416	. . . . . . . . . . . . . . 15 ⊢ (∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅) → ((𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛) = (0g‘𝑅)))
35	34	adantl 484	. . . . . . . . . . . . . 14 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → ((𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛) = (0g‘𝑅)))
36	35	3impib 1112	. . . . . . . . . . . . 13 ⊢ ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛) = (0g‘𝑅))
37	36	mpoeq3dva 7230	. . . . . . . . . . . 12 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (0g‘𝑅)))
38		pm2mpfo.a	. . . . . . . . . . . . . 14 ⊢ 𝐴 = (𝑁 Mat 𝑅)
39	38, 23	mat0op 21027	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (0g‘𝐴) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (0g‘𝑅)))
40	39	ad3antrrr 728	. . . . . . . . . . . 12 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → (0g‘𝐴) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (0g‘𝑅)))
41	38	matring 21051	. . . . . . . . . . . . . . 15 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐴 ∈ Ring)
42		pm2mpfo.q	. . . . . . . . . . . . . . . 16 ⊢ 𝑄 = (Poly1‘𝐴)
43	42	ply1sca 20420	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ Ring → 𝐴 = (Scalar‘𝑄))
44	41, 43	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐴 = (Scalar‘𝑄))
45	44	ad3antrrr 728	. . . . . . . . . . . . 13 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → 𝐴 = (Scalar‘𝑄))
46	45	fveq2d 6673	. . . . . . . . . . . 12 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → (0g‘𝐴) = (0g‘(Scalar‘𝑄)))
47	37, 40, 46	3eqtr2d 2862	. . . . . . . . . . 11 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) = (0g‘(Scalar‘𝑄)))
48	47	oveq1d 7170	. . . . . . . . . 10 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = ((0g‘(Scalar‘𝑄)) ∗ (𝑛 ↑ 𝑋)))
49	42	ply1lmod 20419	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ Ring → 𝑄 ∈ LMod)
50	41, 49	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝑄 ∈ LMod)
51	50	adantr 483	. . . . . . . . . . . 12 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑄 ∈ LMod)
52	41	adantr 483	. . . . . . . . . . . . 13 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐴 ∈ Ring)
53		pm2mpfo.x	. . . . . . . . . . . . . 14 ⊢ 𝑋 = (var1‘𝐴)
54		eqid 2821	. . . . . . . . . . . . . 14 ⊢ (mulGrp‘𝑄) = (mulGrp‘𝑄)
55		pm2mpfo.e	. . . . . . . . . . . . . 14 ⊢ ↑ = (.g‘(mulGrp‘𝑄))
56		pm2mpfo.l	. . . . . . . . . . . . . 14 ⊢ 𝐿 = (Base‘𝑄)
57	42, 53, 54, 55, 56	ply1moncl 20438	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ Ring ∧ 𝑛 ∈ ℕ0) → (𝑛 ↑ 𝑋) ∈ 𝐿)
58	52, 57	sylan 582	. . . . . . . . . . . 12 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → (𝑛 ↑ 𝑋) ∈ 𝐿)
59		eqid 2821	. . . . . . . . . . . . 13 ⊢ (Scalar‘𝑄) = (Scalar‘𝑄)
60		pm2mpfo.m	. . . . . . . . . . . . 13 ⊢ ∗ = ( ·𝑠 ‘𝑄)
61		eqid 2821	. . . . . . . . . . . . 13 ⊢ (0g‘(Scalar‘𝑄)) = (0g‘(Scalar‘𝑄))
62		eqid 2821	. . . . . . . . . . . . 13 ⊢ (0g‘𝑄) = (0g‘𝑄)
63	56, 59, 60, 61, 62	lmod0vs 19666	. . . . . . . . . . . 12 ⊢ ((𝑄 ∈ LMod ∧ (𝑛 ↑ 𝑋) ∈ 𝐿) → ((0g‘(Scalar‘𝑄)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))
64	51, 58, 63	syl2an2r 683	. . . . . . . . . . 11 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → ((0g‘(Scalar‘𝑄)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))
65	64	adantr 483	. . . . . . . . . 10 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → ((0g‘(Scalar‘𝑄)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))
66	48, 65	eqtrd 2856	. . . . . . . . 9 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))
67	66	ex 415	. . . . . . . 8 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → (∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅) → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)))
68	67	imim2d 57	. . . . . . 7 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → ((𝑠 < 𝑛 → ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → (𝑠 < 𝑛 → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))))
69	68	ralimdva 3177	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))))
70	69	reximdv 3273	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (∃𝑠 ∈ ℕ0 ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → ∃𝑠 ∈ ℕ0 ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))))
71	25, 70	mpd 15	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∃𝑠 ∈ ℕ0 ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)))
72	14, 19	decpmatval 21372	. . . . . . . . . 10 ⊢ (((𝑥(.r‘𝐶)𝑦) ∈ 𝐵 ∧ 𝑛 ∈ ℕ0) → ((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)))
73	22, 72	sylan 582	. . . . . . . . 9 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → ((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)))
74	73	oveq1d 7170	. . . . . . . 8 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)))
75	74	eqeq1d 2823	. . . . . . 7 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → ((((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄) ↔ ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)))
76	75	imbi2d 343	. . . . . 6 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → ((𝑠 < 𝑛 → (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)) ↔ (𝑠 < 𝑛 → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))))
77	76	ralbidva 3196	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)) ↔ ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))))
78	77	rexbidv 3297	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (∃𝑠 ∈ ℕ0 ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)) ↔ ∃𝑠 ∈ ℕ0 ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))))
79	71, 78	mpbird 259	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∃𝑠 ∈ ℕ0 ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)))
80	13, 14, 19, 38	decpmatmul 21379	. . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑛 ∈ ℕ0) → ((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) = (𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))))
81	80	ad4ant234 1171	. . . . . . . . 9 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → ((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) = (𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))))
82	81	eqcomd 2827	. . . . . . . 8 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → (𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))) = ((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛))
83	82	oveq1d 7170	. . . . . . 7 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → ((𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))) ∗ (𝑛 ↑ 𝑋)) = (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)))
84	83	eqeq1d 2823	. . . . . 6 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → (((𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄) ↔ (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)))
85	84	imbi2d 343	. . . . 5 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → ((𝑠 < 𝑛 → ((𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)) ↔ (𝑠 < 𝑛 → (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))))
86	85	ralbidva 3196	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ((𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)) ↔ ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))))
87	86	rexbidv 3297	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (∃𝑠 ∈ ℕ0 ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ((𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)) ↔ ∃𝑠 ∈ ℕ0 ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))))
88	79, 87	mpbird 259	. 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∃𝑠 ∈ ℕ0 ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ((𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)))
89	1, 2, 10, 88	mptnn0fsuppd 13365	1 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑙 ∈ ℕ0 ↦ ((𝐴 Σg (𝑘 ∈ (0...𝑙) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑙 − 𝑘))))) ∗ (𝑙 ↑ 𝑋))) finSupp (0g‘𝑄))

Syntax hints:   → wi 4   ∧ wa 398   ∧ w3a 1083   = wceq 1533   ∈ wcel 2110  ∀wral 3138  ∃wrex 3139  Vcvv 3494   class class class wbr 5065   ↦ cmpt 5145  ‘cfv 6354  (class class class)co 7155   ∈ cmpo 7157  Fincfn 8508   finSupp cfsupp 8832  0cc0 10536   < clt 10674   − cmin 10869  ℕ₀cn0 11896  ...cfz 12891  Basecbs 16482  ._rcmulr 16565  Scalarcsca 16567   ·_𝑠 cvsca 16568  0_gc0g 16712   Σ_g cgsu 16713  ._gcmg 18223  mulGrpcmgp 19238  Ringcrg 19296  LModclmod 19633  var₁cv1 20343  Poly₁cpl1 20344  coe₁cco1 20345   Mat cmat 21015   decompPMat cdecpmat 21369   pMatToMatPoly cpm2mp 21399

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-rep 5189  ax-sep 5202  ax-nul 5209  ax-pow 5265  ax-pr 5329  ax-un 7460  ax-cnex 10592  ax-resscn 10593  ax-1cn 10594  ax-icn 10595  ax-addcl 10596  ax-addrcl 10597  ax-mulcl 10598  ax-mulrcl 10599  ax-mulcom 10600  ax-addass 10601  ax-mulass 10602  ax-distr 10603  ax-i2m1 10604  ax-1ne0 10605  ax-1rid 10606  ax-rnegex 10607  ax-rrecex 10608  ax-cnre 10609  ax-pre-lttri 10610  ax-pre-lttrn 10611  ax-pre-ltadd 10612  ax-pre-mulgt0 10613

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-fal 1546  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-pss 3953  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4567  df-pr 4569  df-tp 4571  df-op 4573  df-ot 4575  df-uni 4838  df-int 4876  df-iun 4920  df-iin 4921  df-br 5066  df-opab 5128  df-mpt 5146  df-tr 5172  df-id 5459  df-eprel 5464  df-po 5473  df-so 5474  df-fr 5513  df-se 5514  df-we 5515  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-pred 6147  df-ord 6193  df-on 6194  df-lim 6195  df-suc 6196  df-iota 6313  df-fun 6356  df-fn 6357  df-f 6358  df-f1 6359  df-fo 6360  df-f1o 6361  df-fv 6362  df-isom 6363  df-riota 7113  df-ov 7158  df-oprab 7159  df-mpo 7160  df-of 7408  df-ofr 7409  df-om 7580  df-1st 7688  df-2nd 7689  df-supp 7830  df-wrecs 7946  df-recs 8007  df-rdg 8045  df-1o 8101  df-2o 8102  df-oadd 8105  df-er 8288  df-map 8407  df-pm 8408  df-ixp 8461  df-en 8509  df-dom 8510  df-sdom 8511  df-fin 8512  df-fsupp 8833  df-sup 8905  df-oi 8973  df-card 9367  df-pnf 10676  df-mnf 10677  df-xr 10678  df-ltxr 10679  df-le 10680  df-sub 10871  df-neg 10872  df-nn 11638  df-2 11699  df-3 11700  df-4 11701  df-5 11702  df-6 11703  df-7 11704  df-8 11705  df-9 11706  df-n0 11897  df-z 11981  df-dec 12098  df-uz 12243  df-fz 12892  df-fzo 13033  df-seq 13369  df-hash 13690  df-struct 16484  df-ndx 16485  df-slot 16486  df-base 16488  df-sets 16489  df-ress 16490  df-plusg 16577  df-mulr 16578  df-sca 16580  df-vsca 16581  df-ip 16582  df-tset 16583  df-ple 16584  df-ds 16586  df-hom 16588  df-cco 16589  df-0g 16714  df-gsum 16715  df-prds 16720  df-pws 16722  df-mre 16856  df-mrc 16857  df-acs 16859  df-mgm 17851  df-sgrp 17900  df-mnd 17911  df-mhm 17955  df-submnd 17956  df-grp 18105  df-minusg 18106  df-sbg 18107  df-mulg 18224  df-subg 18275  df-ghm 18355  df-cntz 18446  df-cmn 18907  df-abl 18908  df-mgp 19239  df-ur 19251  df-ring 19298  df-subrg 19532  df-lmod 19635  df-lss 19703  df-sra 19943  df-rgmod 19944  df-psr 20135  df-mvr 20136  df-mpl 20137  df-opsr 20139  df-psr1 20347  df-vr1 20348  df-ply1 20349  df-coe1 20350  df-dsmm 20875  df-frlm 20890  df-mamu 20994  df-mat 21016  df-decpmat 21370

This theorem is referenced by:  pm2mpmhmlem2  21426