| 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 22808 | . . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → 𝐶 = (𝑚 ∈ 𝐵 ↦ (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑚))))) |
| 13 | 12 | 3adant3 1133 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → 𝐶 = (𝑚 ∈ 𝐵 ↦ (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑚))))) |
| 14 | fveq2 6835 | . . . . 5 ⊢ (𝑚 = 𝑀 → (𝑇‘𝑚) = (𝑇‘𝑀)) | |
| 15 | 14 | oveq2d 7377 | . . . 4 ⊢ (𝑚 = 𝑀 → ((𝑋 · 1 ) − (𝑇‘𝑚)) = ((𝑋 · 1 ) − (𝑇‘𝑀))) |
| 16 | 15 | fveq2d 6839 | . . 3 ⊢ (𝑚 = 𝑀 → (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑚))) = (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑀)))) |
| 17 | 16 | adantl 481 | . 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) ∧ 𝑚 = 𝑀) → (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑚))) = (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑀)))) |
| 18 | simp3 1139 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → 𝑀 ∈ 𝐵) | |
| 19 | fvexd 6850 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑀))) ∈ V) | |
| 20 | 13, 17, 18, 19 | fvmptd 6950 | 1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → (𝐶‘𝑀) = (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑀)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 Vcvv 3430 ↦ cmpt 5167 ‘cfv 6493 (class class class)co 7361 Fincfn 8887 Basecbs 17173 ·𝑠 cvsca 17218 -gcsg 18905 1rcur 20156 var1cv1 22152 Poly1cpl1 22153 Mat cmat 22385 maDet cmdat 22562 matToPolyMat cmat2pmat 22682 CharPlyMat cchpmat 22804 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pr 5371 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-ov 7364 df-oprab 7365 df-mpo 7366 df-chpmat 22805 |
| This theorem is referenced by: chpmatply1 22810 chpmatval2 22811 chpmat0d 22812 chpmat1d 22814 chpdmat 22819 cpmadurid 22845 cpmidgsum2 22857 |
| Copyright terms: Public domain | W3C validator |