![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > cayleyhamilton0 | Structured version Visualization version GIF version |
Description: The Cayley-Hamilton theorem: A matrix over a commutative ring "satisfies its own characteristic equation". This version of cayleyhamilton 22912 provides definitions not used in the theorem itself, but in its proof to make it clearer, more readable and shorter compared with a proof without them (see cayleyhamiltonALT 22913)! (Contributed by AV, 25-Nov-2019.) (Revised by AV, 15-Dec-2019.) |
Ref | Expression |
---|---|
cayleyhamilton0.a | ⊢ 𝐴 = (𝑁 Mat 𝑅) |
cayleyhamilton0.b | ⊢ 𝐵 = (Base‘𝐴) |
cayleyhamilton0.0 | ⊢ 0 = (0g‘𝐴) |
cayleyhamilton0.1 | ⊢ 1 = (1r‘𝐴) |
cayleyhamilton0.m | ⊢ ∗ = ( ·𝑠 ‘𝐴) |
cayleyhamilton0.e1 | ⊢ ↑ = (.g‘(mulGrp‘𝐴)) |
cayleyhamilton0.c | ⊢ 𝐶 = (𝑁 CharPlyMat 𝑅) |
cayleyhamilton0.k | ⊢ 𝐾 = (coe1‘(𝐶‘𝑀)) |
cayleyhamilton0.p | ⊢ 𝑃 = (Poly1‘𝑅) |
cayleyhamilton0.y | ⊢ 𝑌 = (𝑁 Mat 𝑃) |
cayleyhamilton0.r | ⊢ × = (.r‘𝑌) |
cayleyhamilton0.s | ⊢ − = (-g‘𝑌) |
cayleyhamilton0.z | ⊢ 𝑍 = (0g‘𝑌) |
cayleyhamilton0.w | ⊢ 𝑊 = (Base‘𝑌) |
cayleyhamilton0.e2 | ⊢ 𝐸 = (.g‘(mulGrp‘𝑌)) |
cayleyhamilton0.t | ⊢ 𝑇 = (𝑁 matToPolyMat 𝑅) |
cayleyhamilton0.g | ⊢ 𝐺 = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, (𝑍 − ((𝑇‘𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏‘𝑠)), if((𝑠 + 1) < 𝑛, 𝑍, ((𝑇‘(𝑏‘(𝑛 − 1))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘𝑛)))))))) |
cayleyhamilton0.u | ⊢ 𝑈 = (𝑁 cPolyMatToMat 𝑅) |
Ref | Expression |
---|---|
cayleyhamilton0 | ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐾‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = 0 ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cayleyhamilton0.a | . . 3 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
2 | cayleyhamilton0.b | . . 3 ⊢ 𝐵 = (Base‘𝐴) | |
3 | cayleyhamilton0.p | . . 3 ⊢ 𝑃 = (Poly1‘𝑅) | |
4 | cayleyhamilton0.y | . . 3 ⊢ 𝑌 = (𝑁 Mat 𝑃) | |
5 | cayleyhamilton0.r | . . 3 ⊢ × = (.r‘𝑌) | |
6 | cayleyhamilton0.s | . . 3 ⊢ − = (-g‘𝑌) | |
7 | cayleyhamilton0.z | . . 3 ⊢ 𝑍 = (0g‘𝑌) | |
8 | cayleyhamilton0.t | . . 3 ⊢ 𝑇 = (𝑁 matToPolyMat 𝑅) | |
9 | cayleyhamilton0.c | . . 3 ⊢ 𝐶 = (𝑁 CharPlyMat 𝑅) | |
10 | eqid 2735 | . . 3 ⊢ (𝐶‘𝑀) = (𝐶‘𝑀) | |
11 | cayleyhamilton0.g | . . 3 ⊢ 𝐺 = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, (𝑍 − ((𝑇‘𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏‘𝑠)), if((𝑠 + 1) < 𝑛, 𝑍, ((𝑇‘(𝑏‘(𝑛 − 1))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘𝑛)))))))) | |
12 | cayleyhamilton0.w | . . 3 ⊢ 𝑊 = (Base‘𝑌) | |
13 | cayleyhamilton0.1 | . . 3 ⊢ 1 = (1r‘𝐴) | |
14 | cayleyhamilton0.m | . . 3 ⊢ ∗ = ( ·𝑠 ‘𝐴) | |
15 | cayleyhamilton0.u | . . 3 ⊢ 𝑈 = (𝑁 cPolyMatToMat 𝑅) | |
16 | cayleyhamilton0.e1 | . . 3 ⊢ ↑ = (.g‘(mulGrp‘𝐴)) | |
17 | cayleyhamilton0.e2 | . . 3 ⊢ 𝐸 = (.g‘(mulGrp‘𝑌)) | |
18 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17 | cayhamlem4 22910 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → ∃𝑠 ∈ ℕ ∃𝑏 ∈ (𝐵 ↑m (0...𝑠))(𝐴 Σg (𝑛 ∈ ℕ0 ↦ (((coe1‘(𝐶‘𝑀))‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = (𝑈‘(𝑌 Σg (𝑛 ∈ ℕ0 ↦ ((𝑛𝐸(𝑇‘𝑀)) × (𝐺‘𝑛)))))) |
19 | cayleyhamilton0.k | . . . . . . . . . . . . 13 ⊢ 𝐾 = (coe1‘(𝐶‘𝑀)) | |
20 | 19 | eqcomi 2744 | . . . . . . . . . . . 12 ⊢ (coe1‘(𝐶‘𝑀)) = 𝐾 |
21 | 20 | a1i 11 | . . . . . . . . . . 11 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑛 ∈ ℕ0) → (coe1‘(𝐶‘𝑀)) = 𝐾) |
22 | 21 | fveq1d 6909 | . . . . . . . . . 10 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑛 ∈ ℕ0) → ((coe1‘(𝐶‘𝑀))‘𝑛) = (𝐾‘𝑛)) |
23 | 22 | oveq1d 7446 | . . . . . . . . 9 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ 𝑛 ∈ ℕ0) → (((coe1‘(𝐶‘𝑀))‘𝑛) ∗ (𝑛 ↑ 𝑀)) = ((𝐾‘𝑛) ∗ (𝑛 ↑ 𝑀))) |
24 | 23 | mpteq2dva 5248 | . . . . . . . 8 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → (𝑛 ∈ ℕ0 ↦ (((coe1‘(𝐶‘𝑀))‘𝑛) ∗ (𝑛 ↑ 𝑀))) = (𝑛 ∈ ℕ0 ↦ ((𝐾‘𝑛) ∗ (𝑛 ↑ 𝑀)))) |
25 | 24 | oveq2d 7447 | . . . . . . 7 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → (𝐴 Σg (𝑛 ∈ ℕ0 ↦ (((coe1‘(𝐶‘𝑀))‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐾‘𝑛) ∗ (𝑛 ↑ 𝑀))))) |
26 | 25 | eqeq1d 2737 | . . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → ((𝐴 Σg (𝑛 ∈ ℕ0 ↦ (((coe1‘(𝐶‘𝑀))‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = (𝑈‘(𝑌 Σg (𝑛 ∈ ℕ0 ↦ ((𝑛𝐸(𝑇‘𝑀)) × (𝐺‘𝑛))))) ↔ (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐾‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = (𝑈‘(𝑌 Σg (𝑛 ∈ ℕ0 ↦ ((𝑛𝐸(𝑇‘𝑀)) × (𝐺‘𝑛))))))) |
27 | 26 | biimpa 476 | . . . . 5 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ (𝐴 Σg (𝑛 ∈ ℕ0 ↦ (((coe1‘(𝐶‘𝑀))‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = (𝑈‘(𝑌 Σg (𝑛 ∈ ℕ0 ↦ ((𝑛𝐸(𝑇‘𝑀)) × (𝐺‘𝑛)))))) → (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐾‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = (𝑈‘(𝑌 Σg (𝑛 ∈ ℕ0 ↦ ((𝑛𝐸(𝑇‘𝑀)) × (𝐺‘𝑛)))))) |
28 | oveq1 7438 | . . . . . . . . . . 11 ⊢ (𝑛 = 𝑙 → (𝑛𝐸(𝑇‘𝑀)) = (𝑙𝐸(𝑇‘𝑀))) | |
29 | fveq2 6907 | . . . . . . . . . . 11 ⊢ (𝑛 = 𝑙 → (𝐺‘𝑛) = (𝐺‘𝑙)) | |
30 | 28, 29 | oveq12d 7449 | . . . . . . . . . 10 ⊢ (𝑛 = 𝑙 → ((𝑛𝐸(𝑇‘𝑀)) × (𝐺‘𝑛)) = ((𝑙𝐸(𝑇‘𝑀)) × (𝐺‘𝑙))) |
31 | 30 | cbvmptv 5261 | . . . . . . . . 9 ⊢ (𝑛 ∈ ℕ0 ↦ ((𝑛𝐸(𝑇‘𝑀)) × (𝐺‘𝑛))) = (𝑙 ∈ ℕ0 ↦ ((𝑙𝐸(𝑇‘𝑀)) × (𝐺‘𝑙))) |
32 | 31 | oveq2i 7442 | . . . . . . . 8 ⊢ (𝑌 Σg (𝑛 ∈ ℕ0 ↦ ((𝑛𝐸(𝑇‘𝑀)) × (𝐺‘𝑛)))) = (𝑌 Σg (𝑙 ∈ ℕ0 ↦ ((𝑙𝐸(𝑇‘𝑀)) × (𝐺‘𝑙)))) |
33 | 1, 2, 3, 4, 5, 6, 7, 8, 11, 17 | cayhamlem1 22888 | . . . . . . . 8 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → (𝑌 Σg (𝑙 ∈ ℕ0 ↦ ((𝑙𝐸(𝑇‘𝑀)) × (𝐺‘𝑙)))) = 𝑍) |
34 | 32, 33 | eqtrid 2787 | . . . . . . 7 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → (𝑌 Σg (𝑛 ∈ ℕ0 ↦ ((𝑛𝐸(𝑇‘𝑀)) × (𝐺‘𝑛)))) = 𝑍) |
35 | fveq2 6907 | . . . . . . . 8 ⊢ ((𝑌 Σg (𝑛 ∈ ℕ0 ↦ ((𝑛𝐸(𝑇‘𝑀)) × (𝐺‘𝑛)))) = 𝑍 → (𝑈‘(𝑌 Σg (𝑛 ∈ ℕ0 ↦ ((𝑛𝐸(𝑇‘𝑀)) × (𝐺‘𝑛))))) = (𝑈‘𝑍)) | |
36 | crngring 20263 | . . . . . . . . . . . . 13 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring) | |
37 | 36 | anim2i 617 | . . . . . . . . . . . 12 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → (𝑁 ∈ Fin ∧ 𝑅 ∈ Ring)) |
38 | 37 | 3adant3 1131 | . . . . . . . . . . 11 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (𝑁 ∈ Fin ∧ 𝑅 ∈ Ring)) |
39 | eqid 2735 | . . . . . . . . . . . 12 ⊢ (0g‘𝐴) = (0g‘𝐴) | |
40 | 1, 15, 3, 4, 39, 7 | m2cpminv0 22783 | . . . . . . . . . . 11 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑈‘𝑍) = (0g‘𝐴)) |
41 | 38, 40 | syl 17 | . . . . . . . . . 10 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (𝑈‘𝑍) = (0g‘𝐴)) |
42 | cayleyhamilton0.0 | . . . . . . . . . 10 ⊢ 0 = (0g‘𝐴) | |
43 | 41, 42 | eqtr4di 2793 | . . . . . . . . 9 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (𝑈‘𝑍) = 0 ) |
44 | 43 | adantr 480 | . . . . . . . 8 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → (𝑈‘𝑍) = 0 ) |
45 | 35, 44 | sylan9eqr 2797 | . . . . . . 7 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ (𝑌 Σg (𝑛 ∈ ℕ0 ↦ ((𝑛𝐸(𝑇‘𝑀)) × (𝐺‘𝑛)))) = 𝑍) → (𝑈‘(𝑌 Σg (𝑛 ∈ ℕ0 ↦ ((𝑛𝐸(𝑇‘𝑀)) × (𝐺‘𝑛))))) = 0 ) |
46 | 34, 45 | mpdan 687 | . . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → (𝑈‘(𝑌 Σg (𝑛 ∈ ℕ0 ↦ ((𝑛𝐸(𝑇‘𝑀)) × (𝐺‘𝑛))))) = 0 ) |
47 | 46 | adantr 480 | . . . . 5 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ (𝐴 Σg (𝑛 ∈ ℕ0 ↦ (((coe1‘(𝐶‘𝑀))‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = (𝑈‘(𝑌 Σg (𝑛 ∈ ℕ0 ↦ ((𝑛𝐸(𝑇‘𝑀)) × (𝐺‘𝑛)))))) → (𝑈‘(𝑌 Σg (𝑛 ∈ ℕ0 ↦ ((𝑛𝐸(𝑇‘𝑀)) × (𝐺‘𝑛))))) = 0 ) |
48 | 27, 47 | eqtrd 2775 | . . . 4 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ (𝐴 Σg (𝑛 ∈ ℕ0 ↦ (((coe1‘(𝐶‘𝑀))‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = (𝑈‘(𝑌 Σg (𝑛 ∈ ℕ0 ↦ ((𝑛𝐸(𝑇‘𝑀)) × (𝐺‘𝑛)))))) → (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐾‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = 0 ) |
49 | 48 | ex 412 | . . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → ((𝐴 Σg (𝑛 ∈ ℕ0 ↦ (((coe1‘(𝐶‘𝑀))‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = (𝑈‘(𝑌 Σg (𝑛 ∈ ℕ0 ↦ ((𝑛𝐸(𝑇‘𝑀)) × (𝐺‘𝑛))))) → (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐾‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = 0 )) |
50 | 49 | rexlimdvva 3211 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (∃𝑠 ∈ ℕ ∃𝑏 ∈ (𝐵 ↑m (0...𝑠))(𝐴 Σg (𝑛 ∈ ℕ0 ↦ (((coe1‘(𝐶‘𝑀))‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = (𝑈‘(𝑌 Σg (𝑛 ∈ ℕ0 ↦ ((𝑛𝐸(𝑇‘𝑀)) × (𝐺‘𝑛))))) → (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐾‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = 0 )) |
51 | 18, 50 | mpd 15 | 1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐾‘𝑛) ∗ (𝑛 ↑ 𝑀)))) = 0 ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1537 ∈ wcel 2106 ∃wrex 3068 ifcif 4531 class class class wbr 5148 ↦ cmpt 5231 ‘cfv 6563 (class class class)co 7431 ↑m cmap 8865 Fincfn 8984 0cc0 11153 1c1 11154 + caddc 11156 < clt 11293 − cmin 11490 ℕcn 12264 ℕ0cn0 12524 ...cfz 13544 Basecbs 17245 .rcmulr 17299 ·𝑠 cvsca 17302 0gc0g 17486 Σg cgsu 17487 -gcsg 18966 .gcmg 19098 mulGrpcmgp 20152 1rcur 20199 Ringcrg 20251 CRingccrg 20252 Poly1cpl1 22194 coe1cco1 22195 Mat cmat 22427 matToPolyMat cmat2pmat 22726 cPolyMatToMat ccpmat2mat 22727 CharPlyMat cchpmat 22848 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 ax-addf 11232 ax-mulf 11233 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-xor 1509 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-tp 4636 df-op 4638 df-ot 4640 df-uni 4913 df-int 4952 df-iun 4998 df-iin 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-se 5642 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-isom 6572 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-of 7697 df-ofr 7698 df-om 7888 df-1st 8013 df-2nd 8014 df-supp 8185 df-tpos 8250 df-cur 8291 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-2o 8506 df-er 8744 df-map 8867 df-pm 8868 df-ixp 8937 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-fsupp 9400 df-sup 9480 df-oi 9548 df-card 9977 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-div 11919 df-nn 12265 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-7 12332 df-8 12333 df-9 12334 df-n0 12525 df-xnn0 12598 df-z 12612 df-dec 12732 df-uz 12877 df-rp 13033 df-fz 13545 df-fzo 13692 df-seq 14040 df-exp 14100 df-hash 14367 df-word 14550 df-lsw 14598 df-concat 14606 df-s1 14631 df-substr 14676 df-pfx 14706 df-splice 14785 df-reverse 14794 df-s2 14884 df-struct 17181 df-sets 17198 df-slot 17216 df-ndx 17228 df-base 17246 df-ress 17275 df-plusg 17311 df-mulr 17312 df-starv 17313 df-sca 17314 df-vsca 17315 df-ip 17316 df-tset 17317 df-ple 17318 df-ds 17320 df-unif 17321 df-hom 17322 df-cco 17323 df-0g 17488 df-gsum 17489 df-prds 17494 df-pws 17496 df-mre 17631 df-mrc 17632 df-acs 17634 df-mgm 18666 df-sgrp 18745 df-mnd 18761 df-mhm 18809 df-submnd 18810 df-efmnd 18895 df-grp 18967 df-minusg 18968 df-sbg 18969 df-mulg 19099 df-subg 19154 df-ghm 19244 df-gim 19290 df-cntz 19348 df-oppg 19377 df-symg 19402 df-pmtr 19475 df-psgn 19524 df-evpm 19525 df-cmn 19815 df-abl 19816 df-mgp 20153 df-rng 20171 df-ur 20200 df-srg 20205 df-ring 20253 df-cring 20254 df-oppr 20351 df-dvdsr 20374 df-unit 20375 df-invr 20405 df-dvr 20418 df-rhm 20489 df-subrng 20563 df-subrg 20587 df-drng 20748 df-lmod 20877 df-lss 20948 df-sra 21190 df-rgmod 21191 df-cnfld 21383 df-zring 21476 df-zrh 21532 df-dsmm 21770 df-frlm 21785 df-assa 21891 df-ascl 21893 df-psr 21947 df-mvr 21948 df-mpl 21949 df-opsr 21951 df-psr1 22197 df-vr1 22198 df-ply1 22199 df-coe1 22200 df-mamu 22411 df-mat 22428 df-mdet 22607 df-madu 22656 df-cpmat 22728 df-mat2pmat 22729 df-cpmat2mat 22730 df-decpmat 22785 df-pm2mp 22815 df-chpmat 22849 |
This theorem is referenced by: cayleyhamilton 22912 |
Copyright terms: Public domain | W3C validator |