| 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 2737 | . . 3 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 6 | eqid 2737 | . . 3 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 7 | 1, 2, 3, 4, 5, 6 | maducoeval 22595 | . 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗))))) |
| 8 | eqid 2737 | . . . . . 6 ⊢ (𝑁 minMatR1 𝑅) = (𝑁 minMatR1 𝑅) | |
| 9 | 1, 4, 8, 5, 6 | minmar1val 22604 | . . . . 5 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐻 ∈ 𝑁 ∧ 𝐼 ∈ 𝑁) → (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗)))) |
| 10 | 9 | 3com23 1127 | . . . 4 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗)))) |
| 11 | 10 | eqcomd 2743 | . . 3 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗))) = (𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼)) |
| 12 | 11 | fveq2d 6846 | . 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐷‘(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐻, if(𝑗 = 𝐼, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗)))) = (𝐷‘(𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼))) |
| 13 | 7, 12 | eqtrd 2772 | 1 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝐻((𝑁 minMatR1 𝑅)‘𝑀)𝐼))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ifcif 4481 ‘cfv 6500 (class class class)co 7368 ∈ cmpo 7370 Basecbs 17148 0gc0g 17371 1rcur 20128 Mat cmat 22363 maDet cmdat 22540 maAdju cmadu 22588 minMatR1 cminmar1 22589 |
| 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 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-1cn 11096 ax-addcl 11098 |
| 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 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-nn 12158 df-slot 17121 df-ndx 17133 df-base 17149 df-mat 22364 df-madu 22590 df-minmar1 22591 |
| This theorem is referenced by: madjusmdetlem1 34004 |
| Copyright terms: Public domain | W3C validator |