| 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 2756 | . . 3 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 6 | eqid 2756 | . . 3 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 7 | 1, 2, 3, 4, 5, 6 | maducoeval 22672 | . 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗))))) |
| 8 | eqid 2756 | . . . . . 6 ⊢ (𝑁 minMatR1 𝑅) = (𝑁 minMatR1 𝑅) | |
| 9 | 1, 4, 8, 5, 6 | minmar1val 22681 | . . . . 5 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐻 ∈ 𝑁 ∧ 𝐼 ∈ 𝑁) → (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗)))) |
| 10 | 9 | 3com23 1135 | . . . 4 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗)))) |
| 11 | 10 | eqcomd 2762 | . . 3 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗))) = (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼)) |
| 12 | 11 | fveq2d 6860 | . 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐷‘(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗)))) = (𝐷‘(𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼))) |
| 13 | 7, 12 | eqtrd 2791 | 1 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1095 = wceq 1554 ∈ wcel 2136 ifcif 4474 ‘cfv 6510 (class class class)co 7385 ∈ cmpo 7387 Basecbs 17221 0gc0g 17444 1rcur 20203 Mat cmat 22440 maDet cmdat 22617 maAdju cmadu 22665 minMatR1 cminmar1 22666 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-10 2169 ax-11 2185 ax-12 2206 ax-ext 2728 ax-rep 5221 ax-sep 5240 ax-nul 5250 ax-pow 5316 ax-pr 5384 ax-un 7707 ax-cnex 11119 ax-1cn 11121 ax-addcl 11123 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-nf 1798 df-sb 2085 df-mo 2560 df-eu 2590 df-clab 2735 df-cleq 2748 df-clel 2831 df-nfc 2905 df-ne 2952 df-ral 3071 df-rex 3081 df-reu 3362 df-rab 3409 df-v 3450 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4281 df-if 4475 df-pw 4551 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-iun 4945 df-br 5095 df-opab 5157 df-mpt 5176 df-tr 5202 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6466 df-fun 6512 df-fn 6513 df-f 6514 df-f1 6515 df-fo 6516 df-f1o 6517 df-fv 6518 df-ov 7388 df-oprab 7389 df-mpo 7390 df-om 7836 df-1st 7959 df-2nd 7960 df-frecs 8250 df-wrecs 8281 df-recs 8330 df-rdg 8369 df-nn 12201 df-slot 17194 df-ndx 17206 df-base 17222 df-mat 22441 df-madu 22667 df-minmar1 22668 |
| This theorem is referenced by: madjusmdetlem1 34078 |
| Copyright terms: Public domain | W3C validator |