| 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 22774 | . . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → 𝐶 = (𝑚 ∈ 𝐵 ↦ (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑚))))) |
| 13 | 12 | 3adant3 1132 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → 𝐶 = (𝑚 ∈ 𝐵 ↦ (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑚))))) |
| 14 | fveq2 6834 | . . . . 5 ⊢ (𝑚 = 𝑀 → (𝑇‘𝑚) = (𝑇‘𝑀)) | |
| 15 | 14 | oveq2d 7374 | . . . 4 ⊢ (𝑚 = 𝑀 → ((𝑋 · 1 ) − (𝑇‘𝑚)) = ((𝑋 · 1 ) − (𝑇‘𝑀))) |
| 16 | 15 | fveq2d 6838 | . . 3 ⊢ (𝑚 = 𝑀 → (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑚))) = (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑀)))) |
| 17 | 16 | adantl 481 | . 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) ∧ 𝑚 = 𝑀) → (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑚))) = (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑀)))) |
| 18 | simp3 1138 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → 𝑀 ∈ 𝐵) | |
| 19 | fvexd 6849 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑀))) ∈ V) | |
| 20 | 13, 17, 18, 19 | fvmptd 6948 | 1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → (𝐶‘𝑀) = (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑀)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 Vcvv 3440 ↦ cmpt 5179 ‘cfv 6492 (class class class)co 7358 Fincfn 8883 Basecbs 17136 ·𝑠 cvsca 17181 -gcsg 18865 1rcur 20116 var1cv1 22116 Poly1cpl1 22117 Mat cmat 22351 maDet cmdat 22528 matToPolyMat cmat2pmat 22648 CharPlyMat cchpmat 22770 |
| 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 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pr 5377 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7361 df-oprab 7362 df-mpo 7363 df-chpmat 22771 |
| This theorem is referenced by: chpmatply1 22776 chpmatval2 22777 chpmat0d 22778 chpmat1d 22780 chpdmat 22785 cpmadurid 22811 cpmidgsum2 22823 |
| Copyright terms: Public domain | W3C validator |