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 21274. 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 1090 | . . . . 5 ⊢ ((𝑀 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) ↔ (𝑀 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)))) | |
2 | oveq2 7156 | . . . . . . . 8 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑁 Mat 𝑅) = (𝑁 Mat if(𝑅 ∈ CRing, 𝑅, ℂfld))) | |
3 | 2 | fveq2d 6667 | . . . . . . 7 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (Base‘(𝑁 Mat 𝑅)) = (Base‘(𝑁 Mat if(𝑅 ∈ CRing, 𝑅, ℂfld)))) |
4 | 3 | eleq2d 2896 | . . . . . 6 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑀 ∈ (Base‘(𝑁 Mat 𝑅)) ↔ 𝑀 ∈ (Base‘(𝑁 Mat if(𝑅 ∈ CRing, 𝑅, ℂfld))))) |
5 | fveq2 6663 | . . . . . . 7 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (Base‘𝑅) = (Base‘if(𝑅 ∈ CRing, 𝑅, ℂfld))) | |
6 | 5 | eleq2d 2896 | . . . . . 6 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑆 ∈ (Base‘𝑅) ↔ 𝑆 ∈ (Base‘if(𝑅 ∈ CRing, 𝑅, ℂfld)))) |
7 | 4, 6 | 3anbi13d 1432 | . . . . 5 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → ((𝑀 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) ↔ (𝑀 ∈ (Base‘(𝑁 Mat if(𝑅 ∈ CRing, 𝑅, ℂfld))) ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘if(𝑅 ∈ CRing, 𝑅, ℂfld))))) |
8 | 1, 7 | syl5bbr 287 | . . . 4 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → ((𝑀 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅))) ↔ (𝑀 ∈ (Base‘(𝑁 Mat if(𝑅 ∈ CRing, 𝑅, ℂfld))) ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘if(𝑅 ∈ CRing, 𝑅, ℂfld))))) |
9 | oveq2 7156 | . . . . . 6 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑁 maDet 𝑅) = (𝑁 maDet if(𝑅 ∈ CRing, 𝑅, ℂfld))) | |
10 | oveq2 7156 | . . . . . . . 8 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑁 matRRep 𝑅) = (𝑁 matRRep if(𝑅 ∈ CRing, 𝑅, ℂfld))) | |
11 | 10 | oveqd 7165 | . . . . . . 7 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑀(𝑁 matRRep 𝑅)𝑆) = (𝑀(𝑁 matRRep if(𝑅 ∈ CRing, 𝑅, ℂfld))𝑆)) |
12 | 11 | oveqd 7165 | . . . . . 6 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐾) = (𝐾(𝑀(𝑁 matRRep if(𝑅 ∈ CRing, 𝑅, ℂfld))𝑆)𝐾)) |
13 | 9, 12 | fveq12d 6670 | . . . . 5 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → ((𝑁 maDet 𝑅)‘(𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐾)) = ((𝑁 maDet if(𝑅 ∈ CRing, 𝑅, ℂfld))‘(𝐾(𝑀(𝑁 matRRep if(𝑅 ∈ CRing, 𝑅, ℂfld))𝑆)𝐾))) |
14 | fveq2 6663 | . . . . . 6 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (.r‘𝑅) = (.r‘if(𝑅 ∈ CRing, 𝑅, ℂfld))) | |
15 | eqidd 2820 | . . . . . 6 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → 𝑆 = 𝑆) | |
16 | oveq2 7156 | . . . . . . 7 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → ((𝑁 ∖ {𝐾}) maDet 𝑅) = ((𝑁 ∖ {𝐾}) maDet if(𝑅 ∈ CRing, 𝑅, ℂfld))) | |
17 | oveq2 7156 | . . . . . . . . 9 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑁 subMat 𝑅) = (𝑁 subMat if(𝑅 ∈ CRing, 𝑅, ℂfld))) | |
18 | 17 | fveq1d 6665 | . . . . . . . 8 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → ((𝑁 subMat 𝑅)‘𝑀) = ((𝑁 subMat if(𝑅 ∈ CRing, 𝑅, ℂfld))‘𝑀)) |
19 | 18 | oveqd 7165 | . . . . . . 7 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝐾((𝑁 subMat 𝑅)‘𝑀)𝐾) = (𝐾((𝑁 subMat if(𝑅 ∈ CRing, 𝑅, ℂfld))‘𝑀)𝐾)) |
20 | 16, 19 | fveq12d 6670 | . . . . . 6 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (((𝑁 ∖ {𝐾}) maDet 𝑅)‘(𝐾((𝑁 subMat 𝑅)‘𝑀)𝐾)) = (((𝑁 ∖ {𝐾}) maDet if(𝑅 ∈ CRing, 𝑅, ℂfld))‘(𝐾((𝑁 subMat if(𝑅 ∈ CRing, 𝑅, ℂfld))‘𝑀)𝐾))) |
21 | 14, 15, 20 | oveq123d 7169 | . . . . 5 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑆(.r‘𝑅)(((𝑁 ∖ {𝐾}) maDet 𝑅)‘(𝐾((𝑁 subMat 𝑅)‘𝑀)𝐾))) = (𝑆(.r‘if(𝑅 ∈ CRing, 𝑅, ℂfld))(((𝑁 ∖ {𝐾}) maDet if(𝑅 ∈ CRing, 𝑅, ℂfld))‘(𝐾((𝑁 subMat if(𝑅 ∈ CRing, 𝑅, ℂfld))‘𝑀)𝐾)))) |
22 | 13, 21 | eqeq12d 2835 | . . . 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 347 | . . 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 20558 | . . . . 5 ⊢ ℂfld ∈ CRing | |
25 | 24 | elimel 4532 | . . . 4 ⊢ if(𝑅 ∈ CRing, 𝑅, ℂfld) ∈ CRing |
26 | 25 | smadiadetg0 21275 | . . 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 4521 | . 2 ⊢ (𝑅 ∈ CRing → ((𝑀 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅))) → ((𝑁 maDet 𝑅)‘(𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐾)) = (𝑆(.r‘𝑅)(((𝑁 ∖ {𝐾}) maDet 𝑅)‘(𝐾((𝑁 subMat 𝑅)‘𝑀)𝐾))))) |
28 | 27 | impl 458 | 1 ⊢ (((𝑅 ∈ CRing ∧ 𝑀 ∈ (Base‘(𝑁 Mat 𝑅))) ∧ (𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅))) → ((𝑁 maDet 𝑅)‘(𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐾)) = (𝑆(.r‘𝑅)(((𝑁 ∖ {𝐾}) maDet 𝑅)‘(𝐾((𝑁 subMat 𝑅)‘𝑀)𝐾)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1082 = wceq 1531 ∈ wcel 2108 ∖ cdif 3931 ifcif 4465 {csn 4559 ‘cfv 6348 (class class class)co 7148 Basecbs 16475 .rcmulr 16558 CRingccrg 19290 ℂfldccnfld 20537 Mat cmat 21008 matRRep cmarrep 21157 subMat csubma 21177 maDet cmdat 21185 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1905 ax-6 1964 ax-7 2009 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2154 ax-12 2170 ax-ext 2791 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7453 ax-cnex 10585 ax-resscn 10586 ax-1cn 10587 ax-icn 10588 ax-addcl 10589 ax-addrcl 10590 ax-mulcl 10591 ax-mulrcl 10592 ax-mulcom 10593 ax-addass 10594 ax-mulass 10595 ax-distr 10596 ax-i2m1 10597 ax-1ne0 10598 ax-1rid 10599 ax-rnegex 10600 ax-rrecex 10601 ax-cnre 10602 ax-pre-lttri 10603 ax-pre-lttrn 10604 ax-pre-ltadd 10605 ax-pre-mulgt0 10606 ax-addf 10608 ax-mulf 10609 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1083 df-3an 1084 df-xor 1499 df-tru 1534 df-fal 1544 df-ex 1775 df-nf 1779 df-sb 2064 df-mo 2616 df-eu 2648 df-clab 2798 df-cleq 2812 df-clel 2891 df-nfc 2961 df-ne 3015 df-nel 3122 df-ral 3141 df-rex 3142 df-reu 3143 df-rmo 3144 df-rab 3145 df-v 3495 df-sbc 3771 df-csb 3882 df-dif 3937 df-un 3939 df-in 3941 df-ss 3950 df-pss 3952 df-nul 4290 df-if 4466 df-pw 4539 df-sn 4560 df-pr 4562 df-tp 4564 df-op 4566 df-ot 4568 df-uni 4831 df-int 4868 df-iun 4912 df-iin 4913 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-se 5508 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-isom 6357 df-riota 7106 df-ov 7151 df-oprab 7152 df-mpo 7153 df-of 7401 df-om 7573 df-1st 7681 df-2nd 7682 df-supp 7823 df-tpos 7884 df-wrecs 7939 df-recs 8000 df-rdg 8038 df-1o 8094 df-2o 8095 df-oadd 8098 df-er 8281 df-map 8400 df-pm 8401 df-ixp 8454 df-en 8502 df-dom 8503 df-sdom 8504 df-fin 8505 df-fsupp 8826 df-sup 8898 df-oi 8966 df-card 9360 df-pnf 10669 df-mnf 10670 df-xr 10671 df-ltxr 10672 df-le 10673 df-sub 10864 df-neg 10865 df-div 11290 df-nn 11631 df-2 11692 df-3 11693 df-4 11694 df-5 11695 df-6 11696 df-7 11697 df-8 11698 df-9 11699 df-n0 11890 df-xnn0 11960 df-z 11974 df-dec 12091 df-uz 12236 df-rp 12382 df-fz 12885 df-fzo 13026 df-seq 13362 df-exp 13422 df-hash 13683 df-word 13854 df-lsw 13907 df-concat 13915 df-s1 13942 df-substr 13995 df-pfx 14025 df-splice 14104 df-reverse 14113 df-s2 14202 df-struct 16477 df-ndx 16478 df-slot 16479 df-base 16481 df-sets 16482 df-ress 16483 df-plusg 16570 df-mulr 16571 df-starv 16572 df-sca 16573 df-vsca 16574 df-ip 16575 df-tset 16576 df-ple 16577 df-ds 16579 df-unif 16580 df-hom 16581 df-cco 16582 df-0g 16707 df-gsum 16708 df-prds 16713 df-pws 16715 df-mre 16849 df-mrc 16850 df-acs 16852 df-mgm 17844 df-sgrp 17893 df-mnd 17904 df-mhm 17948 df-submnd 17949 df-efmnd 18026 df-grp 18098 df-minusg 18099 df-mulg 18217 df-subg 18268 df-ghm 18348 df-gim 18391 df-cntz 18439 df-oppg 18466 df-symg 18488 df-pmtr 18562 df-psgn 18611 df-cmn 18900 df-abl 18901 df-mgp 19232 df-ur 19244 df-ring 19291 df-cring 19292 df-oppr 19365 df-dvdsr 19383 df-unit 19384 df-invr 19414 df-dvr 19425 df-rnghom 19459 df-drng 19496 df-subrg 19525 df-sra 19936 df-rgmod 19937 df-cnfld 20538 df-zring 20610 df-zrh 20643 df-dsmm 20868 df-frlm 20883 df-mat 21009 df-marrep 21159 df-subma 21178 df-mdet 21186 df-minmar1 21236 |
This theorem is referenced by: cramerimplem1 21284 madjusmdetlem1 31085 |
Copyright terms: Public domain | W3C validator |