Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > smadiadetr | Structured version Visualization version GIF version |
Description: The determinant of a square matrix with one row replaced with 0's and an arbitrary element of the underlying ring at the diagonal position equals the ring element multiplied with the determinant of a submatrix of the square matrix obtained by removing the row and the column at the same index. Closed form of smadiadetg 21929. Special case of the "Laplace expansion", see definition in [Lang] p. 515. (Contributed by AV, 15-Feb-2019.) |
Ref | Expression |
---|---|
smadiadetr | ⊢ (((𝑅 ∈ CRing ∧ 𝑀 ∈ (Base‘(𝑁 Mat 𝑅))) ∧ (𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅))) → ((𝑁 maDet 𝑅)‘(𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐾)) = (𝑆(.r‘𝑅)(((𝑁 ∖ {𝐾}) maDet 𝑅)‘(𝐾((𝑁 subMat 𝑅)‘𝑀)𝐾)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 3anass 1094 | . . . . 5 ⊢ ((𝑀 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) ↔ (𝑀 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)))) | |
2 | oveq2 7346 | . . . . . . . 8 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑁 Mat 𝑅) = (𝑁 Mat if(𝑅 ∈ CRing, 𝑅, ℂfld))) | |
3 | 2 | fveq2d 6830 | . . . . . . 7 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (Base‘(𝑁 Mat 𝑅)) = (Base‘(𝑁 Mat if(𝑅 ∈ CRing, 𝑅, ℂfld)))) |
4 | 3 | eleq2d 2822 | . . . . . 6 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑀 ∈ (Base‘(𝑁 Mat 𝑅)) ↔ 𝑀 ∈ (Base‘(𝑁 Mat if(𝑅 ∈ CRing, 𝑅, ℂfld))))) |
5 | fveq2 6826 | . . . . . . 7 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (Base‘𝑅) = (Base‘if(𝑅 ∈ CRing, 𝑅, ℂfld))) | |
6 | 5 | eleq2d 2822 | . . . . . 6 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑆 ∈ (Base‘𝑅) ↔ 𝑆 ∈ (Base‘if(𝑅 ∈ CRing, 𝑅, ℂfld)))) |
7 | 4, 6 | 3anbi13d 1437 | . . . . 5 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → ((𝑀 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) ↔ (𝑀 ∈ (Base‘(𝑁 Mat if(𝑅 ∈ CRing, 𝑅, ℂfld))) ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘if(𝑅 ∈ CRing, 𝑅, ℂfld))))) |
8 | 1, 7 | bitr3id 284 | . . . 4 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → ((𝑀 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅))) ↔ (𝑀 ∈ (Base‘(𝑁 Mat if(𝑅 ∈ CRing, 𝑅, ℂfld))) ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘if(𝑅 ∈ CRing, 𝑅, ℂfld))))) |
9 | oveq2 7346 | . . . . . 6 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑁 maDet 𝑅) = (𝑁 maDet if(𝑅 ∈ CRing, 𝑅, ℂfld))) | |
10 | oveq2 7346 | . . . . . . . 8 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑁 matRRep 𝑅) = (𝑁 matRRep if(𝑅 ∈ CRing, 𝑅, ℂfld))) | |
11 | 10 | oveqd 7355 | . . . . . . 7 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑀(𝑁 matRRep 𝑅)𝑆) = (𝑀(𝑁 matRRep if(𝑅 ∈ CRing, 𝑅, ℂfld))𝑆)) |
12 | 11 | oveqd 7355 | . . . . . 6 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐾) = (𝐾(𝑀(𝑁 matRRep if(𝑅 ∈ CRing, 𝑅, ℂfld))𝑆)𝐾)) |
13 | 9, 12 | fveq12d 6833 | . . . . 5 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → ((𝑁 maDet 𝑅)‘(𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐾)) = ((𝑁 maDet if(𝑅 ∈ CRing, 𝑅, ℂfld))‘(𝐾(𝑀(𝑁 matRRep if(𝑅 ∈ CRing, 𝑅, ℂfld))𝑆)𝐾))) |
14 | fveq2 6826 | . . . . . 6 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (.r‘𝑅) = (.r‘if(𝑅 ∈ CRing, 𝑅, ℂfld))) | |
15 | eqidd 2737 | . . . . . 6 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → 𝑆 = 𝑆) | |
16 | oveq2 7346 | . . . . . . 7 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → ((𝑁 ∖ {𝐾}) maDet 𝑅) = ((𝑁 ∖ {𝐾}) maDet if(𝑅 ∈ CRing, 𝑅, ℂfld))) | |
17 | oveq2 7346 | . . . . . . . . 9 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑁 subMat 𝑅) = (𝑁 subMat if(𝑅 ∈ CRing, 𝑅, ℂfld))) | |
18 | 17 | fveq1d 6828 | . . . . . . . 8 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → ((𝑁 subMat 𝑅)‘𝑀) = ((𝑁 subMat if(𝑅 ∈ CRing, 𝑅, ℂfld))‘𝑀)) |
19 | 18 | oveqd 7355 | . . . . . . 7 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝐾((𝑁 subMat 𝑅)‘𝑀)𝐾) = (𝐾((𝑁 subMat if(𝑅 ∈ CRing, 𝑅, ℂfld))‘𝑀)𝐾)) |
20 | 16, 19 | fveq12d 6833 | . . . . . 6 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (((𝑁 ∖ {𝐾}) maDet 𝑅)‘(𝐾((𝑁 subMat 𝑅)‘𝑀)𝐾)) = (((𝑁 ∖ {𝐾}) maDet if(𝑅 ∈ CRing, 𝑅, ℂfld))‘(𝐾((𝑁 subMat if(𝑅 ∈ CRing, 𝑅, ℂfld))‘𝑀)𝐾))) |
21 | 14, 15, 20 | oveq123d 7359 | . . . . 5 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑆(.r‘𝑅)(((𝑁 ∖ {𝐾}) maDet 𝑅)‘(𝐾((𝑁 subMat 𝑅)‘𝑀)𝐾))) = (𝑆(.r‘if(𝑅 ∈ CRing, 𝑅, ℂfld))(((𝑁 ∖ {𝐾}) maDet if(𝑅 ∈ CRing, 𝑅, ℂfld))‘(𝐾((𝑁 subMat if(𝑅 ∈ CRing, 𝑅, ℂfld))‘𝑀)𝐾)))) |
22 | 13, 21 | eqeq12d 2752 | . . . 4 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (((𝑁 maDet 𝑅)‘(𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐾)) = (𝑆(.r‘𝑅)(((𝑁 ∖ {𝐾}) maDet 𝑅)‘(𝐾((𝑁 subMat 𝑅)‘𝑀)𝐾))) ↔ ((𝑁 maDet if(𝑅 ∈ CRing, 𝑅, ℂfld))‘(𝐾(𝑀(𝑁 matRRep if(𝑅 ∈ CRing, 𝑅, ℂfld))𝑆)𝐾)) = (𝑆(.r‘if(𝑅 ∈ CRing, 𝑅, ℂfld))(((𝑁 ∖ {𝐾}) maDet if(𝑅 ∈ CRing, 𝑅, ℂfld))‘(𝐾((𝑁 subMat if(𝑅 ∈ CRing, 𝑅, ℂfld))‘𝑀)𝐾))))) |
23 | 8, 22 | imbi12d 344 | . . 3 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (((𝑀 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅))) → ((𝑁 maDet 𝑅)‘(𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐾)) = (𝑆(.r‘𝑅)(((𝑁 ∖ {𝐾}) maDet 𝑅)‘(𝐾((𝑁 subMat 𝑅)‘𝑀)𝐾)))) ↔ ((𝑀 ∈ (Base‘(𝑁 Mat if(𝑅 ∈ CRing, 𝑅, ℂfld))) ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘if(𝑅 ∈ CRing, 𝑅, ℂfld))) → ((𝑁 maDet if(𝑅 ∈ CRing, 𝑅, ℂfld))‘(𝐾(𝑀(𝑁 matRRep if(𝑅 ∈ CRing, 𝑅, ℂfld))𝑆)𝐾)) = (𝑆(.r‘if(𝑅 ∈ CRing, 𝑅, ℂfld))(((𝑁 ∖ {𝐾}) maDet if(𝑅 ∈ CRing, 𝑅, ℂfld))‘(𝐾((𝑁 subMat if(𝑅 ∈ CRing, 𝑅, ℂfld))‘𝑀)𝐾)))))) |
24 | cncrng 20726 | . . . . 5 ⊢ ℂfld ∈ CRing | |
25 | 24 | elimel 4543 | . . . 4 ⊢ if(𝑅 ∈ CRing, 𝑅, ℂfld) ∈ CRing |
26 | 25 | smadiadetg0 21930 | . . 3 ⊢ ((𝑀 ∈ (Base‘(𝑁 Mat if(𝑅 ∈ CRing, 𝑅, ℂfld))) ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘if(𝑅 ∈ CRing, 𝑅, ℂfld))) → ((𝑁 maDet if(𝑅 ∈ CRing, 𝑅, ℂfld))‘(𝐾(𝑀(𝑁 matRRep if(𝑅 ∈ CRing, 𝑅, ℂfld))𝑆)𝐾)) = (𝑆(.r‘if(𝑅 ∈ CRing, 𝑅, ℂfld))(((𝑁 ∖ {𝐾}) maDet if(𝑅 ∈ CRing, 𝑅, ℂfld))‘(𝐾((𝑁 subMat if(𝑅 ∈ CRing, 𝑅, ℂfld))‘𝑀)𝐾)))) |
27 | 23, 26 | dedth 4532 | . 2 ⊢ (𝑅 ∈ CRing → ((𝑀 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅))) → ((𝑁 maDet 𝑅)‘(𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐾)) = (𝑆(.r‘𝑅)(((𝑁 ∖ {𝐾}) maDet 𝑅)‘(𝐾((𝑁 subMat 𝑅)‘𝑀)𝐾))))) |
28 | 27 | impl 456 | 1 ⊢ (((𝑅 ∈ CRing ∧ 𝑀 ∈ (Base‘(𝑁 Mat 𝑅))) ∧ (𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅))) → ((𝑁 maDet 𝑅)‘(𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐾)) = (𝑆(.r‘𝑅)(((𝑁 ∖ {𝐾}) maDet 𝑅)‘(𝐾((𝑁 subMat 𝑅)‘𝑀)𝐾)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1086 = wceq 1540 ∈ wcel 2105 ∖ cdif 3895 ifcif 4474 {csn 4574 ‘cfv 6480 (class class class)co 7338 Basecbs 17010 .rcmulr 17061 CRingccrg 19880 ℂfldccnfld 20704 Mat cmat 21661 matRRep cmarrep 21812 subMat csubma 21832 maDet cmdat 21840 |
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 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2707 ax-rep 5230 ax-sep 5244 ax-nul 5251 ax-pow 5309 ax-pr 5373 ax-un 7651 ax-cnex 11029 ax-resscn 11030 ax-1cn 11031 ax-icn 11032 ax-addcl 11033 ax-addrcl 11034 ax-mulcl 11035 ax-mulrcl 11036 ax-mulcom 11037 ax-addass 11038 ax-mulass 11039 ax-distr 11040 ax-i2m1 11041 ax-1ne0 11042 ax-1rid 11043 ax-rnegex 11044 ax-rrecex 11045 ax-cnre 11046 ax-pre-lttri 11047 ax-pre-lttrn 11048 ax-pre-ltadd 11049 ax-pre-mulgt0 11050 ax-addf 11052 ax-mulf 11053 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-xor 1509 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3349 df-reu 3350 df-rab 3404 df-v 3443 df-sbc 3728 df-csb 3844 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3917 df-nul 4271 df-if 4475 df-pw 4550 df-sn 4575 df-pr 4577 df-tp 4579 df-op 4581 df-ot 4583 df-uni 4854 df-int 4896 df-iun 4944 df-iin 4945 df-br 5094 df-opab 5156 df-mpt 5177 df-tr 5211 df-id 5519 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5576 df-se 5577 df-we 5578 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6239 df-ord 6306 df-on 6307 df-lim 6308 df-suc 6309 df-iota 6432 df-fun 6482 df-fn 6483 df-f 6484 df-f1 6485 df-fo 6486 df-f1o 6487 df-fv 6488 df-isom 6489 df-riota 7294 df-ov 7341 df-oprab 7342 df-mpo 7343 df-of 7596 df-om 7782 df-1st 7900 df-2nd 7901 df-supp 8049 df-tpos 8113 df-frecs 8168 df-wrecs 8199 df-recs 8273 df-rdg 8312 df-1o 8368 df-2o 8369 df-er 8570 df-map 8689 df-pm 8690 df-ixp 8758 df-en 8806 df-dom 8807 df-sdom 8808 df-fin 8809 df-fsupp 9228 df-sup 9300 df-oi 9368 df-card 9797 df-pnf 11113 df-mnf 11114 df-xr 11115 df-ltxr 11116 df-le 11117 df-sub 11309 df-neg 11310 df-div 11735 df-nn 12076 df-2 12138 df-3 12139 df-4 12140 df-5 12141 df-6 12142 df-7 12143 df-8 12144 df-9 12145 df-n0 12336 df-xnn0 12408 df-z 12422 df-dec 12540 df-uz 12685 df-rp 12833 df-fz 13342 df-fzo 13485 df-seq 13824 df-exp 13885 df-hash 14147 df-word 14319 df-lsw 14367 df-concat 14375 df-s1 14401 df-substr 14453 df-pfx 14483 df-splice 14562 df-reverse 14571 df-s2 14661 df-struct 16946 df-sets 16963 df-slot 16981 df-ndx 16993 df-base 17011 df-ress 17040 df-plusg 17073 df-mulr 17074 df-starv 17075 df-sca 17076 df-vsca 17077 df-ip 17078 df-tset 17079 df-ple 17080 df-ds 17082 df-unif 17083 df-hom 17084 df-cco 17085 df-0g 17250 df-gsum 17251 df-prds 17256 df-pws 17258 df-mre 17393 df-mrc 17394 df-acs 17396 df-mgm 18424 df-sgrp 18473 df-mnd 18484 df-mhm 18528 df-submnd 18529 df-efmnd 18605 df-grp 18677 df-minusg 18678 df-mulg 18798 df-subg 18849 df-ghm 18929 df-gim 18972 df-cntz 19020 df-oppg 19047 df-symg 19072 df-pmtr 19147 df-psgn 19196 df-cmn 19484 df-abl 19485 df-mgp 19817 df-ur 19834 df-ring 19881 df-cring 19882 df-oppr 19958 df-dvdsr 19979 df-unit 19980 df-invr 20010 df-dvr 20021 df-rnghom 20055 df-drng 20096 df-subrg 20128 df-sra 20541 df-rgmod 20542 df-cnfld 20705 df-zring 20778 df-zrh 20812 df-dsmm 21046 df-frlm 21061 df-mat 21662 df-marrep 21814 df-subma 21833 df-mdet 21841 df-minmar1 21891 |
This theorem is referenced by: cramerimplem1 21939 madjusmdetlem1 32075 |
Copyright terms: Public domain | W3C validator |