MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  maducoevalmin1 Structured version   Visualization version   GIF version

Theorem maducoevalmin1 22375
Description: The coefficients of an adjunct (matrix of cofactors) expressed as determinants of the minor matrices (alternative definition) of the original matrix. (Contributed by AV, 31-Dec-2018.)
Hypotheses
Ref Expression
maducoevalmin1.a 𝐴 = (𝑁 Mat 𝑅)
maducoevalmin1.b 𝐵 = (Base‘𝐴)
maducoevalmin1.d 𝐷 = (𝑁 maDet 𝑅)
maducoevalmin1.j 𝐽 = (𝑁 maAdju 𝑅)
Assertion
Ref Expression
maducoevalmin1 ((𝑀𝐵𝐼𝑁𝐻𝑁) → (𝐼(𝐽𝑀)𝐻) = (𝐷‘(𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼)))

Proof of Theorem maducoevalmin1
Dummy variables 𝑖 𝑗 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 maducoevalmin1.a . . 3 𝐴 = (𝑁 Mat 𝑅)
2 maducoevalmin1.d . . 3 𝐷 = (𝑁 maDet 𝑅)
3 maducoevalmin1.j . . 3 𝐽 = (𝑁 maAdju 𝑅)
4 maducoevalmin1.b . . 3 𝐵 = (Base‘𝐴)
5 eqid 2731 . . 3 (1r𝑅) = (1r𝑅)
6 eqid 2731 . . 3 (0g𝑅) = (0g𝑅)
71, 2, 3, 4, 5, 6maducoeval 22362 . 2 ((𝑀𝐵𝐼𝑁𝐻𝑁) → (𝐼(𝐽𝑀)𝐻) = (𝐷‘(𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r𝑅), (0g𝑅)), (𝑖𝑀𝑗)))))
8 eqid 2731 . . . . . 6 (𝑁 minMatR1 𝑅) = (𝑁 minMatR1 𝑅)
91, 4, 8, 5, 6minmar1val 22371 . . . . 5 ((𝑀𝐵𝐻𝑁𝐼𝑁) → (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r𝑅), (0g𝑅)), (𝑖𝑀𝑗))))
1093com23 1125 . . . 4 ((𝑀𝐵𝐼𝑁𝐻𝑁) → (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r𝑅), (0g𝑅)), (𝑖𝑀𝑗))))
1110eqcomd 2737 . . 3 ((𝑀𝐵𝐼𝑁𝐻𝑁) → (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r𝑅), (0g𝑅)), (𝑖𝑀𝑗))) = (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼))
1211fveq2d 6896 . 2 ((𝑀𝐵𝐼𝑁𝐻𝑁) → (𝐷‘(𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r𝑅), (0g𝑅)), (𝑖𝑀𝑗)))) = (𝐷‘(𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼)))
137, 12eqtrd 2771 1 ((𝑀𝐵𝐼𝑁𝐻𝑁) → (𝐼(𝐽𝑀)𝐻) = (𝐷‘(𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1086   = wceq 1540  wcel 2105  ifcif 4529  cfv 6544  (class class class)co 7412  cmpo 7414  Basecbs 17149  0gc0g 17390  1rcur 20076   Mat cmat 22128   maDet cmdat 22307   maAdju cmadu 22355   minMatR1 cminmar1 22356
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 2702  ax-rep 5286  ax-sep 5300  ax-nul 5307  ax-pow 5364  ax-pr 5428  ax-un 7728  ax-cnex 11169  ax-1cn 11171  ax-addcl 11173
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3376  df-rab 3432  df-v 3475  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-pss 3968  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-iun 5000  df-br 5150  df-opab 5212  df-mpt 5233  df-tr 5267  df-id 5575  df-eprel 5581  df-po 5589  df-so 5590  df-fr 5632  df-we 5634  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-pred 6301  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551  df-fv 6552  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7859  df-1st 7978  df-2nd 7979  df-frecs 8269  df-wrecs 8300  df-recs 8374  df-rdg 8413  df-nn 12218  df-slot 17120  df-ndx 17132  df-base 17150  df-mat 22129  df-madu 22357  df-minmar1 22358
This theorem is referenced by:  madjusmdetlem1  33102
  Copyright terms: Public domain W3C validator