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

Theorem maducoevalmin1 22577
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 2733 . . 3 (1r𝑅) = (1r𝑅)
6 eqid 2733 . . 3 (0g𝑅) = (0g𝑅)
71, 2, 3, 4, 5, 6maducoeval 22564 . 2 ((𝑀𝐵𝐼𝑁𝐻𝑁) → (𝐼(𝐽𝑀)𝐻) = (𝐷‘(𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r𝑅), (0g𝑅)), (𝑖𝑀𝑗)))))
8 eqid 2733 . . . . . 6 (𝑁 minMatR1 𝑅) = (𝑁 minMatR1 𝑅)
91, 4, 8, 5, 6minmar1val 22573 . . . . 5 ((𝑀𝐵𝐻𝑁𝐼𝑁) → (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r𝑅), (0g𝑅)), (𝑖𝑀𝑗))))
1093com23 1126 . . . 4 ((𝑀𝐵𝐼𝑁𝐻𝑁) → (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r𝑅), (0g𝑅)), (𝑖𝑀𝑗))))
1110eqcomd 2739 . . 3 ((𝑀𝐵𝐼𝑁𝐻𝑁) → (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r𝑅), (0g𝑅)), (𝑖𝑀𝑗))) = (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼))
1211fveq2d 6835 . 2 ((𝑀𝐵𝐼𝑁𝐻𝑁) → (𝐷‘(𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r𝑅), (0g𝑅)), (𝑖𝑀𝑗)))) = (𝐷‘(𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼)))
137, 12eqtrd 2768 1 ((𝑀𝐵𝐼𝑁𝐻𝑁) → (𝐼(𝐽𝑀)𝐻) = (𝐷‘(𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1086   = wceq 1541  wcel 2113  ifcif 4476  cfv 6489  (class class class)co 7355  cmpo 7357  Basecbs 17130  0gc0g 17353  1rcur 20109   Mat cmat 22332   maDet cmdat 22509   maAdju cmadu 22557   minMatR1 cminmar1 22558
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 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7677  ax-cnex 11072  ax-1cn 11074  ax-addcl 11076
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  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 6256  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-ov 7358  df-oprab 7359  df-mpo 7360  df-om 7806  df-1st 7930  df-2nd 7931  df-frecs 8220  df-wrecs 8251  df-recs 8300  df-rdg 8338  df-nn 12136  df-slot 17103  df-ndx 17115  df-base 17131  df-mat 22333  df-madu 22559  df-minmar1 22560
This theorem is referenced by:  madjusmdetlem1  33851
  Copyright terms: Public domain W3C validator