| 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 2730 | . . 3 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 6 | eqid 2730 | . . 3 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 7 | 1, 2, 3, 4, 5, 6 | maducoeval 22532 | . 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗))))) |
| 8 | eqid 2730 | . . . . . 6 ⊢ (𝑁 minMatR1 𝑅) = (𝑁 minMatR1 𝑅) | |
| 9 | 1, 4, 8, 5, 6 | minmar1val 22541 | . . . . 5 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐻 ∈ 𝑁 ∧ 𝐼 ∈ 𝑁) → (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗)))) |
| 10 | 9 | 3com23 1126 | . . . 4 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗)))) |
| 11 | 10 | eqcomd 2736 | . . 3 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗))) = (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼)) |
| 12 | 11 | fveq2d 6864 | . 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐷‘(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗)))) = (𝐷‘(𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼))) |
| 13 | 7, 12 | eqtrd 2765 | 1 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ifcif 4490 ‘cfv 6513 (class class class)co 7389 ∈ cmpo 7391 Basecbs 17185 0gc0g 17408 1rcur 20096 Mat cmat 22300 maDet cmdat 22477 maAdju cmadu 22525 minMatR1 cminmar1 22526 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5236 ax-sep 5253 ax-nul 5263 ax-pow 5322 ax-pr 5389 ax-un 7713 ax-cnex 11130 ax-1cn 11132 ax-addcl 11134 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3756 df-csb 3865 df-dif 3919 df-un 3921 df-in 3923 df-ss 3933 df-pss 3936 df-nul 4299 df-if 4491 df-pw 4567 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-iun 4959 df-br 5110 df-opab 5172 df-mpt 5191 df-tr 5217 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 6276 df-ord 6337 df-on 6338 df-lim 6339 df-suc 6340 df-iota 6466 df-fun 6515 df-fn 6516 df-f 6517 df-f1 6518 df-fo 6519 df-f1o 6520 df-fv 6521 df-ov 7392 df-oprab 7393 df-mpo 7394 df-om 7845 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8380 df-nn 12188 df-slot 17158 df-ndx 17170 df-base 17186 df-mat 22301 df-madu 22527 df-minmar1 22528 |
| This theorem is referenced by: madjusmdetlem1 33823 |
| Copyright terms: Public domain | W3C validator |