Theorem pm2mpmhmlem1 22865

Description: Lemma 1 for pm2mpmhm 22867. (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 6876	. 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (0g‘𝑄) ∈ V)
2		ovexd 7425	. 2 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑙 ∈ ℕ0) → ((𝐴 Σg (𝑘 ∈ (0...𝑙) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑙 − 𝑘))))) ∗ (𝑙 ↑ 𝑋)) ∈ V)
3		oveq2 7398	. . . . 5 ⊢ (𝑙 = 𝑛 → (0...𝑙) = (0...𝑛))
4		oveq1 7397	. . . . . . 7 ⊢ (𝑙 = 𝑛 → (𝑙 − 𝑘) = (𝑛 − 𝑘))
5	4	oveq2d 7406	. . . . . 6 ⊢ (𝑙 = 𝑛 → (𝑦 decompPMat (𝑙 − 𝑘)) = (𝑦 decompPMat (𝑛 − 𝑘)))
6	5	oveq2d 7406	. . . . 5 ⊢ (𝑙 = 𝑛 → ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑙 − 𝑘))) = ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))
7	3, 6	mpteq12dv 5184	. . . 4 ⊢ (𝑙 = 𝑛 → (𝑘 ∈ (0...𝑙) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑙 − 𝑘)))) = (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘)))))
8	7	oveq2d 7406	. . 3 ⊢ (𝑙 = 𝑛 → (𝐴 Σg (𝑘 ∈ (0...𝑙) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑙 − 𝑘))))) = (𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))))
9		oveq1 7397	. . 3 ⊢ (𝑙 = 𝑛 → (𝑙 ↑ 𝑋) = (𝑛 ↑ 𝑋))
10	8, 9	oveq12d 7408	. 2 ⊢ (𝑙 = 𝑛 → ((𝐴 Σg (𝑘 ∈ (0...𝑙) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑙 − 𝑘))))) ∗ (𝑙 ↑ 𝑋)) = ((𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))) ∗ (𝑛 ↑ 𝑋)))
11		simpll 776	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑁 ∈ Fin)
12		simplr 778	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑅 ∈ Ring)
13		pm2mpfo.p	. . . . . . . . . 10 ⊢ 𝑃 = (Poly1‘𝑅)
14		pm2mpfo.c	. . . . . . . . . 10 ⊢ 𝐶 = (𝑁 Mat 𝑃)
15	13, 14	pmatring 22739	. . . . . . . . 9 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐶 ∈ Ring)
16	15	anim1i 624	. . . . . . . 8 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝐶 ∈ Ring ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)))
17		3anass 1105	. . . . . . . 8 ⊢ ((𝐶 ∈ Ring ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ↔ (𝐶 ∈ Ring ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)))
18	16, 17	sylibr 236	. . . . . . 7 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝐶 ∈ Ring ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵))
19		pm2mpfo.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝐶)
20		eqid 2761	. . . . . . . 8 ⊢ (.r‘𝐶) = (.r‘𝐶)
21	19, 20	ringcl 20286	. . . . . . 7 ⊢ ((𝐶 ∈ Ring ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥(.r‘𝐶)𝑦) ∈ 𝐵)
22	18, 21	syl 17	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(.r‘𝐶)𝑦) ∈ 𝐵)
23		eqid 2761	. . . . . . 7 ⊢ (0g‘𝑅) = (0g‘𝑅)
24	13, 14, 19, 23	pmatcoe1fsupp 22748	. . . . . 6 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ (𝑥(.r‘𝐶)𝑦) ∈ 𝐵) → ∃𝑠 ∈ ℕ0 ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)))
25	11, 12, 22, 24	syl3anc 1389	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∃𝑠 ∈ ℕ0 ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)))
26		fvoveq1 7413	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 = 𝑖 → (coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏)) = (coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑏)))
27	26	fveq1d 6863	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑎 = 𝑖 → ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛))
28	27	eqeq1d 2763	. . . . . . . . . . . . . . . . 17 ⊢ (𝑎 = 𝑖 → (((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅) ↔ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)))
29		oveq2 7398	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑏 = 𝑗 → (𝑖(𝑥(.r‘𝐶)𝑦)𝑏) = (𝑖(𝑥(.r‘𝐶)𝑦)𝑗))
30	29	fveq2d 6865	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑏 = 𝑗 → (coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑏)) = (coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗)))
31	30	fveq1d 6863	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑏 = 𝑗 → ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛))
32	31	eqeq1d 2763	. . . . . . . . . . . . . . . . 17 ⊢ (𝑏 = 𝑗 → (((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅) ↔ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛) = (0g‘𝑅)))
33	28, 32	rspc2va 3592	. . . . . . . . . . . . . . . 16 ⊢ (((𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛) = (0g‘𝑅))
34	33	expcom 417	. . . . . . . . . . . . . . 15 ⊢ (∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅) → ((𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛) = (0g‘𝑅)))
35	34	adantl 485	. . . . . . . . . . . . . 14 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → ((𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛) = (0g‘𝑅)))
36	35	3impib 1128	. . . . . . . . . . . . 13 ⊢ ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛) = (0g‘𝑅))
37	36	mpoeq3dva 7467	. . . . . . . . . . . 12 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (0g‘𝑅)))
38		pm2mpfo.a	. . . . . . . . . . . . . 14 ⊢ 𝐴 = (𝑁 Mat 𝑅)
39	38, 23	mat0op 22466	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (0g‘𝐴) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (0g‘𝑅)))
40	39	ad3antrrr 740	. . . . . . . . . . . 12 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → (0g‘𝐴) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (0g‘𝑅)))
41	38	matring 22490	. . . . . . . . . . . . . . 15 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐴 ∈ Ring)
42		pm2mpfo.q	. . . . . . . . . . . . . . . 16 ⊢ 𝑄 = (Poly1‘𝐴)
43	42	ply1sca 22301	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ Ring → 𝐴 = (Scalar‘𝑄))
44	41, 43	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐴 = (Scalar‘𝑄))
45	44	ad3antrrr 740	. . . . . . . . . . . . 13 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → 𝐴 = (Scalar‘𝑄))
46	45	fveq2d 6865	. . . . . . . . . . . 12 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → (0g‘𝐴) = (0g‘(Scalar‘𝑄)))
47	37, 40, 46	3eqtr2d 2802	. . . . . . . . . . 11 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) = (0g‘(Scalar‘𝑄)))
48	47	oveq1d 7405	. . . . . . . . . 10 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = ((0g‘(Scalar‘𝑄)) ∗ (𝑛 ↑ 𝑋)))
49	42	ply1lmod 22300	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ Ring → 𝑄 ∈ LMod)
50	41, 49	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝑄 ∈ LMod)
51	50	adantr 484	. . . . . . . . . . . 12 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑄 ∈ LMod)
52	41	adantr 484	. . . . . . . . . . . . 13 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐴 ∈ Ring)
53		pm2mpfo.x	. . . . . . . . . . . . . 14 ⊢ 𝑋 = (var1‘𝐴)
54		eqid 2761	. . . . . . . . . . . . . 14 ⊢ (mulGrp‘𝑄) = (mulGrp‘𝑄)
55		pm2mpfo.e	. . . . . . . . . . . . . 14 ⊢ ↑ = (.g‘(mulGrp‘𝑄))
56		pm2mpfo.l	. . . . . . . . . . . . . 14 ⊢ 𝐿 = (Base‘𝑄)
57	42, 53, 54, 55, 56	ply1moncl 22321	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ Ring ∧ 𝑛 ∈ ℕ0) → (𝑛 ↑ 𝑋) ∈ 𝐿)
58	52, 57	sylan 589	. . . . . . . . . . . 12 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → (𝑛 ↑ 𝑋) ∈ 𝐿)
59		eqid 2761	. . . . . . . . . . . . 13 ⊢ (Scalar‘𝑄) = (Scalar‘𝑄)
60		pm2mpfo.m	. . . . . . . . . . . . 13 ⊢ ∗ = ( ·𝑠 ‘𝑄)
61		eqid 2761	. . . . . . . . . . . . 13 ⊢ (0g‘(Scalar‘𝑄)) = (0g‘(Scalar‘𝑄))
62		eqid 2761	. . . . . . . . . . . . 13 ⊢ (0g‘𝑄) = (0g‘𝑄)
63	56, 59, 60, 61, 62	lmod0vs 20949	. . . . . . . . . . . 12 ⊢ ((𝑄 ∈ LMod ∧ (𝑛 ↑ 𝑋) ∈ 𝐿) → ((0g‘(Scalar‘𝑄)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))
64	51, 58, 63	syl2an2r 695	. . . . . . . . . . 11 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → ((0g‘(Scalar‘𝑄)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))
65	64	adantr 484	. . . . . . . . . 10 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → ((0g‘(Scalar‘𝑄)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))
66	48, 65	eqtrd 2796	. . . . . . . . 9 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))
67	66	ex 416	. . . . . . . 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 3173	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))))
70	69	reximdv 3176	. . . . 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 22812	. . . . . . . . . 10 ⊢ (((𝑥(.r‘𝐶)𝑦) ∈ 𝐵 ∧ 𝑛 ∈ ℕ0) → ((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)))
73	22, 72	sylan 589	. . . . . . . . 9 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → ((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)))
74	73	oveq1d 7405	. . . . . . . 8 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)))
75	74	eqeq1d 2763	. . . . . . 7 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → ((((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄) ↔ ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)))
76	75	imbi2d 342	. . . . . 6 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → ((𝑠 < 𝑛 → (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)) ↔ (𝑠 < 𝑛 → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))))
77	76	ralbidva 3182	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)) ↔ ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))))
78	77	rexbidv 3185	. . . 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 22819	. . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑛 ∈ ℕ0) → ((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) = (𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))))
81	80	ad4ant234 1188	. . . . . . . . 9 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → ((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) = (𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))))
82	81	eqcomd 2767	. . . . . . . 8 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → (𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))) = ((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛))
83	82	oveq1d 7405	. . . . . . 7 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → ((𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))) ∗ (𝑛 ↑ 𝑋)) = (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)))
84	83	eqeq1d 2763	. . . . . 6 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → (((𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄) ↔ (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)))
85	84	imbi2d 342	. . . . 5 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → ((𝑠 < 𝑛 → ((𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)) ↔ (𝑠 < 𝑛 → (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))))
86	85	ralbidva 3182	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ((𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)) ↔ ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))))
87	86	rexbidv 3185	. . 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 14004	1 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑙 ∈ ℕ0 ↦ ((𝐴 Σg (𝑘 ∈ (0...𝑙) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑙 − 𝑘))))) ∗ (𝑙 ↑ 𝑋))) finSupp (0g‘𝑄))

Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1097   = wceq 1559   ∈ wcel 2141  ∀wral 3075  ∃wrex 3085  Vcvv 3453   class class class wbr 5097   ↦ cmpt 5178  ‘cfv 6515  (class class class)co 7390   ∈ cmpo 7392  Fincfn 8920   finSupp cfsupp 9300  0cc0 11066   < clt 11209   − cmin 11407  ℕ₀cn0 12474  ...cfz 13505  Basecbs 17235  ._rcmulr 17277  Scalarcsca 17279   ·_𝑠 cvsca 17280  0_gc0g 17458   Σ_g cgsu 17459  ._gcmg 19099  mulGrpcmgp 20176  Ringcrg 20269  LModclmod 20914  var₁cv1 22225  Poly₁cpl1 22226  coe₁cco1 22227   Mat cmat 22454   decompPMat cdecpmat 22809   pMatToMatPoly cpm2mp 22839

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5224  ax-sep 5243  ax-nul 5253  ax-pow 5319  ax-pr 5387  ax-un 7712  ax-cnex 11122  ax-resscn 11123  ax-1cn 11124  ax-icn 11125  ax-addcl 11126  ax-addrcl 11127  ax-mulcl 11128  ax-mulrcl 11129  ax-mulcom 11130  ax-addass 11131  ax-mulass 11132  ax-distr 11133  ax-i2m1 11134  ax-1ne0 11135  ax-1rid 11136  ax-rnegex 11137  ax-rrecex 11138  ax-cnre 11139  ax-pre-lttri 11140  ax-pre-lttrn 11141  ax-pre-ltadd 11142  ax-pre-mulgt0 11143

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3061  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-tp 4584  df-op 4586  df-ot 4588  df-uni 4863  df-int 4903  df-iun 4948  df-iin 4949  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5538  df-eprel 5543  df-po 5551  df-so 5552  df-fr 5596  df-se 5597  df-we 5598  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-pred 6282  df-ord 6343  df-on 6344  df-lim 6345  df-suc 6346  df-iota 6471  df-fun 6517  df-fn 6518  df-f 6519  df-f1 6520  df-fo 6521  df-f1o 6522  df-fv 6523  df-isom 6524  df-riota 7347  df-ov 7393  df-oprab 7394  df-mpo 7395  df-of 7654  df-ofr 7655  df-om 7841  df-1st 7964  df-2nd 7965  df-supp 8134  df-frecs 8255  df-wrecs 8286  df-recs 8335  df-rdg 8374  df-1o 8430  df-2o 8431  df-er 8671  df-map 8803  df-pm 8804  df-ixp 8873  df-en 8921  df-dom 8922  df-sdom 8923  df-fin 8924  df-fsupp 9301  df-sup 9381  df-oi 9451  df-card 9890  df-pnf 11211  df-mnf 11212  df-xr 11213  df-ltxr 11214  df-le 11215  df-sub 11409  df-neg 11410  df-nn 12204  df-2 12273  df-3 12274  df-4 12275  df-5 12276  df-6 12277  df-7 12278  df-8 12279  df-9 12280  df-n0 12475  df-z 12562  df-dec 12682  df-uz 12833  df-fz 13506  df-fzo 13653  df-seq 14008  df-hash 14337  df-struct 17173  df-sets 17190  df-slot 17208  df-ndx 17220  df-base 17236  df-ress 17257  df-plusg 17289  df-mulr 17290  df-sca 17292  df-vsca 17293  df-ip 17294  df-tset 17295  df-ple 17296  df-ds 17298  df-hom 17300  df-cco 17301  df-0g 17460  df-gsum 17461  df-prds 17466  df-pws 17468  df-mre 17604  df-mrc 17605  df-acs 17607  df-mgm 18664  df-sgrp 18743  df-mnd 18759  df-mhm 18807  df-submnd 18808  df-grp 18968  df-minusg 18969  df-sbg 18970  df-mulg 19100  df-subg 19155  df-ghm 19244  df-cntz 19347  df-cmn 19812  df-abl 19813  df-mgp 20177  df-rng 20189  df-ur 20218  df-ring 20271  df-subrng 20582  df-subrg 20606  df-lmod 20916  df-lss 20986  df-sra 21227  df-rgmod 21228  df-dsmm 21771  df-frlm 21786  df-psr 21948  df-mvr 21949  df-mpl 21950  df-opsr 21952  df-psr1 22229  df-vr1 22230  df-ply1 22231  df-coe1 22232  df-mamu 22438  df-mat 22455  df-decpmat 22810

This theorem is referenced by:  pm2mpmhmlem2  22866