Theorem marepvfval 22587

Description: First 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.) (Proof shortened by AV, 2-Mar-2024.)

Hypotheses

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

Assertion

Ref	Expression
marepvfval	⊢ 𝑄 = (𝑚 ∈ 𝐵, 𝑣 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗)))))

Distinct variable groups:   𝐵,𝑚,𝑣   𝑖,𝑁,𝑗,𝑘,𝑚,𝑣   𝑅,𝑖,𝑗,𝑘,𝑚,𝑣   𝑚,𝑉,𝑣

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

Proof of Theorem marepvfval

Dummy variables 𝑛 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		marepvfval.q	. 2 ⊢ 𝑄 = (𝑁 matRepV 𝑅)
2		marepvfval.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐴)
3	2	fvexi 6921	. . . . 5 ⊢ 𝐵 ∈ V
4		marepvfval.v	. . . . . . 7 ⊢ 𝑉 = ((Base‘𝑅) ↑m 𝑁)
5	4	ovexi 7465	. . . . . 6 ⊢ 𝑉 ∈ V
6	5	a1i 11	. . . . 5 ⊢ ((𝑁 ∈ V ∧ 𝑅 ∈ V) → 𝑉 ∈ V)
7		mpoexga 8101	. . . . 5 ⊢ ((𝐵 ∈ V ∧ 𝑉 ∈ V) → (𝑚 ∈ 𝐵, 𝑣 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))) ∈ V)
8	3, 6, 7	sylancr 587	. . . 4 ⊢ ((𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑚 ∈ 𝐵, 𝑣 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))) ∈ V)
9		oveq12 7440	. . . . . . . . 9 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 Mat 𝑟) = (𝑁 Mat 𝑅))
10		marepvfval.a	. . . . . . . . 9 ⊢ 𝐴 = (𝑁 Mat 𝑅)
11	9, 10	eqtr4di 2793	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 Mat 𝑟) = 𝐴)
12	11	fveq2d 6911	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = (Base‘𝐴))
13	12, 2	eqtr4di 2793	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = 𝐵)
14		fveq2 6907	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
15	14	adantl 481	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘𝑟) = (Base‘𝑅))
16		simpl 482	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → 𝑛 = 𝑁)
17	15, 16	oveq12d 7449	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → ((Base‘𝑟) ↑m 𝑛) = ((Base‘𝑅) ↑m 𝑁))
18	17, 4	eqtr4di 2793	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → ((Base‘𝑟) ↑m 𝑛) = 𝑉)
19		eqidd 2736	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗)) = if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗)))
20	16, 16, 19	mpoeq123dv 7508	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑖 ∈ 𝑛, 𝑗 ∈ 𝑛 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))
21	16, 20	mpteq12dv 5239	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑘 ∈ 𝑛 ↦ (𝑖 ∈ 𝑛, 𝑗 ∈ 𝑛 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗)))) = (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗)))))
22	13, 18, 21	mpoeq123dv 7508	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)), 𝑣 ∈ ((Base‘𝑟) ↑m 𝑛) ↦ (𝑘 ∈ 𝑛 ↦ (𝑖 ∈ 𝑛, 𝑗 ∈ 𝑛 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))) = (𝑚 ∈ 𝐵, 𝑣 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))))
23		df-marepv 22581	. . . . 5 ⊢ matRepV = (𝑛 ∈ V, 𝑟 ∈ V ↦ (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)), 𝑣 ∈ ((Base‘𝑟) ↑m 𝑛) ↦ (𝑘 ∈ 𝑛 ↦ (𝑖 ∈ 𝑛, 𝑗 ∈ 𝑛 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))))
24	22, 23	ovmpoga 7587	. . . 4 ⊢ ((𝑁 ∈ V ∧ 𝑅 ∈ V ∧ (𝑚 ∈ 𝐵, 𝑣 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))) ∈ V) → (𝑁 matRepV 𝑅) = (𝑚 ∈ 𝐵, 𝑣 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))))
25	8, 24	mpd3an3 1461	. . 3 ⊢ ((𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 matRepV 𝑅) = (𝑚 ∈ 𝐵, 𝑣 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))))
26	23	mpondm0 7673	. . . 4 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 matRepV 𝑅) = ∅)
27	10	fveq2i 6910	. . . . . . . 8 ⊢ (Base‘𝐴) = (Base‘(𝑁 Mat 𝑅))
28	2, 27	eqtri 2763	. . . . . . 7 ⊢ 𝐵 = (Base‘(𝑁 Mat 𝑅))
29		matbas0pc 22429	. . . . . . 7 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (Base‘(𝑁 Mat 𝑅)) = ∅)
30	28, 29	eqtrid 2787	. . . . . 6 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → 𝐵 = ∅)
31	30	orcd 873	. . . . 5 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝐵 = ∅ ∨ 𝑉 = ∅))
32		0mpo0 7516	. . . . 5 ⊢ ((𝐵 = ∅ ∨ 𝑉 = ∅) → (𝑚 ∈ 𝐵, 𝑣 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))) = ∅)
33	31, 32	syl 17	. . . 4 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑚 ∈ 𝐵, 𝑣 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))) = ∅)
34	26, 33	eqtr4d 2778	. . 3 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 matRepV 𝑅) = (𝑚 ∈ 𝐵, 𝑣 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))))
35	25, 34	pm2.61i 182	. 2 ⊢ (𝑁 matRepV 𝑅) = (𝑚 ∈ 𝐵, 𝑣 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗)))))
36	1, 35	eqtri 2763	1 ⊢ 𝑄 = (𝑚 ∈ 𝐵, 𝑣 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗)))))

Syntax hints:  ¬ wn 3   ∧ wa 395   ∨ wo 847   = wceq 1537   ∈ wcel 2106  Vcvv 3478  ∅c0 4339  ifcif 4531   ↦ cmpt 5231  ‘cfv 6563  (class class class)co 7431   ∈ cmpo 7433   ↑_m cmap 8865  Basecbs 17245   Mat cmat 22427   matRepV cmatrepV 22579

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 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754  ax-cnex 11209  ax-1cn 11211  ax-addcl 11213

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8013  df-2nd 8014  df-frecs 8305  df-wrecs 8336  df-recs 8410  df-rdg 8449  df-nn 12265  df-slot 17216  df-ndx 17228  df-base 17246  df-mat 22428  df-marepv 22581

This theorem is referenced by:  marepvval0  22588