| 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 23041 | . . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → 𝐶 = (𝑚 ∈ 𝐵 ↦ (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑚))))) |
| 13 | 12 | 3adant3 1150 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → 𝐶 = (𝑚 ∈ 𝐵 ↦ (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑚))))) |
| 14 | fveq2 6885 | . . . . 5 ⊢ (𝑚 = 𝑀 → (𝑇‘𝑚) = (𝑇‘𝑀)) | |
| 15 | 14 | oveq2d 7435 | . . . 4 ⊢ (𝑚 = 𝑀 → ((𝑋 · 1 ) − (𝑇‘𝑚)) = ((𝑋 · 1 ) − (𝑇‘𝑀))) |
| 16 | 15 | fveq2d 6889 | . . 3 ⊢ (𝑚 = 𝑀 → (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑚))) = (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑀)))) |
| 17 | 16 | adantl 487 | . 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) ∧ 𝑚 = 𝑀) → (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑚))) = (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑀)))) |
| 18 | simp3 1156 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → 𝑀 ∈ 𝐵) | |
| 19 | fvexd 6900 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑀))) ∈ V) | |
| 20 | 13, 17, 18, 19 | fvmptd 7001 | 1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → (𝐶‘𝑀) = (𝐷‘((𝑋 · 1 ) − (𝑇‘𝑀)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 Vcvv 3457 ↦ cmpt 5194 ‘cfv 6540 (class class class)co 7419 Fincfn 8949 Basecbs 17295 ·𝑠 cvsca 17340 -gcsg 19050 1rcur 20311 var1cv1 22390 Poly1cpl1 22391 Mat cmat 22618 maDet cmdat 22795 matToPolyMat cmat2pmat 22915 CharPlyMat cchpmat 23037 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pr 5406 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7422 df-oprab 7423 df-mpo 7424 df-chpmat 23038 |
| This theorem is used by: chpmatply1 23043 chpmatval2 23044 chpmat0d 23045 chpmat1d 23047 chpdmat 23052 cpmadurid 23078 cpmidgsum2 23090 |
| Copyright terms: Public domain | W3C validator |