Theorem cayleyhamilton1 21502

Description: The Cayley-Hamilton theorem: A matrix over a commutative ring "satisfies its own characteristic equation", or, in other words, a matrix over a commutative ring "inserted" into its characteristic polynomial results in zero. In this variant of cayleyhamilton 21500, the meaning of "inserted" is made more transparent: If the characteristic polynomial is a polynomial with coefficients (𝐹‘𝑛), then a matrix over a commutative ring "inserted" into its characteristic polynomial is the sum of these coefficients multiplied with the corresponding power of the matrix. (Contributed by AV, 25-Nov-2019.)

Hypotheses

Ref	Expression
cayleyhamilton.a	⊢ 𝐴 = (𝑁 Mat 𝑅)
cayleyhamilton.b	⊢ 𝐵 = (Base‘𝐴)
cayleyhamilton.0	⊢ 0 = (0g‘𝐴)
cayleyhamilton.c	⊢ 𝐶 = (𝑁 CharPlyMat 𝑅)
cayleyhamilton.k	⊢ 𝐾 = (coe1‘(𝐶‘𝑀))
cayleyhamilton.m	⊢ ∗ = ( ·𝑠 ‘𝐴)
cayleyhamilton.e	⊢ ↑ = (.g‘(mulGrp‘𝐴))
cayleyhamilton1.l	⊢ 𝐿 = (Base‘𝑅)
cayleyhamilton1.x	⊢ 𝑋 = (var1‘𝑅)
cayleyhamilton1.p	⊢ 𝑃 = (Poly1‘𝑅)
cayleyhamilton1.m	⊢ · = ( ·𝑠 ‘𝑃)
cayleyhamilton1.e	⊢ 𝐸 = (.g‘(mulGrp‘𝑃))
cayleyhamilton1.z	⊢ 𝑍 = (0g‘𝑅)

Assertion

Ref	Expression
cayleyhamilton1	⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → ((𝐶‘𝑀) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋)))) → (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = 0 ))

Distinct variable groups:   𝐴,𝑛   𝐵,𝑛   𝐶,𝑛   𝑛,𝑀   𝑛,𝑁   𝑅,𝑛   ∗ ,𝑛   ↑ ,𝑛   𝑛,𝐸   𝑛,𝐹   𝑛,𝐿   𝑃,𝑛   𝑛,𝑋   𝑛,𝑍   · ,𝑛

Allowed substitution hints:   𝐾(𝑛)   0 (𝑛)

Proof of Theorem cayleyhamilton1

