Theorem pm2mpmhmlem1 22728

Description: Lemma 1 for pm2mpmhm 22730. (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 6832	. 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (0g‘𝑄) ∈ V)
2		ovexd 7376	. 2 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑙 ∈ ℕ0) → ((𝐴 Σg (𝑘 ∈ (0...𝑙) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑙 − 𝑘))))) ∗ (𝑙 ↑ 𝑋)) ∈ V)
3		oveq2 7349	. . . . 5 ⊢ (𝑙 = 𝑛 → (0...𝑙) = (0...𝑛))
4		oveq1 7348	. . . . . . 7 ⊢ (𝑙 = 𝑛 → (𝑙 − 𝑘) = (𝑛 − 𝑘))
5	4	oveq2d 7357	. . . . . 6 ⊢ (𝑙 = 𝑛 → (𝑦 decompPMat (𝑙 − 𝑘)) = (𝑦 decompPMat (𝑛 − 𝑘)))
6	5	oveq2d 7357	. . . . 5 ⊢ (𝑙 = 𝑛 → ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑙 − 𝑘))) = ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))
7	3, 6	mpteq12dv 5173	. . . 4 ⊢ (𝑙 = 𝑛 → (𝑘 ∈ (0...𝑙) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑙 − 𝑘)))) = (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘)))))
8	7	oveq2d 7357	. . 3 ⊢ (𝑙 = 𝑛 → (𝐴 Σg (𝑘 ∈ (0...𝑙) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑙 − 𝑘))))) = (𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))))
9		oveq1 7348	. . 3 ⊢ (𝑙 = 𝑛 → (𝑙 ↑ 𝑋) = (𝑛 ↑ 𝑋))
10	8, 9	oveq12d 7359	. 2 ⊢ (𝑙 = 𝑛 → ((𝐴 Σg (𝑘 ∈ (0...𝑙) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑙 − 𝑘))))) ∗ (𝑙 ↑ 𝑋)) = ((𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))) ∗ (𝑛 ↑ 𝑋)))
11		simpll 766	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑁 ∈ Fin)
12		simplr 768	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑅 ∈ Ring)
13		pm2mpfo.p	. . . . . . . . . 10 ⊢ 𝑃 = (Poly1‘𝑅)
14		pm2mpfo.c	. . . . . . . . . 10 ⊢ 𝐶 = (𝑁 Mat 𝑃)
15	13, 14	pmatring 22602	. . . . . . . . 9 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐶 ∈ Ring)
16	15	anim1i 615	. . . . . . . 8 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝐶 ∈ Ring ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)))
17		3anass 1094	. . . . . . . 8 ⊢ ((𝐶 ∈ Ring ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ↔ (𝐶 ∈ Ring ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)))
18	16, 17	sylibr 234	. . . . . . 7 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝐶 ∈ Ring ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵))
19		pm2mpfo.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝐶)
20		eqid 2731	. . . . . . . 8 ⊢ (.r‘𝐶) = (.r‘𝐶)
21	19, 20	ringcl 20163	. . . . . . 7 ⊢ ((𝐶 ∈ Ring ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥(.r‘𝐶)𝑦) ∈ 𝐵)
22	18, 21	syl 17	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(.r‘𝐶)𝑦) ∈ 𝐵)
23		eqid 2731	. . . . . . 7 ⊢ (0g‘𝑅) = (0g‘𝑅)
24	13, 14, 19, 23	pmatcoe1fsupp 22611	. . . . . 6 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ (𝑥(.r‘𝐶)𝑦) ∈ 𝐵) → ∃𝑠 ∈ ℕ0 ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)))
25	11, 12, 22, 24	syl3anc 1373	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∃𝑠 ∈ ℕ0 ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)))
26		fvoveq1 7364	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 = 𝑖 → (coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏)) = (coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑏)))
27	26	fveq1d 6819	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑎 = 𝑖 → ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛))
28	27	eqeq1d 2733	. . . . . . . . . . . . . . . . 17 ⊢ (𝑎 = 𝑖 → (((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅) ↔ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)))
29		oveq2 7349	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑏 = 𝑗 → (𝑖(𝑥(.r‘𝐶)𝑦)𝑏) = (𝑖(𝑥(.r‘𝐶)𝑦)𝑗))
30	29	fveq2d 6821	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑏 = 𝑗 → (coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑏)) = (coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗)))
31	30	fveq1d 6819	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑏 = 𝑗 → ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛))
32	31	eqeq1d 2733	. . . . . . . . . . . . . . . . 17 ⊢ (𝑏 = 𝑗 → (((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅) ↔ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛) = (0g‘𝑅)))
33	28, 32	rspc2va 3584	. . . . . . . . . . . . . . . 16 ⊢ (((𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛) = (0g‘𝑅))
34	33	expcom 413	. . . . . . . . . . . . . . 15 ⊢ (∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅) → ((𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛) = (0g‘𝑅)))
35	34	adantl 481	. . . . . . . . . . . . . 14 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → ((𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛) = (0g‘𝑅)))
36	35	3impib 1116	. . . . . . . . . . . . 13 ⊢ ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛) = (0g‘𝑅))
37	36	mpoeq3dva 7418	. . . . . . . . . . . 12 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (0g‘𝑅)))
38		pm2mpfo.a	. . . . . . . . . . . . . 14 ⊢ 𝐴 = (𝑁 Mat 𝑅)
39	38, 23	mat0op 22329	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (0g‘𝐴) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (0g‘𝑅)))
40	39	ad3antrrr 730	. . . . . . . . . . . 12 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → (0g‘𝐴) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (0g‘𝑅)))
41	38	matring 22353	. . . . . . . . . . . . . . 15 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐴 ∈ Ring)
42		pm2mpfo.q	. . . . . . . . . . . . . . . 16 ⊢ 𝑄 = (Poly1‘𝐴)
43	42	ply1sca 22160	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ Ring → 𝐴 = (Scalar‘𝑄))
44	41, 43	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐴 = (Scalar‘𝑄))
45	44	ad3antrrr 730	. . . . . . . . . . . . 13 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → 𝐴 = (Scalar‘𝑄))
46	45	fveq2d 6821	. . . . . . . . . . . 12 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → (0g‘𝐴) = (0g‘(Scalar‘𝑄)))
47	37, 40, 46	3eqtr2d 2772	. . . . . . . . . . 11 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) = (0g‘(Scalar‘𝑄)))
48	47	oveq1d 7356	. . . . . . . . . 10 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = ((0g‘(Scalar‘𝑄)) ∗ (𝑛 ↑ 𝑋)))
49	42	ply1lmod 22159	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ Ring → 𝑄 ∈ LMod)
50	41, 49	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝑄 ∈ LMod)
51	50	adantr 480	. . . . . . . . . . . 12 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑄 ∈ LMod)
52	41	adantr 480	. . . . . . . . . . . . 13 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐴 ∈ Ring)
53		pm2mpfo.x	. . . . . . . . . . . . . 14 ⊢ 𝑋 = (var1‘𝐴)
54		eqid 2731	. . . . . . . . . . . . . 14 ⊢ (mulGrp‘𝑄) = (mulGrp‘𝑄)
55		pm2mpfo.e	. . . . . . . . . . . . . 14 ⊢ ↑ = (.g‘(mulGrp‘𝑄))
56		pm2mpfo.l	. . . . . . . . . . . . . 14 ⊢ 𝐿 = (Base‘𝑄)
57	42, 53, 54, 55, 56	ply1moncl 22180	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ Ring ∧ 𝑛 ∈ ℕ0) → (𝑛 ↑ 𝑋) ∈ 𝐿)
58	52, 57	sylan 580	. . . . . . . . . . . 12 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → (𝑛 ↑ 𝑋) ∈ 𝐿)
59		eqid 2731	. . . . . . . . . . . . 13 ⊢ (Scalar‘𝑄) = (Scalar‘𝑄)
60		pm2mpfo.m	. . . . . . . . . . . . 13 ⊢ ∗ = ( ·𝑠 ‘𝑄)
61		eqid 2731	. . . . . . . . . . . . 13 ⊢ (0g‘(Scalar‘𝑄)) = (0g‘(Scalar‘𝑄))
62		eqid 2731	. . . . . . . . . . . . 13 ⊢ (0g‘𝑄) = (0g‘𝑄)
63	56, 59, 60, 61, 62	lmod0vs 20823	. . . . . . . . . . . 12 ⊢ ((𝑄 ∈ LMod ∧ (𝑛 ↑ 𝑋) ∈ 𝐿) → ((0g‘(Scalar‘𝑄)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))
64	51, 58, 63	syl2an2r 685	. . . . . . . . . . 11 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → ((0g‘(Scalar‘𝑄)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))
65	64	adantr 480	. . . . . . . . . 10 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → ((0g‘(Scalar‘𝑄)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))
66	48, 65	eqtrd 2766	. . . . . . . . 9 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) ∧ ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))
67	66	ex 412	. . . . . . . 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 3144	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ∀𝑎 ∈ 𝑁 ∀𝑏 ∈ 𝑁 ((coe1‘(𝑎(𝑥(.r‘𝐶)𝑦)𝑏))‘𝑛) = (0g‘𝑅)) → ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))))
70	69	reximdv 3147	. . . . 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 22675	. . . . . . . . . 10 ⊢ (((𝑥(.r‘𝐶)𝑦) ∈ 𝐵 ∧ 𝑛 ∈ ℕ0) → ((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)))
73	22, 72	sylan 580	. . . . . . . . 9 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → ((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)))
74	73	oveq1d 7356	. . . . . . . 8 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)))
75	74	eqeq1d 2733	. . . . . . 7 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → ((((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄) ↔ ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)))
76	75	imbi2d 340	. . . . . 6 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → ((𝑠 < 𝑛 → (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)) ↔ (𝑠 < 𝑛 → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))))
77	76	ralbidva 3153	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)) ↔ ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))))
78	77	rexbidv 3156	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (∃𝑠 ∈ ℕ0 ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)) ↔ ∃𝑠 ∈ ℕ0 ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ ((coe1‘(𝑖(𝑥(.r‘𝐶)𝑦)𝑗))‘𝑛)) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))))
79	71, 78	mpbird 257	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∃𝑠 ∈ ℕ0 ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)))
80	13, 14, 19, 38	decpmatmul 22682	. . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑛 ∈ ℕ0) → ((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) = (𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))))
81	80	ad4ant234 1176	. . . . . . . . 9 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → ((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) = (𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))))
82	81	eqcomd 2737	. . . . . . . 8 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → (𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))) = ((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛))
83	82	oveq1d 7356	. . . . . . 7 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → ((𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))) ∗ (𝑛 ↑ 𝑋)) = (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)))
84	83	eqeq1d 2733	. . . . . 6 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → (((𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄) ↔ (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)))
85	84	imbi2d 340	. . . . 5 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑛 ∈ ℕ0) → ((𝑠 < 𝑛 → ((𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)) ↔ (𝑠 < 𝑛 → (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))))
86	85	ralbidva 3153	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ((𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)) ↔ ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))))
87	86	rexbidv 3156	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (∃𝑠 ∈ ℕ0 ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ((𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)) ↔ ∃𝑠 ∈ ℕ0 ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → (((𝑥(.r‘𝐶)𝑦) decompPMat 𝑛) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄))))
88	79, 87	mpbird 257	. 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∃𝑠 ∈ ℕ0 ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → ((𝐴 Σg (𝑘 ∈ (0...𝑛) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑛 − 𝑘))))) ∗ (𝑛 ↑ 𝑋)) = (0g‘𝑄)))
89	1, 2, 10, 88	mptnn0fsuppd 13900	1 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑙 ∈ ℕ0 ↦ ((𝐴 Σg (𝑘 ∈ (0...𝑙) ↦ ((𝑥 decompPMat 𝑘)(.r‘𝐴)(𝑦 decompPMat (𝑙 − 𝑘))))) ∗ (𝑙 ↑ 𝑋))) finSupp (0g‘𝑄))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2111  ∀wral 3047  ∃wrex 3056  Vcvv 3436   class class class wbr 5086   ↦ cmpt 5167  ‘cfv 6476  (class class class)co 7341   ∈ cmpo 7343  Fincfn 8864   finSupp cfsupp 9240  0cc0 11001   < clt 11141   − cmin 11339  ℕ₀cn0 12376  ...cfz 13402  Basecbs 17115  ._rcmulr 17157  Scalarcsca 17159   ·_𝑠 cvsca 17160  0_gc0g 17338   Σ_g cgsu 17339  ._gcmg 18975  mulGrpcmgp 20053  Ringcrg 20146  LModclmod 20788  var₁cv1 22083  Poly₁cpl1 22084  coe₁cco1 22085   Mat cmat 22317   decompPMat cdecpmat 22672   pMatToMatPoly cpm2mp 22702

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5212  ax-sep 5229  ax-nul 5239  ax-pow 5298  ax-pr 5365  ax-un 7663  ax-cnex 11057  ax-resscn 11058  ax-1cn 11059  ax-icn 11060  ax-addcl 11061  ax-addrcl 11062  ax-mulcl 11063  ax-mulrcl 11064  ax-mulcom 11065  ax-addass 11066  ax-mulass 11067  ax-distr 11068  ax-i2m1 11069  ax-1ne0 11070  ax-1rid 11071  ax-rnegex 11072  ax-rrecex 11073  ax-cnre 11074  ax-pre-lttri 11075  ax-pre-lttrn 11076  ax-pre-ltadd 11077  ax-pre-mulgt0 11078

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-nel 3033  df-ral 3048  df-rex 3057  df-rmo 3346  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3917  df-nul 4279  df-if 4471  df-pw 4547  df-sn 4572  df-pr 4574  df-tp 4576  df-op 4578  df-ot 4580  df-uni 4855  df-int 4893  df-iun 4938  df-iin 4939  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5506  df-eprel 5511  df-po 5519  df-so 5520  df-fr 5564  df-se 5565  df-we 5566  df-xp 5617  df-rel 5618  df-cnv 5619  df-co 5620  df-dm 5621  df-rn 5622  df-res 5623  df-ima 5624  df-pred 6243  df-ord 6304  df-on 6305  df-lim 6306  df-suc 6307  df-iota 6432  df-fun 6478  df-fn 6479  df-f 6480  df-f1 6481  df-fo 6482  df-f1o 6483  df-fv 6484  df-isom 6485  df-riota 7298  df-ov 7344  df-oprab 7345  df-mpo 7346  df-of 7605  df-ofr 7606  df-om 7792  df-1st 7916  df-2nd 7917  df-supp 8086  df-frecs 8206  df-wrecs 8237  df-recs 8286  df-rdg 8324  df-1o 8380  df-2o 8381  df-er 8617  df-map 8747  df-pm 8748  df-ixp 8817  df-en 8865  df-dom 8866  df-sdom 8867  df-fin 8868  df-fsupp 9241  df-sup 9321  df-oi 9391  df-card 9827  df-pnf 11143  df-mnf 11144  df-xr 11145  df-ltxr 11146  df-le 11147  df-sub 11341  df-neg 11342  df-nn 12121  df-2 12183  df-3 12184  df-4 12185  df-5 12186  df-6 12187  df-7 12188  df-8 12189  df-9 12190  df-n0 12377  df-z 12464  df-dec 12584  df-uz 12728  df-fz 13403  df-fzo 13550  df-seq 13904  df-hash 14233  df-struct 17053  df-sets 17070  df-slot 17088  df-ndx 17100  df-base 17116  df-ress 17137  df-plusg 17169  df-mulr 17170  df-sca 17172  df-vsca 17173  df-ip 17174  df-tset 17175  df-ple 17176  df-ds 17178  df-hom 17180  df-cco 17181  df-0g 17340  df-gsum 17341  df-prds 17346  df-pws 17348  df-mre 17483  df-mrc 17484  df-acs 17486  df-mgm 18543  df-sgrp 18622  df-mnd 18638  df-mhm 18686  df-submnd 18687  df-grp 18844  df-minusg 18845  df-sbg 18846  df-mulg 18976  df-subg 19031  df-ghm 19120  df-cntz 19224  df-cmn 19689  df-abl 19690  df-mgp 20054  df-rng 20066  df-ur 20095  df-ring 20148  df-subrng 20456  df-subrg 20480  df-lmod 20790  df-lss 20860  df-sra 21102  df-rgmod 21103  df-dsmm 21664  df-frlm 21679  df-psr 21841  df-mvr 21842  df-mpl 21843  df-opsr 21845  df-psr1 22087  df-vr1 22088  df-ply1 22089  df-coe1 22090  df-mamu 22301  df-mat 22318  df-decpmat 22673

This theorem is referenced by:  pm2mpmhmlem2  22729