Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > chpmatval | Structured version Visualization version GIF version |
Description: The characteristic polynomial of a (square) matrix (expressed with a determinant). (Contributed by AV, 2-Aug-2019.) |
Ref | Expression |
---|---|
chpmatfval.c | ⊢ 𝐶 = (𝑁 CharPlyMat 𝑅) |
chpmatfval.a | ⊢ 𝐴 = (𝑁 Mat 𝑅) |
chpmatfval.b | ⊢ 𝐵 = (Base‘𝐴) |
chpmatfval.p | ⊢ 𝑃 = (Poly1‘𝑅) |
chpmatfval.y | ⊢ 𝑌 = (𝑁 Mat 𝑃) |
chpmatfval.d | ⊢ 𝐷 = (𝑁 maDet 𝑃) |
chpmatfval.s | ⊢ − = (-g‘𝑌) |
chpmatfval.x | ⊢ 𝑋 = (var1‘𝑅) |
chpmatfval.m | ⊢ · = ( ·𝑠 ‘𝑌) |
chpmatfval.t | ⊢ 𝑇 = (𝑁 matToPolyMat 𝑅) |
chpmatfval.i | ⊢ 1 = (1r‘𝑌) |
Ref | Expression |
---|---|
chpmatval | ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → (𝐶‘𝑀) = (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑀)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | chpmatfval.c | . . . 4 ⊢ 𝐶 = (𝑁 CharPlyMat 𝑅) | |
2 | chpmatfval.a | . . . 4 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
3 | chpmatfval.b | . . . 4 ⊢ 𝐵 = (Base‘𝐴) | |
4 | chpmatfval.p | . . . 4 ⊢ 𝑃 = (Poly1‘𝑅) | |
5 | chpmatfval.y | . . . 4 ⊢ 𝑌 = (𝑁 Mat 𝑃) | |
6 | chpmatfval.d | . . . 4 ⊢ 𝐷 = (𝑁 maDet 𝑃) | |
7 | chpmatfval.s | . . . 4 ⊢ − = (-g‘𝑌) | |
8 | chpmatfval.x | . . . 4 ⊢ 𝑋 = (var1‘𝑅) | |
9 | chpmatfval.m | . . . 4 ⊢ · = ( ·𝑠 ‘𝑌) | |
10 | chpmatfval.t | . . . 4 ⊢ 𝑇 = (𝑁 matToPolyMat 𝑅) | |
11 | chpmatfval.i | . . . 4 ⊢ 1 = (1r‘𝑌) | |
12 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 | chpmatfval 21979 | . . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → 𝐶 = (𝑚 ∈ 𝐵 ↦ (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑚))))) |
13 | 12 | 3adant3 1131 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → 𝐶 = (𝑚 ∈ 𝐵 ↦ (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑚))))) |
14 | fveq2 6774 | . . . . 5 ⊢ (𝑚 = 𝑀 → (𝑇‘𝑚) = (𝑇‘𝑀)) | |
15 | 14 | oveq2d 7291 | . . . 4 ⊢ (𝑚 = 𝑀 → ((𝑋 · 1 ) − (𝑇‘𝑚)) = ((𝑋 · 1 ) − (𝑇‘𝑀))) |
16 | 15 | fveq2d 6778 | . . 3 ⊢ (𝑚 = 𝑀 → (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑚))) = (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑀)))) |
17 | 16 | adantl 482 | . 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) ∧ 𝑚 = 𝑀) → (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑚))) = (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑀)))) |
18 | simp3 1137 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → 𝑀 ∈ 𝐵) | |
19 | fvexd 6789 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑀))) ∈ V) | |
20 | 13, 17, 18, 19 | fvmptd 6882 | 1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → (𝐶‘𝑀) = (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑀)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 Vcvv 3432 ↦ cmpt 5157 ‘cfv 6433 (class class class)co 7275 Fincfn 8733 Basecbs 16912 ·𝑠 cvsca 16966 -gcsg 18579 1rcur 19737 var1cv1 21347 Poly1cpl1 21348 Mat cmat 21554 maDet cmdat 21733 matToPolyMat cmat2pmat 21853 CharPlyMat cchpmat 21975 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-ov 7278 df-oprab 7279 df-mpo 7280 df-chpmat 21976 |
This theorem is referenced by: chpmatply1 21981 chpmatval2 21982 chpmat0d 21983 chpmat1d 21985 chpdmat 21990 cpmadurid 22016 cpmidgsum2 22028 |
Copyright terms: Public domain | W3C validator |