Dummy variables 𝑚 𝑖 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cayleyhamilton.a	. . . 4 ⊢ 𝐴 = (𝑁 Mat 𝑅)
2		cayleyhamilton.b	. . . 4 ⊢ 𝐵 = (Base‘𝐴)
3		cayleyhamilton.0	. . . 4 ⊢ 0 = (0g‘𝐴)
4		cayleyhamilton.c	. . . 4 ⊢ 𝐶 = (𝑁 CharPlyMat 𝑅)
5		cayleyhamilton.k	. . . 4 ⊢ 𝐾 = (coe1‘(𝐶‘𝑀))
6		cayleyhamilton.m	. . . 4 ⊢ ∗ = ( ·𝑠 ‘𝐴)
7		cayleyhamilton.e	. . . 4 ⊢ ↑ = (.g‘(mulGrp‘𝐴))
8	1, 2, 3, 4, 5, 6, 7	cayleyhamilton 21500	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐾‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = 0 )
9	8	adantr 483	. 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐾‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = 0 )
10		nfv 1915	. . . . . . . 8 ⊢ Ⅎ𝑛((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍))
11		nfcv 2979	. . . . . . . . . 10 ⊢ Ⅎ𝑛𝑃
12		nfcv 2979	. . . . . . . . . 10 ⊢ Ⅎ𝑛 Σg
13		nfmpt1 5166	. . . . . . . . . 10 ⊢ Ⅎ𝑛(𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋)))
14	11, 12, 13	nfov 7188	. . . . . . . . 9 ⊢ Ⅎ𝑛(𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋))))
15	14	nfeq2 2997	. . . . . . . 8 ⊢ Ⅎ𝑛(𝐶‘𝑀) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋))))
16	10, 15	nfan 1900	. . . . . . 7 ⊢ Ⅎ𝑛(((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) ∧ (𝐶‘𝑀) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋)))))
17		crngring 19310	. . . . . . . . . . . . 13 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring)
18	17	3ad2ant2 1130	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → 𝑅 ∈ Ring)
19	18	adantr 483	. . . . . . . . . . 11 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → 𝑅 ∈ Ring)
20		cayleyhamilton1.p	. . . . . . . . . . . . 13 ⊢ 𝑃 = (Poly1‘𝑅)
21		eqid 2823	. . . . . . . . . . . . 13 ⊢ (Base‘𝑃) = (Base‘𝑃)
22	4, 1, 2, 20, 21	chpmatply1 21442	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (𝐶‘𝑀) ∈ (Base‘𝑃))
23	22	adantr 483	. . . . . . . . . . 11 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → (𝐶‘𝑀) ∈ (Base‘𝑃))
24		cayleyhamilton1.x	. . . . . . . . . . . 12 ⊢ 𝑋 = (var1‘𝑅)
25		cayleyhamilton1.e	. . . . . . . . . . . 12 ⊢ 𝐸 = (.g‘(mulGrp‘𝑃))
26		cayleyhamilton1.l	. . . . . . . . . . . 12 ⊢ 𝐿 = (Base‘𝑅)
27		cayleyhamilton1.m	. . . . . . . . . . . 12 ⊢ · = ( ·𝑠 ‘𝑃)
28		eqid 2823	. . . . . . . . . . . 12 ⊢ (0g‘𝑅) = (0g‘𝑅)
29		elmapi 8430	. . . . . . . . . . . . . 14 ⊢ (𝐹 ∈ (𝐿 ↑m ℕ0) → 𝐹:ℕ0⟶𝐿)
30		ffvelrn 6851	. . . . . . . . . . . . . . 15 ⊢ ((𝐹:ℕ0⟶𝐿 ∧ 𝑛 ∈ ℕ0) → (𝐹‘𝑛) ∈ 𝐿)
31	30	ralrimiva 3184	. . . . . . . . . . . . . 14 ⊢ (𝐹:ℕ0⟶𝐿 → ∀𝑛 ∈ ℕ0 (𝐹‘𝑛) ∈ 𝐿)
32	29, 31	syl 17	. . . . . . . . . . . . 13 ⊢ (𝐹 ∈ (𝐿 ↑m ℕ0) → ∀𝑛 ∈ ℕ0 (𝐹‘𝑛) ∈ 𝐿)
33	32	ad2antrl 726	. . . . . . . . . . . 12 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → ∀𝑛 ∈ ℕ0 (𝐹‘𝑛) ∈ 𝐿)
34	29	feqmptd 6735	. . . . . . . . . . . . . . 15 ⊢ (𝐹 ∈ (𝐿 ↑m ℕ0) → 𝐹 = (𝑛 ∈ ℕ0 ↦ (𝐹‘𝑛)))
35		cayleyhamilton1.z	. . . . . . . . . . . . . . . 16 ⊢ 𝑍 = (0g‘𝑅)
36	35	a1i 11	. . . . . . . . . . . . . . 15 ⊢ (𝐹 ∈ (𝐿 ↑m ℕ0) → 𝑍 = (0g‘𝑅))
37	34, 36	breq12d 5081	. . . . . . . . . . . . . 14 ⊢ (𝐹 ∈ (𝐿 ↑m ℕ0) → (𝐹 finSupp 𝑍 ↔ (𝑛 ∈ ℕ0 ↦ (𝐹‘𝑛)) finSupp (0g‘𝑅)))
38	37	biimpa 479	. . . . . . . . . . . . 13 ⊢ ((𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍) → (𝑛 ∈ ℕ0 ↦ (𝐹‘𝑛)) finSupp (0g‘𝑅))
39	38	adantl 484	. . . . . . . . . . . 12 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → (𝑛 ∈ ℕ0 ↦ (𝐹‘𝑛)) finSupp (0g‘𝑅))
40	20, 21, 24, 25, 19, 26, 27, 28, 33, 39	gsumsmonply1 20473	. . . . . . . . . . 11 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋)))) ∈ (Base‘𝑃))
41		fveq2 6672	. . . . . . . . . . . . . . . 16 ⊢ (𝑖 = 𝑛 → (𝐹‘𝑖) = (𝐹‘𝑛))
42		oveq1 7165	. . . . . . . . . . . . . . . 16 ⊢ (𝑖 = 𝑛 → (𝑖𝐸𝑋) = (𝑛𝐸𝑋))
43	41, 42	oveq12d 7176	. . . . . . . . . . . . . . 15 ⊢ (𝑖 = 𝑛 → ((𝐹‘𝑖) · (𝑖𝐸𝑋)) = ((𝐹‘𝑛) · (𝑛𝐸𝑋)))
44	43	cbvmptv 5171	. . . . . . . . . . . . . 14 ⊢ (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋))) = (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋)))
45	44	oveq2i 7169	. . . . . . . . . . . . 13 ⊢ (𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋))))
46	45	fveq2i 6675	. . . . . . . . . . . 12 ⊢ (coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋))))) = (coe1‘(𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋)))))
47	20, 21, 5, 46	ply1coe1eq 20468	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ Ring ∧ (𝐶‘𝑀) ∈ (Base‘𝑃) ∧ (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋)))) ∈ (Base‘𝑃)) → (∀𝑚 ∈ ℕ0 (𝐾‘𝑚) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑚) ↔ (𝐶‘𝑀) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋))))))
48	19, 23, 40, 47	syl3anc 1367	. . . . . . . . . 10 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → (∀𝑚 ∈ ℕ0 (𝐾‘𝑚) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑚) ↔ (𝐶‘𝑀) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋))))))
49		fveq2 6672	. . . . . . . . . . . . . . 15 ⊢ (𝑚 = 𝑛 → (𝐾‘𝑚) = (𝐾‘𝑛))
50		fveq2 6672	. . . . . . . . . . . . . . 15 ⊢ (𝑚 = 𝑛 → ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑚) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑛))
51	49, 50	eqeq12d 2839	. . . . . . . . . . . . . 14 ⊢ (𝑚 = 𝑛 → ((𝐾‘𝑚) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑚) ↔ (𝐾‘𝑛) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑛)))
52	51	rspcva 3623	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ ℕ0 ∧ ∀𝑚 ∈ ℕ0 (𝐾‘𝑚) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑚)) → (𝐾‘𝑛) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑛))
53		simpl 485	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐾‘𝑛) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑛) ∧ (𝑛 ∈ ℕ0 ∧ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)))) → (𝐾‘𝑛) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑛))
54	18	ad2antrl 726	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑛 ∈ ℕ0 ∧ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍))) → 𝑅 ∈ Ring)
55		ffvelrn 6851	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝐹:ℕ0⟶𝐿 ∧ 𝑖 ∈ ℕ0) → (𝐹‘𝑖) ∈ 𝐿)
56	55	ralrimiva 3184	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝐹:ℕ0⟶𝐿 → ∀𝑖 ∈ ℕ0 (𝐹‘𝑖) ∈ 𝐿)
57	29, 56	syl 17	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝐹 ∈ (𝐿 ↑m ℕ0) → ∀𝑖 ∈ ℕ0 (𝐹‘𝑖) ∈ 𝐿)
58	57	ad2antrl 726	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → ∀𝑖 ∈ ℕ0 (𝐹‘𝑖) ∈ 𝐿)
59	58	adantl 484	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑛 ∈ ℕ0 ∧ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍))) → ∀𝑖 ∈ ℕ0 (𝐹‘𝑖) ∈ 𝐿)
60	29	feqmptd 6735	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝐹 ∈ (𝐿 ↑m ℕ0) → 𝐹 = (𝑖 ∈ ℕ0 ↦ (𝐹‘𝑖)))
61	60	breq1d 5078	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝐹 ∈ (𝐿 ↑m ℕ0) → (𝐹 finSupp 𝑍 ↔ (𝑖 ∈ ℕ0 ↦ (𝐹‘𝑖)) finSupp 𝑍))
62	61	biimpa 479	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍) → (𝑖 ∈ ℕ0 ↦ (𝐹‘𝑖)) finSupp 𝑍)
63	62	adantl 484	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → (𝑖 ∈ ℕ0 ↦ (𝐹‘𝑖)) finSupp 𝑍)
64	63	adantl 484	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑛 ∈ ℕ0 ∧ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍))) → (𝑖 ∈ ℕ0 ↦ (𝐹‘𝑖)) finSupp 𝑍)
65		simpl 485	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑛 ∈ ℕ0 ∧ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍))) → 𝑛 ∈ ℕ0)
66	20, 21, 24, 25, 54, 26, 27, 35, 59, 64, 65	gsummoncoe1 20474	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑛 ∈ ℕ0 ∧ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍))) → ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑛) = ⦋𝑛 / 𝑖⦌(𝐹‘𝑖))
67		csbfv 6717	. . . . . . . . . . . . . . . . . . 19 ⊢ ⦋𝑛 / 𝑖⦌(𝐹‘𝑖) = (𝐹‘𝑛)
68	66, 67	syl6eq 2874	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑛 ∈ ℕ0 ∧ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍))) → ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑛) = (𝐹‘𝑛))
69	68	adantl 484	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐾‘𝑛) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑛) ∧ (𝑛 ∈ ℕ0 ∧ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)))) → ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑛) = (𝐹‘𝑛))
70	53, 69	eqtrd 2858	. . . . . . . . . . . . . . . 16 ⊢ (((𝐾‘𝑛) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑛) ∧ (𝑛 ∈ ℕ0 ∧ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)))) → (𝐾‘𝑛) = (𝐹‘𝑛))
71	70	exp32 423	. . . . . . . . . . . . . . 15 ⊢ ((𝐾‘𝑛) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑛) → (𝑛 ∈ ℕ0 → (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → (𝐾‘𝑛) = (𝐹‘𝑛))))
72	71	com12 32	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ℕ0 → ((𝐾‘𝑛) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑛) → (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → (𝐾‘𝑛) = (𝐹‘𝑛))))
73	72	adantr 483	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ ℕ0 ∧ ∀𝑚 ∈ ℕ0 (𝐾‘𝑚) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑚)) → ((𝐾‘𝑛) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑛) → (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → (𝐾‘𝑛) = (𝐹‘𝑛))))
74	52, 73	mpd 15	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ ℕ0 ∧ ∀𝑚 ∈ ℕ0 (𝐾‘𝑚) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑚)) → (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → (𝐾‘𝑛) = (𝐹‘𝑛)))
75	74	com12 32	. . . . . . . . . . 11 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → ((𝑛 ∈ ℕ0 ∧ ∀𝑚 ∈ ℕ0 (𝐾‘𝑚) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑚)) → (𝐾‘𝑛) = (𝐹‘𝑛)))
76	75	expcomd 419	. . . . . . . . . 10 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → (∀𝑚 ∈ ℕ0 (𝐾‘𝑚) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑚) → (𝑛 ∈ ℕ0 → (𝐾‘𝑛) = (𝐹‘𝑛))))
77	48, 76	sylbird 262	. . . . . . . . 9 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → ((𝐶‘𝑀) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋)))) → (𝑛 ∈ ℕ0 → (𝐾‘𝑛) = (𝐹‘𝑛))))
78	77	imp31 420	. . . . . . . 8 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) ∧ (𝐶‘𝑀) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋))))) ∧ 𝑛 ∈ ℕ0) → (𝐾‘𝑛) = (𝐹‘𝑛))
79	78	oveq1d 7173	. . . . . . 7 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) ∧ (𝐶‘𝑀) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋))))) ∧ 𝑛 ∈ ℕ0) → ((𝐾‘𝑛) ∗ (𝑛 ↑ 𝑀)) = ((𝐹‘𝑛) ∗ (𝑛 ↑ 𝑀)))
80	16, 79	mpteq2da 5162	. . . . . 6 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) ∧ (𝐶‘𝑀) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋))))) → (𝑛 ∈ ℕ0 ↦ ((𝐾‘𝑛) ∗ (𝑛 ↑ 𝑀))) = (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) ∗ (𝑛 ↑ 𝑀))))
81	80	oveq2d 7174	. . . . 5 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) ∧ (𝐶‘𝑀) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋))))) → (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐾‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) ∗ (𝑛 ↑ 𝑀)))))
82	81	eqeq1d 2825	. . . 4 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) ∧ (𝐶‘𝑀) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋))))) → ((𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐾‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = 0 ↔ (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = 0 ))
83	82	biimpd 231	. . 3 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) ∧ (𝐶‘𝑀) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋))))) → ((𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐾‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = 0 → (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = 0 ))
84	83	ex 415	. 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → ((𝐶‘𝑀) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋)))) → ((𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐾‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = 0 → (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = 0 )))
85	9, 84	mpid 44	1 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → ((𝐶‘𝑀) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋)))) → (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = 0 ))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1537   ∈ wcel 2114  ∀wral 3140  ⦋csb 3885   class class class wbr 5068   ↦ cmpt 5148  ⟶wf 6353  ‘cfv 6357  (class class class)co 7158   ↑_m cmap 8408  Fincfn 8511   finSupp cfsupp 8835  ℕ₀cn0 11900  Basecbs 16485   ·_𝑠 cvsca 16571  0_gc0g 16715   Σ_g cgsu 16716  ._gcmg 18226  mulGrpcmgp 19241  Ringcrg 19299  CRingccrg 19300  var₁cv1 20346  Poly₁cpl1 20347  coe₁cco1 20348   Mat cmat 21018   CharPlyMat cchpmat 21436

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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-cnex 10595  ax-resscn 10596  ax-1cn 10597  ax-icn 10598  ax-addcl 10599  ax-addrcl 10600  ax-mulcl 10601  ax-mulrcl 10602  ax-mulcom 10603  ax-addass 10604  ax-mulass 10605  ax-distr 10606  ax-i2m1 10607  ax-1ne0 10608  ax-1rid 10609  ax-rnegex 10610  ax-rrecex 10611  ax-cnre 10612  ax-pre-lttri 10613  ax-pre-lttrn 10614  ax-pre-ltadd 10615  ax-pre-mulgt0 10616  ax-addf 10618  ax-mulf 10619

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-xor 1502  df-tru 1540  df-fal 1550  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-nel 3126  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-ot 4578  df-uni 4841  df-int 4879  df-iun 4923  df-iin 4924  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-se 5517  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-isom 6366  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-of 7411  df-ofr 7412  df-om 7583  df-1st 7691  df-2nd 7692  df-supp 7833  df-tpos 7894  df-cur 7935  df-wrecs 7949  df-recs 8010  df-rdg 8048  df-1o 8104  df-2o 8105  df-oadd 8108  df-er 8291  df-map 8410  df-pm 8411  df-ixp 8464  df-en 8512  df-dom 8513  df-sdom 8514  df-fin 8515  df-fsupp 8836  df-sup 8908  df-oi 8976  df-card 9370  df-pnf 10679  df-mnf 10680  df-xr 10681  df-ltxr 10682  df-le 10683  df-sub 10874  df-neg 10875  df-div 11300  df-nn 11641  df-2 11703  df-3 11704  df-4 11705  df-5 11706  df-6 11707  df-7 11708  df-8 11709  df-9 11710  df-n0 11901  df-xnn0 11971  df-z 11985  df-dec 12102  df-uz 12247  df-rp 12393  df-fz 12896  df-fzo 13037  df-seq 13373  df-exp 13433  df-hash 13694  df-word 13865  df-lsw 13917  df-concat 13925  df-s1 13952  df-substr 14005  df-pfx 14035  df-splice 14114  df-reverse 14123  df-s2 14212  df-struct 16487  df-ndx 16488  df-slot 16489  df-base 16491  df-sets 16492  df-ress 16493  df-plusg 16580  df-mulr 16581  df-starv 16582  df-sca 16583  df-vsca 16584  df-ip 16585  df-tset 16586  df-ple 16587  df-ds 16589  df-unif 16590  df-hom 16591  df-cco 16592  df-0g 16717  df-gsum 16718  df-prds 16723  df-pws 16725  df-mre 16859  df-mrc 16860  df-acs 16862  df-mgm 17854  df-sgrp 17903  df-mnd 17914  df-mhm 17958  df-submnd 17959  df-efmnd 18036  df-grp 18108  df-minusg 18109  df-sbg 18110  df-mulg 18227  df-subg 18278  df-ghm 18358  df-gim 18401  df-cntz 18449  df-oppg 18476  df-symg 18498  df-pmtr 18572  df-psgn 18621  df-evpm 18622  df-cmn 18910  df-abl 18911  df-mgp 19242  df-ur 19254  df-srg 19258  df-ring 19301  df-cring 19302  df-oppr 19375  df-dvdsr 19393  df-unit 19394  df-invr 19424  df-dvr 19435  df-rnghom 19469  df-drng 19506  df-subrg 19535  df-lmod 19638  df-lss 19706  df-sra 19946  df-rgmod 19947  df-assa 20087  df-ascl 20089  df-psr 20138  df-mvr 20139  df-mpl 20140  df-opsr 20142  df-psr1 20350  df-vr1 20351  df-ply1 20352  df-coe1 20353  df-cnfld 20548  df-zring 20620  df-zrh 20653  df-dsmm 20878  df-frlm 20893  df-mamu 20997  df-mat 21019  df-mdet 21196  df-madu 21245  df-cpmat 21316  df-mat2pmat 21317  df-cpmat2mat 21318  df-decpmat 21373  df-pm2mp 21403  df-chpmat 21437

This theorem is referenced by: (None)