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 20298. 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 1035 | . . . . 5 ⊢ ((𝑀 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) ↔ (𝑀 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)))) | |
2 | oveq2 6557 | . . . . . . . 8 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑁 Mat 𝑅) = (𝑁 Mat if(𝑅 ∈ CRing, 𝑅, ℂfld))) | |
3 | 2 | fveq2d 6107 | . . . . . . 7 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (Base‘(𝑁 Mat 𝑅)) = (Base‘(𝑁 Mat if(𝑅 ∈ CRing, 𝑅, ℂfld)))) |
4 | 3 | eleq2d 2673 | . . . . . 6 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑀 ∈ (Base‘(𝑁 Mat 𝑅)) ↔ 𝑀 ∈ (Base‘(𝑁 Mat if(𝑅 ∈ CRing, 𝑅, ℂfld))))) |
5 | fveq2 6103 | . . . . . . 7 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (Base‘𝑅) = (Base‘if(𝑅 ∈ CRing, 𝑅, ℂfld))) | |
6 | 5 | eleq2d 2673 | . . . . . 6 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑆 ∈ (Base‘𝑅) ↔ 𝑆 ∈ (Base‘if(𝑅 ∈ CRing, 𝑅, ℂfld)))) |
7 | 4, 6 | 3anbi13d 1393 | . . . . 5 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → ((𝑀 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) ↔ (𝑀 ∈ (Base‘(𝑁 Mat if(𝑅 ∈ CRing, 𝑅, ℂfld))) ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘if(𝑅 ∈ CRing, 𝑅, ℂfld))))) |
8 | 1, 7 | syl5bbr 273 | . . . 4 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → ((𝑀 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅))) ↔ (𝑀 ∈ (Base‘(𝑁 Mat if(𝑅 ∈ CRing, 𝑅, ℂfld))) ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘if(𝑅 ∈ CRing, 𝑅, ℂfld))))) |
9 | oveq2 6557 | . . . . . 6 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑁 maDet 𝑅) = (𝑁 maDet if(𝑅 ∈ CRing, 𝑅, ℂfld))) | |
10 | oveq2 6557 | . . . . . . . 8 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑁 matRRep 𝑅) = (𝑁 matRRep if(𝑅 ∈ CRing, 𝑅, ℂfld))) | |
11 | 10 | oveqd 6566 | . . . . . . 7 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑀(𝑁 matRRep 𝑅)𝑆) = (𝑀(𝑁 matRRep if(𝑅 ∈ CRing, 𝑅, ℂfld))𝑆)) |
12 | 11 | oveqd 6566 | . . . . . 6 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐾) = (𝐾(𝑀(𝑁 matRRep if(𝑅 ∈ CRing, 𝑅, ℂfld))𝑆)𝐾)) |
13 | 9, 12 | fveq12d 6109 | . . . . 5 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → ((𝑁 maDet 𝑅)‘(𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐾)) = ((𝑁 maDet if(𝑅 ∈ CRing, 𝑅, ℂfld))‘(𝐾(𝑀(𝑁 matRRep if(𝑅 ∈ CRing, 𝑅, ℂfld))𝑆)𝐾))) |
14 | fveq2 6103 | . . . . . 6 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (.r‘𝑅) = (.r‘if(𝑅 ∈ CRing, 𝑅, ℂfld))) | |
15 | eqidd 2611 | . . . . . 6 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → 𝑆 = 𝑆) | |
16 | oveq2 6557 | . . . . . . 7 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → ((𝑁 ∖ {𝐾}) maDet 𝑅) = ((𝑁 ∖ {𝐾}) maDet if(𝑅 ∈ CRing, 𝑅, ℂfld))) | |
17 | oveq2 6557 | . . . . . . . . 9 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑁 subMat 𝑅) = (𝑁 subMat if(𝑅 ∈ CRing, 𝑅, ℂfld))) | |
18 | 17 | fveq1d 6105 | . . . . . . . 8 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → ((𝑁 subMat 𝑅)‘𝑀) = ((𝑁 subMat if(𝑅 ∈ CRing, 𝑅, ℂfld))‘𝑀)) |
19 | 18 | oveqd 6566 | . . . . . . 7 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝐾((𝑁 subMat 𝑅)‘𝑀)𝐾) = (𝐾((𝑁 subMat if(𝑅 ∈ CRing, 𝑅, ℂfld))‘𝑀)𝐾)) |
20 | 16, 19 | fveq12d 6109 | . . . . . 6 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (((𝑁 ∖ {𝐾}) maDet 𝑅)‘(𝐾((𝑁 subMat 𝑅)‘𝑀)𝐾)) = (((𝑁 ∖ {𝐾}) maDet if(𝑅 ∈ CRing, 𝑅, ℂfld))‘(𝐾((𝑁 subMat if(𝑅 ∈ CRing, 𝑅, ℂfld))‘𝑀)𝐾))) |
21 | 14, 15, 20 | oveq123d 6570 | . . . . 5 ⊢ (𝑅 = if(𝑅 ∈ CRing, 𝑅, ℂfld) → (𝑆(.r‘𝑅)(((𝑁 ∖ {𝐾}) maDet 𝑅)‘(𝐾((𝑁 subMat 𝑅)‘𝑀)𝐾))) = (𝑆(.r‘if(𝑅 ∈ CRing, 𝑅, ℂfld))(((𝑁 ∖ {𝐾}) maDet if(𝑅 ∈ CRing, 𝑅, ℂfld))‘(𝐾((𝑁 subMat if(𝑅 ∈ CRing, 𝑅, ℂfld))‘𝑀)𝐾)))) |
22 | 13, 21 | eqeq12d 2625 | . . . 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 333 | . . 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 19586 | . . . . 5 ⊢ ℂfld ∈ CRing | |
25 | 24 | elimel 4100 | . . . 4 ⊢ if(𝑅 ∈ CRing, 𝑅, ℂfld) ∈ CRing |
26 | 25 | smadiadetg0 20299 | . . 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 4089 | . 2 ⊢ (𝑅 ∈ CRing → ((𝑀 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅))) → ((𝑁 maDet 𝑅)‘(𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐾)) = (𝑆(.r‘𝑅)(((𝑁 ∖ {𝐾}) maDet 𝑅)‘(𝐾((𝑁 subMat 𝑅)‘𝑀)𝐾))))) |
28 | 27 | impl 648 | 1 ⊢ (((𝑅 ∈ CRing ∧ 𝑀 ∈ (Base‘(𝑁 Mat 𝑅))) ∧ (𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅))) → ((𝑁 maDet 𝑅)‘(𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐾)) = (𝑆(.r‘𝑅)(((𝑁 ∖ {𝐾}) maDet 𝑅)‘(𝐾((𝑁 subMat 𝑅)‘𝑀)𝐾)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 ∖ cdif 3537 ifcif 4036 {csn 4125 ‘cfv 5804 (class class class)co 6549 Basecbs 15695 .rcmulr 15769 CRingccrg 18371 ℂfldccnfld 19567 Mat cmat 20032 matRRep cmarrep 20181 subMat csubma 20201 maDet cmdat 20209 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-inf2 8421 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 ax-addf 9894 ax-mulf 9895 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-xor 1457 df-tru 1478 df-fal 1481 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-ot 4134 df-uni 4373 df-int 4411 df-iun 4457 df-iin 4458 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-se 4998 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-isom 5813 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-of 6795 df-om 6958 df-1st 7059 df-2nd 7060 df-supp 7183 df-tpos 7239 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-2o 7448 df-oadd 7451 df-er 7629 df-map 7746 df-pm 7747 df-ixp 7795 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-fsupp 8159 df-sup 8231 df-oi 8298 df-card 8648 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-div 10564 df-nn 10898 df-2 10956 df-3 10957 df-4 10958 df-5 10959 df-6 10960 df-7 10961 df-8 10962 df-9 10963 df-n0 11170 df-xnn0 11241 df-z 11255 df-dec 11370 df-uz 11564 df-rp 11709 df-fz 12198 df-fzo 12335 df-seq 12664 df-exp 12723 df-hash 12980 df-word 13154 df-lsw 13155 df-concat 13156 df-s1 13157 df-substr 13158 df-splice 13159 df-reverse 13160 df-s2 13444 df-struct 15697 df-ndx 15698 df-slot 15699 df-base 15700 df-sets 15701 df-ress 15702 df-plusg 15781 df-mulr 15782 df-starv 15783 df-sca 15784 df-vsca 15785 df-ip 15786 df-tset 15787 df-ple 15788 df-ds 15791 df-unif 15792 df-hom 15793 df-cco 15794 df-0g 15925 df-gsum 15926 df-prds 15931 df-pws 15933 df-mre 16069 df-mrc 16070 df-acs 16072 df-mgm 17065 df-sgrp 17107 df-mnd 17118 df-mhm 17158 df-submnd 17159 df-grp 17248 df-minusg 17249 df-mulg 17364 df-subg 17414 df-ghm 17481 df-gim 17524 df-cntz 17573 df-oppg 17599 df-symg 17621 df-pmtr 17685 df-psgn 17734 df-cmn 18018 df-abl 18019 df-mgp 18313 df-ur 18325 df-ring 18372 df-cring 18373 df-oppr 18446 df-dvdsr 18464 df-unit 18465 df-invr 18495 df-dvr 18506 df-rnghom 18538 df-drng 18572 df-subrg 18601 df-sra 18993 df-rgmod 18994 df-cnfld 19568 df-zring 19638 df-zrh 19671 df-dsmm 19895 df-frlm 19910 df-mat 20033 df-marrep 20183 df-subma 20202 df-mdet 20210 df-minmar1 20260 |
This theorem is referenced by: cramerimplem1 20308 madjusmdetlem1 29221 |
Copyright terms: Public domain | W3C validator |