Theorem marepvval0 22791

Description: Second 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.)

Hypotheses

Ref	Expression
marepvfval.a	⊢ 𝐴 = (𝑁 Mat 𝑅)
marepvfval.b	⊢ 𝐵 = (Base‘𝐴)
marepvfval.q	⊢ 𝑄 = (𝑁 matRepV 𝑅)
marepvfval.v	⊢ 𝑉 = ((Base‘𝑅) ↑m 𝑁)

Assertion

Ref	Expression
marepvval0	⊢ ((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉) → (𝑀𝑄𝐶) = (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝐶‘𝑖), (𝑖𝑀𝑗)))))

Distinct variable groups:   𝑖,𝑁,𝑗,𝑘   𝑅,𝑖,𝑗,𝑘   𝐶,𝑖,𝑗,𝑘   𝑖,𝑀,𝑗,𝑘

Allowed substitution hints:   𝐴(𝑖, 𝑗, 𝑘)   𝐵(𝑖, 𝑗, 𝑘)   𝑄(𝑖, 𝑗, 𝑘)   𝑉(𝑖, 𝑗, 𝑘)

Proof of Theorem marepvval0

Dummy variables 𝑚 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		marepvfval.a	. . . . . 6 ⊢ 𝐴 = (𝑁 Mat 𝑅)
2		marepvfval.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐴)
3	1, 2	matrcl 22637	. . . . 5 ⊢ (𝑀 ∈ 𝐵 → (𝑁 ∈ Fin ∧ 𝑅 ∈ V))
4	3	simpld 500	. . . 4 ⊢ (𝑀 ∈ 𝐵 → 𝑁 ∈ Fin)
5	4	adantr 486	. . 3 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉) → 𝑁 ∈ Fin)
6	5	mptexd 7224	. 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉) → (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝐶‘𝑖), (𝑖𝑀𝑗)))) ∈ V)
7		fveq1 6878	. . . . . . 7 ⊢ (𝑐 = 𝐶 → (𝑐‘𝑖) = (𝐶‘𝑖))
8	7	adantl 487	. . . . . 6 ⊢ ((𝑚 = 𝑀 ∧ 𝑐 = 𝐶) → (𝑐‘𝑖) = (𝐶‘𝑖))
9		oveq 7420	. . . . . . 7 ⊢ (𝑚 = 𝑀 → (𝑖𝑚𝑗) = (𝑖𝑀𝑗))
10	9	adantr 486	. . . . . 6 ⊢ ((𝑚 = 𝑀 ∧ 𝑐 = 𝐶) → (𝑖𝑚𝑗) = (𝑖𝑀𝑗))
11	8, 10	ifeq12d 4504	. . . . 5 ⊢ ((𝑚 = 𝑀 ∧ 𝑐 = 𝐶) → if(𝑗 = 𝑘, (𝑐‘𝑖), (𝑖𝑚𝑗)) = if(𝑗 = 𝑘, (𝐶‘𝑖), (𝑖𝑀𝑗)))
12	11	mpoeq3dv 7493	. . . 4 ⊢ ((𝑚 = 𝑀 ∧ 𝑐 = 𝐶) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑐‘𝑖), (𝑖𝑚𝑗))) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝐶‘𝑖), (𝑖𝑀𝑗))))
13	12	mpteq2dv 5199	. . 3 ⊢ ((𝑚 = 𝑀 ∧ 𝑐 = 𝐶) → (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑐‘𝑖), (𝑖𝑚𝑗)))) = (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝐶‘𝑖), (𝑖𝑀𝑗)))))
14		marepvfval.q	. . . 4 ⊢ 𝑄 = (𝑁 matRepV 𝑅)
15		marepvfval.v	. . . 4 ⊢ 𝑉 = ((Base‘𝑅) ↑m 𝑁)
16	1, 2, 14, 15	marepvfval 22790	. . 3 ⊢ 𝑄 = (𝑚 ∈ 𝐵, 𝑐 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑐‘𝑖), (𝑖𝑚𝑗)))))
17	13, 16	ovmpoga 7568	. 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉 ∧ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝐶‘𝑖), (𝑖𝑀𝑗)))) ∈ V) → (𝑀𝑄𝐶) = (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝐶‘𝑖), (𝑖𝑀𝑗)))))
18	6, 17	mpd3an3 1491	1 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐶 ∈ 𝑉) → (𝑀𝑄𝐶) = (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝐶‘𝑖), (𝑖𝑀𝑗)))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3450  ifcif 4482   ↦ cmpt 5186  ‘cfv 6533  (class class class)co 7414   ∈ cmpo 7416   ↑_m cmap 8829  Fincfn 8955  Basecbs 17304   Mat cmat 22632   matRepV cmatrepV 22782

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737  ax-cnex 11183  ax-1cn 11185  ax-addcl 11187

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-om 7864  df-1st 7987  df-2nd 7988  df-frecs 8281  df-wrecs 8312  df-recs 8361  df-rdg 8400  df-nn 12261  df-slot 17277  df-ndx 17289  df-base 17305  df-mat 22633  df-marepv 22784

This theorem is used by:  marepvval  22792