![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > maducoevalmin1 | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
maducoevalmin1.a | ⊢ 𝐴 = (𝑁 Mat 𝑅) |
maducoevalmin1.b | ⊢ 𝐵 = (Base‘𝐴) |
maducoevalmin1.d | ⊢ 𝐷 = (𝑁 maDet 𝑅) |
maducoevalmin1.j | ⊢ 𝐽 = (𝑁 maAdju 𝑅) |
Ref | Expression |
---|---|
maducoevalmin1 | ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | maducoevalmin1.a | . . 3 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
2 | maducoevalmin1.d | . . 3 ⊢ 𝐷 = (𝑁 maDet 𝑅) | |
3 | maducoevalmin1.j | . . 3 ⊢ 𝐽 = (𝑁 maAdju 𝑅) | |
4 | maducoevalmin1.b | . . 3 ⊢ 𝐵 = (Base‘𝐴) | |
5 | eqid 2740 | . . 3 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
6 | eqid 2740 | . . 3 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
7 | 1, 2, 3, 4, 5, 6 | maducoeval 22666 | . 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗))))) |
8 | eqid 2740 | . . . . . 6 ⊢ (𝑁 minMatR1 𝑅) = (𝑁 minMatR1 𝑅) | |
9 | 1, 4, 8, 5, 6 | minmar1val 22675 | . . . . 5 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐻 ∈ 𝑁 ∧ 𝐼 ∈ 𝑁) → (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗)))) |
10 | 9 | 3com23 1126 | . . . 4 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗)))) |
11 | 10 | eqcomd 2746 | . . 3 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗))) = (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼)) |
12 | 11 | fveq2d 6924 | . 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐷‘(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗)))) = (𝐷‘(𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼))) |
13 | 7, 12 | eqtrd 2780 | 1 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1087 = wceq 1537 ∈ wcel 2108 ifcif 4548 ‘cfv 6573 (class class class)co 7448 ∈ cmpo 7450 Basecbs 17258 0gc0g 17499 1rcur 20208 Mat cmat 22432 maDet cmdat 22611 maAdju cmadu 22659 minMatR1 cminmar1 22660 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-1cn 11242 ax-addcl 11244 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-nn 12294 df-slot 17229 df-ndx 17241 df-base 17259 df-mat 22433 df-madu 22661 df-minmar1 22662 |
This theorem is referenced by: madjusmdetlem1 33773 |
Copyright terms: Public domain | W3C validator |