Theorem cayleyhamilton1 22953

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 22951, 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 22951	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐾‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = 0 )
9	8	adantr 484	. 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐾‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = 0 )
10		nfv 1935	. . . . . . . 8 ⊢ Ⅎ𝑛((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍))
11		nfcv 2925	. . . . . . . . . 10 ⊢ Ⅎ𝑛𝑃
12		nfcv 2925	. . . . . . . . . 10 ⊢ Ⅎ𝑛 Σg
13		nfmpt1 5200	. . . . . . . . . 10 ⊢ Ⅎ𝑛(𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋)))
14	11, 12, 13	nfov 7427	. . . . . . . . 9 ⊢ Ⅎ𝑛(𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋))))
15	14	nfeq2 2942	. . . . . . . 8 ⊢ Ⅎ𝑛(𝐶‘𝑀) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋))))
16	10, 15	nfan 1920	. . . . . . 7 ⊢ Ⅎ𝑛(((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) ∧ (𝐶‘𝑀) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋)))))
17		crngring 20296	. . . . . . . . . . . . 13 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring)
18	17	3ad2ant2 1148	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → 𝑅 ∈ Ring)
19	18	adantr 484	. . . . . . . . . . 11 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → 𝑅 ∈ Ring)
20		cayleyhamilton1.p	. . . . . . . . . . . . 13 ⊢ 𝑃 = (Poly1‘𝑅)
21		eqid 2763	. . . . . . . . . . . . 13 ⊢ (Base‘𝑃) = (Base‘𝑃)
22	4, 1, 2, 20, 21	chpmatply1 22893	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (𝐶‘𝑀) ∈ (Base‘𝑃))
23	22	adantr 484	. . . . . . . . . . 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 2763	. . . . . . . . . . . 12 ⊢ (0g‘𝑅) = (0g‘𝑅)
29		elmapi 8831	. . . . . . . . . . . . . 14 ⊢ (𝐹 ∈ (𝐿 ↑m ℕ0) → 𝐹:ℕ0⟶𝐿)
30		ffvelcdm 7063	. . . . . . . . . . . . . . 15 ⊢ ((𝐹:ℕ0⟶𝐿 ∧ 𝑛 ∈ ℕ0) → (𝐹‘𝑛) ∈ 𝐿)
31	30	ralrimiva 3155	. . . . . . . . . . . . . 14 ⊢ (𝐹:ℕ0⟶𝐿 → ∀𝑛 ∈ ℕ0 (𝐹‘𝑛) ∈ 𝐿)
32	29, 31	syl 17	. . . . . . . . . . . . 13 ⊢ (𝐹 ∈ (𝐿 ↑m ℕ0) → ∀𝑛 ∈ ℕ0 (𝐹‘𝑛) ∈ 𝐿)
33	32	ad2antrl 738	. . . . . . . . . . . 12 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → ∀𝑛 ∈ ℕ0 (𝐹‘𝑛) ∈ 𝐿)
34	29	feqmptd 6936	. . . . . . . . . . . . . . 15 ⊢ (𝐹 ∈ (𝐿 ↑m ℕ0) → 𝐹 = (𝑛 ∈ ℕ0 ↦ (𝐹‘𝑛)))
35		cayleyhamilton1.z	. . . . . . . . . . . . . . . 16 ⊢ 𝑍 = (0g‘𝑅)
36	35	a1i 11	. . . . . . . . . . . . . . 15 ⊢ (𝐹 ∈ (𝐿 ↑m ℕ0) → 𝑍 = (0g‘𝑅))
37	34, 36	breq12d 5114	. . . . . . . . . . . . . 14 ⊢ (𝐹 ∈ (𝐿 ↑m ℕ0) → (𝐹 finSupp 𝑍 ↔ (𝑛 ∈ ℕ0 ↦ (𝐹‘𝑛)) finSupp (0g‘𝑅)))
38	37	biimpa 480	. . . . . . . . . . . . 13 ⊢ ((𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍) → (𝑛 ∈ ℕ0 ↦ (𝐹‘𝑛)) finSupp (0g‘𝑅))
39	38	adantl 485	. . . . . . . . . . . 12 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → (𝑛 ∈ ℕ0 ↦ (𝐹‘𝑛)) finSupp (0g‘𝑅))
40	20, 21, 24, 25, 19, 26, 27, 28, 33, 39	gsumsmonply1 22371	. . . . . . . . . . 11 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋)))) ∈ (Base‘𝑃))
41		fveq2 6868	. . . . . . . . . . . . . . . 16 ⊢ (𝑖 = 𝑛 → (𝐹‘𝑖) = (𝐹‘𝑛))
42		oveq1 7404	. . . . . . . . . . . . . . . 16 ⊢ (𝑖 = 𝑛 → (𝑖𝐸𝑋) = (𝑛𝐸𝑋))
43	41, 42	oveq12d 7415	. . . . . . . . . . . . . . 15 ⊢ (𝑖 = 𝑛 → ((𝐹‘𝑖) · (𝑖𝐸𝑋)) = ((𝐹‘𝑛) · (𝑛𝐸𝑋)))
44	43	cbvmptv 5205	. . . . . . . . . . . . . 14 ⊢ (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋))) = (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋)))
45	44	oveq2i 7408	. . . . . . . . . . . . 13 ⊢ (𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋))))
46	45	fveq2i 6871	. . . . . . . . . . . 12 ⊢ (coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋))))) = (coe1‘(𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋)))))
47	20, 21, 5, 46	ply1coe1eq 22364	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ Ring ∧ (𝐶‘𝑀) ∈ (Base‘𝑃) ∧ (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋)))) ∈ (Base‘𝑃)) → (∀𝑚 ∈ ℕ0 (𝐾‘𝑚) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑚) ↔ (𝐶‘𝑀) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋))))))
48	19, 23, 40, 47	syl3anc 1391	. . . . . . . . . 10 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → (∀𝑚 ∈ ℕ0 (𝐾‘𝑚) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑚) ↔ (𝐶‘𝑀) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋))))))
49		fveq2 6868	. . . . . . . . . . . . . . 15 ⊢ (𝑚 = 𝑛 → (𝐾‘𝑚) = (𝐾‘𝑛))
50		fveq2 6868	. . . . . . . . . . . . . . 15 ⊢ (𝑚 = 𝑛 → ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑚) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑛))
51	49, 50	eqeq12d 2779	. . . . . . . . . . . . . 14 ⊢ (𝑚 = 𝑛 → ((𝐾‘𝑚) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑚) ↔ (𝐾‘𝑛) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑛)))
52	51	rspcva 3580	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ ℕ0 ∧ ∀𝑚 ∈ ℕ0 (𝐾‘𝑚) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑚)) → (𝐾‘𝑛) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑛))
53		simpl 486	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐾‘𝑛) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑛) ∧ (𝑛 ∈ ℕ0 ∧ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)))) → (𝐾‘𝑛) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑛))
54	18	ad2antrl 738	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑛 ∈ ℕ0 ∧ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍))) → 𝑅 ∈ Ring)
55		ffvelcdm 7063	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝐹:ℕ0⟶𝐿 ∧ 𝑖 ∈ ℕ0) → (𝐹‘𝑖) ∈ 𝐿)
56	55	ralrimiva 3155	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝐹:ℕ0⟶𝐿 → ∀𝑖 ∈ ℕ0 (𝐹‘𝑖) ∈ 𝐿)
57	29, 56	syl 17	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝐹 ∈ (𝐿 ↑m ℕ0) → ∀𝑖 ∈ ℕ0 (𝐹‘𝑖) ∈ 𝐿)
58	57	ad2antrl 738	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → ∀𝑖 ∈ ℕ0 (𝐹‘𝑖) ∈ 𝐿)
59	58	adantl 485	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑛 ∈ ℕ0 ∧ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍))) → ∀𝑖 ∈ ℕ0 (𝐹‘𝑖) ∈ 𝐿)
60	29	feqmptd 6936	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝐹 ∈ (𝐿 ↑m ℕ0) → 𝐹 = (𝑖 ∈ ℕ0 ↦ (𝐹‘𝑖)))
61	60	breq1d 5111	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝐹 ∈ (𝐿 ↑m ℕ0) → (𝐹 finSupp 𝑍 ↔ (𝑖 ∈ ℕ0 ↦ (𝐹‘𝑖)) finSupp 𝑍))
62	61	biimpa 480	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍) → (𝑖 ∈ ℕ0 ↦ (𝐹‘𝑖)) finSupp 𝑍)
63	62	adantl 485	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) → (𝑖 ∈ ℕ0 ↦ (𝐹‘𝑖)) finSupp 𝑍)
64	63	adantl 485	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑛 ∈ ℕ0 ∧ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍))) → (𝑖 ∈ ℕ0 ↦ (𝐹‘𝑖)) finSupp 𝑍)
65		simpl 486	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑛 ∈ ℕ0 ∧ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍))) → 𝑛 ∈ ℕ0)
66	20, 21, 24, 25, 54, 26, 27, 35, 59, 64, 65	gsummoncoe1 22372	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑛 ∈ ℕ0 ∧ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍))) → ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑛) = ⦋𝑛 / 𝑖⦌(𝐹‘𝑖))
67		csbfv 6915	. . . . . . . . . . . . . . . . . . 19 ⊢ ⦋𝑛 / 𝑖⦌(𝐹‘𝑖) = (𝐹‘𝑛)
68	66, 67	eqtrdi 2814	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑛 ∈ ℕ0 ∧ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍))) → ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑛) = (𝐹‘𝑛))
69	68	adantl 485	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐾‘𝑛) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑛) ∧ (𝑛 ∈ ℕ0 ∧ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)))) → ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑛) = (𝐹‘𝑛))
70	53, 69	eqtrd 2798	. . . . . . . . . . . . . . . 16 ⊢ (((𝐾‘𝑛) = ((coe1‘(𝑃 Σg (𝑖 ∈ ℕ0 ↦ ((𝐹‘𝑖) · (𝑖𝐸𝑋)))))‘𝑛) ∧ (𝑛 ∈ ℕ0 ∧ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)))) → (𝐾‘𝑛) = (𝐹‘𝑛))
71	70	exp32 424	. . . . . . . . . . . . . . 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 484	. . . . . . . . . . . . 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 420	. . . . . . . . . 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 421	. . . . . . . 8 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) ∧ (𝐶‘𝑀) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋))))) ∧ 𝑛 ∈ ℕ0) → (𝐾‘𝑛) = (𝐹‘𝑛))
79	78	oveq1d 7412	. . . . . . 7 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) ∧ (𝐶‘𝑀) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋))))) ∧ 𝑛 ∈ ℕ0) → ((𝐾‘𝑛) ∗ (𝑛 ↑ 𝑀)) = ((𝐹‘𝑛) ∗ (𝑛 ↑ 𝑀)))
80	16, 79	mpteq2da 5193	. . . . . 6 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) ∧ (𝐶‘𝑀) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋))))) → (𝑛 ∈ ℕ0 ↦ ((𝐾‘𝑛) ∗ (𝑛 ↑ 𝑀))) = (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) ∗ (𝑛 ↑ 𝑀))))
81	80	oveq2d 7413	. . . . 5 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐹 ∈ (𝐿 ↑m ℕ0) ∧ 𝐹 finSupp 𝑍)) ∧ (𝐶‘𝑀) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) · (𝑛𝐸𝑋))))) → (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐾‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹‘𝑛) ∗ (𝑛 ↑ 𝑀)))))
82	81	eqeq1d 2765	. . . 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 416	. 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 399   ∧ w3a 1099   = wceq 1561   ∈ wcel 2143  ∀wral 3077  ⦋csb 3853   class class class wbr 5101   ↦ cmpt 5182  ⟶wf 6518  ‘cfv 6522  (class class class)co 7397   ↑_m cmap 8809  Fincfn 8928   finSupp cfsupp 9308  ℕ₀cn0 12482  Basecbs 17246   ·_𝑠 cvsca 17291  0_gc0g 17469   Σ_g cgsu 17470  ._gcmg 19110  mulGrpcmgp 20187  Ringcrg 20284  CRingccrg 20285  var₁cv1 22239  Poly₁cpl1 22240  coe₁cco1 22241   Mat cmat 22468   CharPlyMat cchpmat 22887

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1816  ax-4 1830  ax-5 1931  ax-6 1988  ax-7 2029  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5228  ax-sep 5247  ax-nul 5257  ax-pow 5323  ax-pr 5391  ax-un 7719  ax-cnex 11130  ax-resscn 11131  ax-1cn 11132  ax-icn 11133  ax-addcl 11134  ax-addrcl 11135  ax-mulcl 11136  ax-mulrcl 11137  ax-mulcom 11138  ax-addass 11139  ax-mulass 11140  ax-distr 11141  ax-i2m1 11142  ax-1ne0 11143  ax-1rid 11144  ax-rnegex 11145  ax-rrecex 11146  ax-cnre 11147  ax-pre-lttri 11148  ax-pre-lttrn 11149  ax-pre-ltadd 11150  ax-pre-mulgt0 11151  ax-addf 11153  ax-mulf 11154

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1100  df-3an 1101  df-xor 1533  df-tru 1564  df-fal 1574  df-ex 1801  df-nf 1805  df-sb 2092  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3457  df-sbc 3746  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-tp 4588  df-op 4590  df-ot 4592  df-uni 4867  df-int 4907  df-iun 4952  df-iin 4953  df-br 5102  df-opab 5164  df-mpt 5183  df-tr 5209  df-id 5543  df-eprel 5548  df-po 5556  df-so 5557  df-fr 5601  df-se 5602  df-we 5603  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-res 5660  df-ima 5661  df-pred 6289  df-ord 6350  df-on 6351  df-lim 6352  df-suc 6353  df-iota 6478  df-fun 6524  df-fn 6525  df-f 6526  df-f1 6527  df-fo 6528  df-f1o 6529  df-fv 6530  df-isom 6531  df-riota 7354  df-ov 7400  df-oprab 7401  df-mpo 7402  df-of 7661  df-ofr 7662  df-om 7848  df-1st 7971  df-2nd 7972  df-supp 8142  df-tpos 8207  df-cur 8248  df-frecs 8263  df-wrecs 8294  df-recs 8343  df-rdg 8382  df-1o 8438  df-2o 8439  df-er 8679  df-map 8811  df-pm 8812  df-ixp 8881  df-en 8929  df-dom 8930  df-sdom 8931  df-fin 8932  df-fsupp 9309  df-sup 9389  df-oi 9459  df-card 9898  df-pnf 11219  df-mnf 11220  df-xr 11221  df-ltxr 11222  df-le 11223  df-sub 11417  df-neg 11418  df-div 11846  df-nn 12212  df-2 12281  df-3 12282  df-4 12283  df-5 12284  df-6 12285  df-7 12286  df-8 12287  df-9 12288  df-n0 12483  df-xnn0 12556  df-z 12570  df-dec 12690  df-uz 12841  df-rp 12995  df-fz 13514  df-fzo 13661  df-seq 14016  df-exp 14076  df-hash 14345  df-word 14528  df-lsw 14577  df-concat 14585  df-s1 14611  df-substr 14656  df-pfx 14686  df-splice 14764  df-reverse 14773  df-s2 14862  df-struct 17184  df-sets 17201  df-slot 17219  df-ndx 17231  df-base 17247  df-ress 17268  df-plusg 17300  df-mulr 17301  df-starv 17302  df-sca 17303  df-vsca 17304  df-ip 17305  df-tset 17306  df-ple 17307  df-ds 17309  df-unif 17310  df-hom 17311  df-cco 17312  df-0g 17471  df-gsum 17472  df-prds 17477  df-pws 17479  df-mre 17615  df-mrc 17616  df-acs 17618  df-mgm 18675  df-sgrp 18754  df-mnd 18770  df-mhm 18818  df-submnd 18819  df-efmnd 18904  df-grp 18979  df-minusg 18980  df-sbg 18981  df-mulg 19111  df-subg 19166  df-ghm 19255  df-gim 19300  df-cntz 19358  df-oppg 19387  df-symg 19411  df-pmtr 19483  df-psgn 19532  df-evpm 19533  df-cmn 19823  df-abl 19824  df-mgp 20188  df-rng 20200  df-ur 20233  df-srg 20238  df-ring 20286  df-cring 20287  df-oppr 20387  df-dvdsr 20407  df-unit 20408  df-invr 20438  df-dvr 20451  df-rhm 20522  df-subrng 20597  df-subrg 20621  df-drng 20782  df-lmod 20930  df-lss 21000  df-sra 21241  df-rgmod 21242  df-cnfld 21426  df-zring 21500  df-zrh 21556  df-dsmm 21785  df-frlm 21800  df-assa 21906  df-ascl 21908  df-psr 21962  df-mvr 21963  df-mpl 21964  df-opsr 21966  df-psr1 22243  df-vr1 22244  df-ply1 22245  df-coe1 22246  df-mamu 22452  df-mat 22469  df-mdet 22646  df-madu 22695  df-cpmat 22767  df-mat2pmat 22768  df-cpmat2mat 22769  df-decpmat 22824  df-pm2mp 22854  df-chpmat 22888

This theorem is referenced by: (None)