Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > maduval | Structured version Visualization version GIF version |
Description: Second substitution for the adjunct (cofactor) matrix. (Contributed by SO, 11-Jul-2018.) |
Ref | Expression |
---|---|
madufval.a | ⊢ 𝐴 = (𝑁 Mat 𝑅) |
madufval.d | ⊢ 𝐷 = (𝑁 maDet 𝑅) |
madufval.j | ⊢ 𝐽 = (𝑁 maAdju 𝑅) |
madufval.b | ⊢ 𝐵 = (Base‘𝐴) |
madufval.o | ⊢ 1 = (1r‘𝑅) |
madufval.z | ⊢ 0 = (0g‘𝑅) |
Ref | Expression |
---|---|
maduval | ⊢ (𝑀 ∈ 𝐵 → (𝐽‘𝑀) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙)))))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | madufval.a | . . . . 5 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
2 | madufval.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐴) | |
3 | 1, 2 | matrcl 21015 | . . . 4 ⊢ (𝑀 ∈ 𝐵 → (𝑁 ∈ Fin ∧ 𝑅 ∈ V)) |
4 | 3 | simpld 497 | . . 3 ⊢ (𝑀 ∈ 𝐵 → 𝑁 ∈ Fin) |
5 | mpoexga 7769 | . . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑁 ∈ Fin) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙))))) ∈ V) | |
6 | 4, 4, 5 | syl2anc 586 | . 2 ⊢ (𝑀 ∈ 𝐵 → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙))))) ∈ V) |
7 | oveq 7156 | . . . . . . . 8 ⊢ (𝑚 = 𝑀 → (𝑘𝑚𝑙) = (𝑘𝑀𝑙)) | |
8 | 7 | ifeq2d 4486 | . . . . . . 7 ⊢ (𝑚 = 𝑀 → if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑚𝑙)) = if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙))) |
9 | 8 | mpoeq3dv 7227 | . . . . . 6 ⊢ (𝑚 = 𝑀 → (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑚𝑙))) = (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙)))) |
10 | 9 | 3ad2ant1 1129 | . . . . 5 ⊢ ((𝑚 = 𝑀 ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑚𝑙))) = (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙)))) |
11 | 10 | fveq2d 6669 | . . . 4 ⊢ ((𝑚 = 𝑀 ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑚𝑙)))) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙))))) |
12 | 11 | mpoeq3dva 7225 | . . 3 ⊢ (𝑚 = 𝑀 → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑚𝑙))))) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙)))))) |
13 | madufval.d | . . . 4 ⊢ 𝐷 = (𝑁 maDet 𝑅) | |
14 | madufval.j | . . . 4 ⊢ 𝐽 = (𝑁 maAdju 𝑅) | |
15 | madufval.o | . . . 4 ⊢ 1 = (1r‘𝑅) | |
16 | madufval.z | . . . 4 ⊢ 0 = (0g‘𝑅) | |
17 | 1, 13, 14, 2, 15, 16 | madufval 21240 | . . 3 ⊢ 𝐽 = (𝑚 ∈ 𝐵 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑚𝑙)))))) |
18 | 12, 17 | fvmptg 6761 | . 2 ⊢ ((𝑀 ∈ 𝐵 ∧ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙))))) ∈ V) → (𝐽‘𝑀) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙)))))) |
19 | 6, 18 | mpdan 685 | 1 ⊢ (𝑀 ∈ 𝐵 → (𝐽‘𝑀) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙)))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1083 = wceq 1533 ∈ wcel 2110 Vcvv 3495 ifcif 4467 ‘cfv 6350 (class class class)co 7150 ∈ cmpo 7152 Fincfn 8503 Basecbs 16477 0gc0g 16707 1rcur 19245 Mat cmat 21010 maDet cmdat 21187 maAdju cmadu 21235 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-rep 5183 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4833 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-id 5455 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-ov 7153 df-oprab 7154 df-mpo 7155 df-1st 7683 df-2nd 7684 df-slot 16481 df-base 16483 df-mat 21011 df-madu 21237 |
This theorem is referenced by: maducoeval 21242 |
Copyright terms: Public domain | W3C validator |