| 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 2763 | . . 3 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 6 | eqid 2763 | . . 3 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 7 | 1, 2, 3, 4, 5, 6 | maducoeval 22984 | . 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗))))) |
| 8 | eqid 2763 | . . . . . 6 ⊢ (𝑁 minMatR1 𝑅) = (𝑁 minMatR1 𝑅) | |
| 9 | 1, 4, 8, 5, 6 | minmar1val 22993 | . . . . 5 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐻 ∈ 𝑁 ∧ 𝐼 ∈ 𝑁) → (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗)))) |
| 10 | 9 | 3com23 1144 | . . . 4 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗)))) |
| 11 | 10 | eqcomd 2769 | . . 3 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗))) = (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼)) |
| 12 | 11 | fveq2d 6912 | . 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐷‘(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗)))) = (𝐷‘(𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼))) |
| 13 | 7, 12 | eqtrd 2798 | 1 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ifcif 4485 ‘cfv 6558 (class class class)co 7443 ∈ cmpo 7445 Basecbs 17416 0gc0g 17639 1rcur 20437 Mat cmat 22752 maDet cmdat 22929 maAdju cmadu 22977 minMatR1 cminmar1 22978 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-cnex 11283 ax-1cn 11285 ax-addcl 11287 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7902 df-1st 8025 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-nn 12363 df-slot 17389 df-ndx 17401 df-base 17417 df-mat 22753 df-madu 22979 df-minmar1 22980 |
| This theorem is used by: madjusmdetlem1 34529 |
| Copyright terms: Public domain | W3C validator |