Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > marepveval | Structured version Visualization version GIF version |
Description: An entry of a matrix with a replaced column. (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 |
---|---|
marepveval | ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐼((𝑀𝑄𝐶)‘𝐾)𝐽) = if(𝐽 = 𝐾, (𝐶‘𝐼), (𝐼𝑀𝐽))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | marepvfval.a | . . . 4 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
2 | marepvfval.b | . . . 4 ⊢ 𝐵 = (Base‘𝐴) | |
3 | marepvfval.q | . . . 4 ⊢ 𝑄 = (𝑁 matRepV 𝑅) | |
4 | marepvfval.v | . . . 4 ⊢ 𝑉 = ((Base‘𝑅) ↑m 𝑁) | |
5 | 1, 2, 3, 4 | marepvval 21176 | . . 3 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) → ((𝑀𝑄𝐶)‘𝐾) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐾, (𝐶‘𝑖), (𝑖𝑀𝑗)))) |
6 | 5 | adantr 483 | . 2 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → ((𝑀𝑄𝐶)‘𝐾) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐾, (𝐶‘𝑖), (𝑖𝑀𝑗)))) |
7 | simprl 769 | . . 3 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → 𝐼 ∈ 𝑁) | |
8 | simplrr 776 | . . 3 ⊢ ((((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) ∧ 𝑖 = 𝐼) → 𝐽 ∈ 𝑁) | |
9 | fvexd 6685 | . . . . 5 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐶‘𝑖) ∈ V) | |
10 | ovexd 7191 | . . . . 5 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝑖𝑀𝑗) ∈ V) | |
11 | 9, 10 | ifcld 4512 | . . . 4 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → if(𝑗 = 𝐾, (𝐶‘𝑖), (𝑖𝑀𝑗)) ∈ V) |
12 | 11 | adantr 483 | . . 3 ⊢ ((((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) ∧ (𝑖 = 𝐼 ∧ 𝑗 = 𝐽)) → if(𝑗 = 𝐾, (𝐶‘𝑖), (𝑖𝑀𝑗)) ∈ V) |
13 | eqeq1 2825 | . . . . . 6 ⊢ (𝑗 = 𝐽 → (𝑗 = 𝐾 ↔ 𝐽 = 𝐾)) | |
14 | 13 | adantl 484 | . . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑗 = 𝐽) → (𝑗 = 𝐾 ↔ 𝐽 = 𝐾)) |
15 | fveq2 6670 | . . . . . 6 ⊢ (𝑖 = 𝐼 → (𝐶‘𝑖) = (𝐶‘𝐼)) | |
16 | 15 | adantr 483 | . . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑗 = 𝐽) → (𝐶‘𝑖) = (𝐶‘𝐼)) |
17 | oveq12 7165 | . . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑗 = 𝐽) → (𝑖𝑀𝑗) = (𝐼𝑀𝐽)) | |
18 | 14, 16, 17 | ifbieq12d 4494 | . . . 4 ⊢ ((𝑖 = 𝐼 ∧ 𝑗 = 𝐽) → if(𝑗 = 𝐾, (𝐶‘𝑖), (𝑖𝑀𝑗)) = if(𝐽 = 𝐾, (𝐶‘𝐼), (𝐼𝑀𝐽))) |
19 | 18 | adantl 484 | . . 3 ⊢ ((((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) ∧ (𝑖 = 𝐼 ∧ 𝑗 = 𝐽)) → if(𝑗 = 𝐾, (𝐶‘𝑖), (𝑖𝑀𝑗)) = if(𝐽 = 𝐾, (𝐶‘𝐼), (𝐼𝑀𝐽))) |
20 | 7, 8, 12, 19 | ovmpodv2 7308 | . 2 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (((𝑀𝑄𝐶)‘𝐾) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐾, (𝐶‘𝑖), (𝑖𝑀𝑗))) → (𝐼((𝑀𝑄𝐶)‘𝐾)𝐽) = if(𝐽 = 𝐾, (𝐶‘𝐼), (𝐼𝑀𝐽)))) |
21 | 6, 20 | mpd 15 | 1 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐼((𝑀𝑄𝐶)‘𝐾)𝐽) = if(𝐽 = 𝐾, (𝐶‘𝐼), (𝐼𝑀𝐽))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 Vcvv 3494 ifcif 4467 ‘cfv 6355 (class class class)co 7156 ∈ cmpo 7158 ↑m cmap 8406 Basecbs 16483 Mat cmat 21016 matRepV cmatrepV 21166 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 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 3496 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 4568 df-pr 4570 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-ov 7159 df-oprab 7160 df-mpo 7161 df-1st 7689 df-2nd 7690 df-slot 16487 df-base 16489 df-mat 21017 df-marepv 21168 |
This theorem is referenced by: ma1repveval 21180 1marepvsma1 21192 |
Copyright terms: Public domain | W3C validator |