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‘𝑅) ↑𝑚 𝑁) |
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‘𝑅) ↑𝑚 𝑁) | |
5 | 1, 2, 3, 4 | marepvval 20373 | . . 3 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) → ((𝑀𝑄𝐶)‘𝐾) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐾, (𝐶‘𝑖), (𝑖𝑀𝑗)))) |
6 | 5 | adantr 481 | . 2 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → ((𝑀𝑄𝐶)‘𝐾) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐾, (𝐶‘𝑖), (𝑖𝑀𝑗)))) |
7 | simprl 794 | . . 3 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → 𝐼 ∈ 𝑁) | |
8 | simplrr 801 | . . 3 ⊢ ((((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) ∧ 𝑖 = 𝐼) → 𝐽 ∈ 𝑁) | |
9 | fvexd 6203 | . . . . 5 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐶‘𝑖) ∈ V) | |
10 | ovexd 6680 | . . . . 5 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝑖𝑀𝑗) ∈ V) | |
11 | 9, 10 | ifcld 4131 | . . . 4 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → if(𝑗 = 𝐾, (𝐶‘𝑖), (𝑖𝑀𝑗)) ∈ V) |
12 | 11 | adantr 481 | . . 3 ⊢ ((((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) ∧ (𝑖 = 𝐼 ∧ 𝑗 = 𝐽)) → if(𝑗 = 𝐾, (𝐶‘𝑖), (𝑖𝑀𝑗)) ∈ V) |
13 | eqeq1 2626 | . . . . . 6 ⊢ (𝑗 = 𝐽 → (𝑗 = 𝐾 ↔ 𝐽 = 𝐾)) | |
14 | 13 | adantl 482 | . . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑗 = 𝐽) → (𝑗 = 𝐾 ↔ 𝐽 = 𝐾)) |
15 | fveq2 6191 | . . . . . 6 ⊢ (𝑖 = 𝐼 → (𝐶‘𝑖) = (𝐶‘𝐼)) | |
16 | 15 | adantr 481 | . . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑗 = 𝐽) → (𝐶‘𝑖) = (𝐶‘𝐼)) |
17 | oveq12 6659 | . . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑗 = 𝐽) → (𝑖𝑀𝑗) = (𝐼𝑀𝐽)) | |
18 | 14, 16, 17 | ifbieq12d 4113 | . . . 4 ⊢ ((𝑖 = 𝐼 ∧ 𝑗 = 𝐽) → if(𝑗 = 𝐾, (𝐶‘𝑖), (𝑖𝑀𝑗)) = if(𝐽 = 𝐾, (𝐶‘𝐼), (𝐼𝑀𝐽))) |
19 | 18 | adantl 482 | . . 3 ⊢ ((((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) ∧ (𝑖 = 𝐼 ∧ 𝑗 = 𝐽)) → if(𝑗 = 𝐾, (𝐶‘𝑖), (𝑖𝑀𝑗)) = if(𝐽 = 𝐾, (𝐶‘𝐼), (𝐼𝑀𝐽))) |
20 | 7, 8, 12, 19 | ovmpt2dv2 6794 | . 2 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (((𝑀𝑄𝐶)‘𝐾) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐾, (𝐶‘𝑖), (𝑖𝑀𝑗))) → (𝐼((𝑀𝑄𝐶)‘𝐾)𝐽) = if(𝐽 = 𝐾, (𝐶‘𝐼), (𝐼𝑀𝐽)))) |
21 | 6, 20 | mpd 15 | 1 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ 𝐾 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐼((𝑀𝑄𝐶)‘𝐾)𝐽) = if(𝐽 = 𝐾, (𝐶‘𝐼), (𝐼𝑀𝐽))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 Vcvv 3200 ifcif 4086 ‘cfv 5888 (class class class)co 6650 ↦ cmpt2 6652 ↑𝑚 cmap 7857 Basecbs 15857 Mat cmat 20213 matRepV cmatrepV 20363 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-1st 7168 df-2nd 7169 df-slot 15861 df-base 15863 df-mat 20214 df-marepv 20365 |
This theorem is referenced by: ma1repveval 20377 1marepvsma1 20389 |
Copyright terms: Public domain | W3C validator |