| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cpmadugsum | Structured version Visualization version GIF version | ||
| Description: The product of the characteristic matrix of a given matrix and its adjunct represented as an infinite sum. (Contributed by AV, 10-Nov-2019.) |
| Ref | Expression |
|---|---|
| cpmadugsum.a | ⊢ 𝐴 = (𝑁 Mat 𝑅) |
| cpmadugsum.b | ⊢ 𝐵 = (Base‘𝐴) |
| cpmadugsum.p | ⊢ 𝑃 = (Poly1‘𝑅) |
| cpmadugsum.y | ⊢ 𝑌 = (𝑁 Mat 𝑃) |
| cpmadugsum.t | ⊢ 𝑇 = (𝑁 matToPolyMat 𝑅) |
| cpmadugsum.x | ⊢ 𝑋 = (var1‘𝑅) |
| cpmadugsum.e | ⊢ ↑ = (.g‘(mulGrp‘𝑃)) |
| cpmadugsum.m | ⊢ · = ( ·𝑠 ‘𝑌) |
| cpmadugsum.r | ⊢ × = (.r‘𝑌) |
| cpmadugsum.1 | ⊢ 1 = (1r‘𝑌) |
| cpmadugsum.g | ⊢ + = (+g‘𝑌) |
| cpmadugsum.s | ⊢ − = (-g‘𝑌) |
| cpmadugsum.i | ⊢ 𝐼 = ((𝑋 · 1 ) − (𝑇‘𝑀)) |
| cpmadugsum.j | ⊢ 𝐽 = (𝑁 maAdju 𝑃) |
| cpmadugsum.0 | ⊢ 0 = (0g‘𝑌) |
| cpmadugsum.g2 | ⊢ 𝐺 = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( 0 − ((𝑇‘𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏‘𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘𝑛)))))))) |
| Ref | Expression |
|---|---|
| cpmadugsum | ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → ∃𝑠 ∈ ℕ ∃𝑏 ∈ (𝐵 ↑m (0...𝑠))(𝐼 × (𝐽‘𝐼)) = (𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 ↑ 𝑋) · (𝐺‘𝑖))))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cpmadugsum.a | . . 3 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
| 2 | cpmadugsum.b | . . 3 ⊢ 𝐵 = (Base‘𝐴) | |
| 3 | cpmadugsum.p | . . 3 ⊢ 𝑃 = (Poly1‘𝑅) | |
| 4 | cpmadugsum.y | . . 3 ⊢ 𝑌 = (𝑁 Mat 𝑃) | |
| 5 | cpmadugsum.t | . . 3 ⊢ 𝑇 = (𝑁 matToPolyMat 𝑅) | |
| 6 | cpmadugsum.x | . . 3 ⊢ 𝑋 = (var1‘𝑅) | |
| 7 | cpmadugsum.e | . . 3 ⊢ ↑ = (.g‘(mulGrp‘𝑃)) | |
| 8 | cpmadugsum.m | . . 3 ⊢ · = ( ·𝑠 ‘𝑌) | |
| 9 | cpmadugsum.r | . . 3 ⊢ × = (.r‘𝑌) | |
| 10 | cpmadugsum.1 | . . 3 ⊢ 1 = (1r‘𝑌) | |
| 11 | cpmadugsum.g | . . 3 ⊢ + = (+g‘𝑌) | |
| 12 | cpmadugsum.s | . . 3 ⊢ − = (-g‘𝑌) | |
| 13 | cpmadugsum.i | . . 3 ⊢ 𝐼 = ((𝑋 · 1 ) − (𝑇‘𝑀)) | |
| 14 | cpmadugsum.j | . . 3 ⊢ 𝐽 = (𝑁 maAdju 𝑃) | |
| 15 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 | cpmadugsumfi 22793 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → ∃𝑠 ∈ ℕ ∃𝑏 ∈ (𝐵 ↑m (0...𝑠))(𝐼 × (𝐽‘𝐼)) = ((𝑌 Σg (𝑖 ∈ (1...𝑠) ↦ ((𝑖 ↑ 𝑋) · ((𝑇‘(𝑏‘(𝑖 − 1))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘𝑖))))))) + ((((𝑠 + 1) ↑ 𝑋) · (𝑇‘(𝑏‘𝑠))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘0)))))) |
| 16 | simpr 484 | . . . . 5 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ (𝐼 × (𝐽‘𝐼)) = ((𝑌 Σg (𝑖 ∈ (1...𝑠) ↦ ((𝑖 ↑ 𝑋) · ((𝑇‘(𝑏‘(𝑖 − 1))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘𝑖))))))) + ((((𝑠 + 1) ↑ 𝑋) · (𝑇‘(𝑏‘𝑠))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘0)))))) → (𝐼 × (𝐽‘𝐼)) = ((𝑌 Σg (𝑖 ∈ (1...𝑠) ↦ ((𝑖 ↑ 𝑋) · ((𝑇‘(𝑏‘(𝑖 − 1))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘𝑖))))))) + ((((𝑠 + 1) ↑ 𝑋) · (𝑇‘(𝑏‘𝑠))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘0)))))) | |
| 17 | cpmadugsum.0 | . . . . . . . 8 ⊢ 0 = (0g‘𝑌) | |
| 18 | cpmadugsum.g2 | . . . . . . . 8 ⊢ 𝐺 = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( 0 − ((𝑇‘𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏‘𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘𝑛)))))))) | |
| 19 | 1, 2, 3, 4, 9, 12, 17, 5, 18, 6, 8, 7, 11 | chfacfscmulgsum 22776 | . . . . . . 7 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → (𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 ↑ 𝑋) · (𝐺‘𝑖)))) = ((𝑌 Σg (𝑖 ∈ (1...𝑠) ↦ ((𝑖 ↑ 𝑋) · ((𝑇‘(𝑏‘(𝑖 − 1))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘𝑖))))))) + ((((𝑠 + 1) ↑ 𝑋) · (𝑇‘(𝑏‘𝑠))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘0)))))) |
| 20 | 19 | eqcomd 2737 | . . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → ((𝑌 Σg (𝑖 ∈ (1...𝑠) ↦ ((𝑖 ↑ 𝑋) · ((𝑇‘(𝑏‘(𝑖 − 1))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘𝑖))))))) + ((((𝑠 + 1) ↑ 𝑋) · (𝑇‘(𝑏‘𝑠))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘0))))) = (𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 ↑ 𝑋) · (𝐺‘𝑖))))) |
| 21 | 20 | adantr 480 | . . . . 5 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ (𝐼 × (𝐽‘𝐼)) = ((𝑌 Σg (𝑖 ∈ (1...𝑠) ↦ ((𝑖 ↑ 𝑋) · ((𝑇‘(𝑏‘(𝑖 − 1))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘𝑖))))))) + ((((𝑠 + 1) ↑ 𝑋) · (𝑇‘(𝑏‘𝑠))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘0)))))) → ((𝑌 Σg (𝑖 ∈ (1...𝑠) ↦ ((𝑖 ↑ 𝑋) · ((𝑇‘(𝑏‘(𝑖 − 1))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘𝑖))))))) + ((((𝑠 + 1) ↑ 𝑋) · (𝑇‘(𝑏‘𝑠))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘0))))) = (𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 ↑ 𝑋) · (𝐺‘𝑖))))) |
| 22 | 16, 21 | eqtrd 2766 | . . . 4 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) ∧ (𝐼 × (𝐽‘𝐼)) = ((𝑌 Σg (𝑖 ∈ (1...𝑠) ↦ ((𝑖 ↑ 𝑋) · ((𝑇‘(𝑏‘(𝑖 − 1))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘𝑖))))))) + ((((𝑠 + 1) ↑ 𝑋) · (𝑇‘(𝑏‘𝑠))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘0)))))) → (𝐼 × (𝐽‘𝐼)) = (𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 ↑ 𝑋) · (𝐺‘𝑖))))) |
| 23 | 22 | ex 412 | . . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠)))) → ((𝐼 × (𝐽‘𝐼)) = ((𝑌 Σg (𝑖 ∈ (1...𝑠) ↦ ((𝑖 ↑ 𝑋) · ((𝑇‘(𝑏‘(𝑖 − 1))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘𝑖))))))) + ((((𝑠 + 1) ↑ 𝑋) · (𝑇‘(𝑏‘𝑠))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘0))))) → (𝐼 × (𝐽‘𝐼)) = (𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 ↑ 𝑋) · (𝐺‘𝑖)))))) |
| 24 | 23 | reximdvva 3180 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (∃𝑠 ∈ ℕ ∃𝑏 ∈ (𝐵 ↑m (0...𝑠))(𝐼 × (𝐽‘𝐼)) = ((𝑌 Σg (𝑖 ∈ (1...𝑠) ↦ ((𝑖 ↑ 𝑋) · ((𝑇‘(𝑏‘(𝑖 − 1))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘𝑖))))))) + ((((𝑠 + 1) ↑ 𝑋) · (𝑇‘(𝑏‘𝑠))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘0))))) → ∃𝑠 ∈ ℕ ∃𝑏 ∈ (𝐵 ↑m (0...𝑠))(𝐼 × (𝐽‘𝐼)) = (𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 ↑ 𝑋) · (𝐺‘𝑖)))))) |
| 25 | 15, 24 | mpd 15 | 1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → ∃𝑠 ∈ ℕ ∃𝑏 ∈ (𝐵 ↑m (0...𝑠))(𝐼 × (𝐽‘𝐼)) = (𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 ↑ 𝑋) · (𝐺‘𝑖))))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2111 ∃wrex 3056 ifcif 4475 class class class wbr 5091 ↦ cmpt 5172 ‘cfv 6481 (class class class)co 7346 ↑m cmap 8750 Fincfn 8869 0cc0 11006 1c1 11007 + caddc 11009 < clt 11146 − cmin 11344 ℕcn 12125 ℕ0cn0 12381 ...cfz 13407 Basecbs 17120 +gcplusg 17161 .rcmulr 17162 ·𝑠 cvsca 17165 0gc0g 17343 Σg cgsu 17344 -gcsg 18848 .gcmg 18980 mulGrpcmgp 20059 1rcur 20100 CRingccrg 20153 var1cv1 22089 Poly1cpl1 22090 Mat cmat 22323 maAdju cmadu 22548 matToPolyMat cmat2pmat 22620 |
| 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 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5217 ax-sep 5234 ax-nul 5244 ax-pow 5303 ax-pr 5370 ax-un 7668 ax-cnex 11062 ax-resscn 11063 ax-1cn 11064 ax-icn 11065 ax-addcl 11066 ax-addrcl 11067 ax-mulcl 11068 ax-mulrcl 11069 ax-mulcom 11070 ax-addass 11071 ax-mulass 11072 ax-distr 11073 ax-i2m1 11074 ax-1ne0 11075 ax-1rid 11076 ax-rnegex 11077 ax-rrecex 11078 ax-cnre 11079 ax-pre-lttri 11080 ax-pre-lttrn 11081 ax-pre-ltadd 11082 ax-pre-mulgt0 11083 ax-addf 11085 ax-mulf 11086 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-xor 1513 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4476 df-pw 4552 df-sn 4577 df-pr 4579 df-tp 4581 df-op 4583 df-ot 4585 df-uni 4860 df-int 4898 df-iun 4943 df-iin 4944 df-br 5092 df-opab 5154 df-mpt 5173 df-tr 5199 df-id 5511 df-eprel 5516 df-po 5524 df-so 5525 df-fr 5569 df-se 5570 df-we 5571 df-xp 5622 df-rel 5623 df-cnv 5624 df-co 5625 df-dm 5626 df-rn 5627 df-res 5628 df-ima 5629 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-isom 6490 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-of 7610 df-ofr 7611 df-om 7797 df-1st 7921 df-2nd 7922 df-supp 8091 df-tpos 8156 df-cur 8197 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-1o 8385 df-2o 8386 df-er 8622 df-map 8752 df-pm 8753 df-ixp 8822 df-en 8870 df-dom 8871 df-sdom 8872 df-fin 8873 df-fsupp 9246 df-sup 9326 df-oi 9396 df-card 9832 df-pnf 11148 df-mnf 11149 df-xr 11150 df-ltxr 11151 df-le 11152 df-sub 11346 df-neg 11347 df-div 11775 df-nn 12126 df-2 12188 df-3 12189 df-4 12190 df-5 12191 df-6 12192 df-7 12193 df-8 12194 df-9 12195 df-n0 12382 df-xnn0 12455 df-z 12469 df-dec 12589 df-uz 12733 df-rp 12891 df-fz 13408 df-fzo 13555 df-seq 13909 df-exp 13969 df-hash 14238 df-word 14421 df-lsw 14470 df-concat 14478 df-s1 14504 df-substr 14549 df-pfx 14579 df-splice 14657 df-reverse 14666 df-s2 14755 df-struct 17058 df-sets 17075 df-slot 17093 df-ndx 17105 df-base 17121 df-ress 17142 df-plusg 17174 df-mulr 17175 df-starv 17176 df-sca 17177 df-vsca 17178 df-ip 17179 df-tset 17180 df-ple 17181 df-ds 17183 df-unif 17184 df-hom 17185 df-cco 17186 df-0g 17345 df-gsum 17346 df-prds 17351 df-pws 17353 df-mre 17488 df-mrc 17489 df-acs 17491 df-mgm 18548 df-sgrp 18627 df-mnd 18643 df-mhm 18691 df-submnd 18692 df-efmnd 18777 df-grp 18849 df-minusg 18850 df-sbg 18851 df-mulg 18981 df-subg 19036 df-ghm 19126 df-gim 19172 df-cntz 19230 df-oppg 19259 df-symg 19283 df-pmtr 19355 df-psgn 19404 df-cmn 19695 df-abl 19696 df-mgp 20060 df-rng 20072 df-ur 20101 df-srg 20106 df-ring 20154 df-cring 20155 df-oppr 20256 df-dvdsr 20276 df-unit 20277 df-invr 20307 df-dvr 20320 df-rhm 20391 df-subrng 20462 df-subrg 20486 df-drng 20647 df-lmod 20796 df-lss 20866 df-sra 21108 df-rgmod 21109 df-cnfld 21293 df-zring 21385 df-zrh 21441 df-dsmm 21670 df-frlm 21685 df-assa 21791 df-ascl 21793 df-psr 21847 df-mvr 21848 df-mpl 21849 df-opsr 21851 df-psr1 22093 df-vr1 22094 df-ply1 22095 df-coe1 22096 df-mamu 22307 df-mat 22324 df-mdet 22501 df-madu 22550 df-mat2pmat 22623 df-decpmat 22679 |
| This theorem is referenced by: cpmidgsum2 22795 cpmadumatpoly 22799 |
| Copyright terms: Public domain | W3C validator |