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

Theorem maducoevalmin1 22600
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 2737 . . 3 (1r𝑅) = (1r𝑅)
6 eqid 2737 . . 3 (0g𝑅) = (0g𝑅)
71, 2, 3, 4, 5, 6maducoeval 22587 . 2 ((𝑀𝐵𝐼𝑁𝐻𝑁) → (𝐼(𝐽𝑀)𝐻) = (𝐷‘(𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r𝑅), (0g𝑅)), (𝑖𝑀𝑗)))))
8 eqid 2737 . . . . . 6 (𝑁 minMatR1 𝑅) = (𝑁 minMatR1 𝑅)
91, 4, 8, 5, 6minmar1val 22596 . . . . 5 ((𝑀𝐵𝐻𝑁𝐼𝑁) → (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r𝑅), (0g𝑅)), (𝑖𝑀𝑗))))
1093com23 1127 . . . 4 ((𝑀𝐵𝐼𝑁𝐻𝑁) → (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r𝑅), (0g𝑅)), (𝑖𝑀𝑗))))
1110eqcomd 2743 . . 3 ((𝑀𝐵𝐼𝑁𝐻𝑁) → (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r𝑅), (0g𝑅)), (𝑖𝑀𝑗))) = (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼))
1211fveq2d 6839 . 2 ((𝑀𝐵𝐼𝑁𝐻𝑁) → (𝐷‘(𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r𝑅), (0g𝑅)), (𝑖𝑀𝑗)))) = (𝐷‘(𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼)))
137, 12eqtrd 2772 1 ((𝑀𝐵𝐼𝑁𝐻𝑁) → (𝐼(𝐽𝑀)𝐻) = (𝐷‘(𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1087   = wceq 1542  wcel 2114  ifcif 4480  cfv 6493  (class class class)co 7360  cmpo 7362  Basecbs 17140  0gc0g 17363  1rcur 20120   Mat cmat 22355   maDet cmdat 22532   maAdju cmadu 22580   minMatR1 cminmar1 22581
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5225  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7682  ax-cnex 11086  ax-1cn 11088  ax-addcl 11090
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4949  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6260  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1st 7935  df-2nd 7936  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-nn 12150  df-slot 17113  df-ndx 17125  df-base 17141  df-mat 22356  df-madu 22582  df-minmar1 22583
This theorem is referenced by:  madjusmdetlem1  33965
  Copyright terms: Public domain W3C validator