Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > marepvval | Structured version Visualization version GIF version |
Description: Third substitution for the definition of the function replacing a column of a matrix by a vector. (Contributed by AV, 14-Feb-2019.) (Revised by AV, 26-Feb-2019.) |
Ref | Expression |
---|---|
marepvfval.a | ⊢ 𝐴 = (𝑁 Mat 𝑅) |
marepvfval.b | ⊢ 𝐵 = (Base‘𝐴) |
marepvfval.q | ⊢ 𝑄 = (𝑁 matRepV 𝑅) |
marepvfval.v | ⊢ 𝑉 = ((Base‘𝑅) ↑m 𝑁) |
Ref | Expression |
---|---|
marepvval | ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) → ((𝑀𝑄𝐶)‘𝐾) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐾, (𝐶‘𝑖), (𝑖𝑀𝑗)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | marepvfval.a | . . . . 5 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
2 | marepvfval.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐴) | |
3 | marepvfval.q | . . . . 5 ⊢ 𝑄 = (𝑁 matRepV 𝑅) | |
4 | marepvfval.v | . . . . 5 ⊢ 𝑉 = ((Base‘𝑅) ↑m 𝑁) | |
5 | 1, 2, 3, 4 | marepvval0 21171 | . . . 4 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉) → (𝑀𝑄𝐶) = (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝐶‘𝑖), (𝑖𝑀𝑗))))) |
6 | 5 | 3adant3 1129 | . . 3 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) → (𝑀𝑄𝐶) = (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝐶‘𝑖), (𝑖𝑀𝑗))))) |
7 | 6 | fveq1d 6647 | . 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) → ((𝑀𝑄𝐶)‘𝐾) = ((𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝐶‘𝑖), (𝑖𝑀𝑗))))‘𝐾)) |
8 | eqid 2798 | . . 3 ⊢ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝐶‘𝑖), (𝑖𝑀𝑗)))) = (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝐶‘𝑖), (𝑖𝑀𝑗)))) | |
9 | eqeq2 2810 | . . . . 5 ⊢ (𝑘 = 𝐾 → (𝑗 = 𝑘 ↔ 𝑗 = 𝐾)) | |
10 | 9 | ifbid 4447 | . . . 4 ⊢ (𝑘 = 𝐾 → if(𝑗 = 𝑘, (𝐶‘𝑖), (𝑖𝑀𝑗)) = if(𝑗 = 𝐾, (𝐶‘𝑖), (𝑖𝑀𝑗))) |
11 | 10 | mpoeq3dv 7212 | . . 3 ⊢ (𝑘 = 𝐾 → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝐶‘𝑖), (𝑖𝑀𝑗))) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐾, (𝐶‘𝑖), (𝑖𝑀𝑗)))) |
12 | simp3 1135 | . . 3 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) → 𝐾 ∈ 𝑁) | |
13 | 1, 2 | matrcl 21017 | . . . . . . 7 ⊢ (𝑀 ∈ 𝐵 → (𝑁 ∈ Fin ∧ 𝑅 ∈ V)) |
14 | 13 | simpld 498 | . . . . . 6 ⊢ (𝑀 ∈ 𝐵 → 𝑁 ∈ Fin) |
15 | 14, 14 | jca 515 | . . . . 5 ⊢ (𝑀 ∈ 𝐵 → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin)) |
16 | 15 | 3ad2ant1 1130 | . . . 4 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin)) |
17 | mpoexga 7758 | . . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑁 ∈ Fin) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐾, (𝐶‘𝑖), (𝑖𝑀𝑗))) ∈ V) | |
18 | 16, 17 | syl 17 | . . 3 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐾, (𝐶‘𝑖), (𝑖𝑀𝑗))) ∈ V) |
19 | 8, 11, 12, 18 | fvmptd3 6768 | . 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) → ((𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝐶‘𝑖), (𝑖𝑀𝑗))))‘𝐾) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐾, (𝐶‘𝑖), (𝑖𝑀𝑗)))) |
20 | 7, 19 | eqtrd 2833 | 1 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) → ((𝑀𝑄𝐶)‘𝐾) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐾, (𝐶‘𝑖), (𝑖𝑀𝑗)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 Vcvv 3441 ifcif 4425 ↦ cmpt 5110 ‘cfv 6324 (class class class)co 7135 ∈ cmpo 7137 ↑m cmap 8389 Fincfn 8492 Basecbs 16475 Mat cmat 21012 matRepV cmatrepV 21162 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-ov 7138 df-oprab 7139 df-mpo 7140 df-1st 7671 df-2nd 7672 df-slot 16479 df-base 16481 df-mat 21013 df-marepv 21164 |
This theorem is referenced by: marepveval 21173 marepvcl 21174 1marepvmarrepid 21180 cramerimplem2 21289 |
Copyright terms: Public domain | W3C validator |