Theorem marepvfval 22572

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 6919	. . . . 5 ⊢ 𝐵 ∈ V
4		marepvfval.v	. . . . . . 7 ⊢ 𝑉 = ((Base‘𝑅) ↑m 𝑁)
5	4	ovexi 7466	. . . . . 6 ⊢ 𝑉 ∈ V
6	5	a1i 11	. . . . 5 ⊢ ((𝑁 ∈ V ∧ 𝑅 ∈ V) → 𝑉 ∈ V)
7		mpoexga 8103	. . . . 5 ⊢ ((𝐵 ∈ V ∧ 𝑉 ∈ V) → (𝑚 ∈ 𝐵, 𝑣 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))) ∈ V)
8	3, 6, 7	sylancr 587	. . . 4 ⊢ ((𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑚 ∈ 𝐵, 𝑣 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))) ∈ V)
9		oveq12 7441	. . . . . . . . 9 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 Mat 𝑟) = (𝑁 Mat 𝑅))
10		marepvfval.a	. . . . . . . . 9 ⊢ 𝐴 = (𝑁 Mat 𝑅)
11	9, 10	eqtr4di 2794	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 Mat 𝑟) = 𝐴)
12	11	fveq2d 6909	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = (Base‘𝐴))
13	12, 2	eqtr4di 2794	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = 𝐵)
14		fveq2 6905	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
15	14	adantl 481	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘𝑟) = (Base‘𝑅))
16		simpl 482	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → 𝑛 = 𝑁)
17	15, 16	oveq12d 7450	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → ((Base‘𝑟) ↑m 𝑛) = ((Base‘𝑅) ↑m 𝑁))
18	17, 4	eqtr4di 2794	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → ((Base‘𝑟) ↑m 𝑛) = 𝑉)
19		eqidd 2737	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗)) = if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗)))
20	16, 16, 19	mpoeq123dv 7509	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑖 ∈ 𝑛, 𝑗 ∈ 𝑛 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))
21	16, 20	mpteq12dv 5232	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑘 ∈ 𝑛 ↦ (𝑖 ∈ 𝑛, 𝑗 ∈ 𝑛 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗)))) = (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗)))))
22	13, 18, 21	mpoeq123dv 7509	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)), 𝑣 ∈ ((Base‘𝑟) ↑m 𝑛) ↦ (𝑘 ∈ 𝑛 ↦ (𝑖 ∈ 𝑛, 𝑗 ∈ 𝑛 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))) = (𝑚 ∈ 𝐵, 𝑣 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))))
23		df-marepv 22566	. . . . 5 ⊢ matRepV = (𝑛 ∈ V, 𝑟 ∈ V ↦ (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)), 𝑣 ∈ ((Base‘𝑟) ↑m 𝑛) ↦ (𝑘 ∈ 𝑛 ↦ (𝑖 ∈ 𝑛, 𝑗 ∈ 𝑛 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))))
24	22, 23	ovmpoga 7588	. . . 4 ⊢ ((𝑁 ∈ V ∧ 𝑅 ∈ V ∧ (𝑚 ∈ 𝐵, 𝑣 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))) ∈ V) → (𝑁 matRepV 𝑅) = (𝑚 ∈ 𝐵, 𝑣 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))))
25	8, 24	mpd3an3 1463	. . 3 ⊢ ((𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 matRepV 𝑅) = (𝑚 ∈ 𝐵, 𝑣 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))))
26	23	mpondm0 7674	. . . 4 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 matRepV 𝑅) = ∅)
27	10	fveq2i 6908	. . . . . . . 8 ⊢ (Base‘𝐴) = (Base‘(𝑁 Mat 𝑅))
28	2, 27	eqtri 2764	. . . . . . 7 ⊢ 𝐵 = (Base‘(𝑁 Mat 𝑅))
29		matbas0pc 22414	. . . . . . 7 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (Base‘(𝑁 Mat 𝑅)) = ∅)
30	28, 29	eqtrid 2788	. . . . . 6 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → 𝐵 = ∅)
31	30	orcd 873	. . . . 5 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝐵 = ∅ ∨ 𝑉 = ∅))
32		0mpo0 7517	. . . . 5 ⊢ ((𝐵 = ∅ ∨ 𝑉 = ∅) → (𝑚 ∈ 𝐵, 𝑣 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))) = ∅)
33	31, 32	syl 17	. . . 4 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑚 ∈ 𝐵, 𝑣 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))) = ∅)
34	26, 33	eqtr4d 2779	. . 3 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 matRepV 𝑅) = (𝑚 ∈ 𝐵, 𝑣 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗))))))
35	25, 34	pm2.61i 182	. 2 ⊢ (𝑁 matRepV 𝑅) = (𝑚 ∈ 𝐵, 𝑣 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗)))))
36	1, 35	eqtri 2764	1 ⊢ 𝑄 = (𝑚 ∈ 𝐵, 𝑣 ∈ 𝑉 ↦ (𝑘 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝑘, (𝑣‘𝑖), (𝑖𝑚𝑗)))))

Syntax hints:  ¬ wn 3   ∧ wa 395   ∨ wo 847   = wceq 1539   ∈ wcel 2107  Vcvv 3479  ∅c0 4332  ifcif 4524   ↦ cmpt 5224  ‘cfv 6560  (class class class)co 7432   ∈ cmpo 7434   ↑_m cmap 8867  Basecbs 17248   Mat cmat 22412   matRepV cmatrepV 22564

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-rep 5278  ax-sep 5295  ax-nul 5305  ax-pow 5364  ax-pr 5431  ax-un 7756  ax-cnex 11212  ax-1cn 11214  ax-addcl 11216

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3380  df-rab 3436  df-v 3481  df-sbc 3788  df-csb 3899  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-pss 3970  df-nul 4333  df-if 4525  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-iun 4992  df-br 5143  df-opab 5205  df-mpt 5225  df-tr 5259  df-id 5577  df-eprel 5583  df-po 5591  df-so 5592  df-fr 5636  df-we 5638  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-res 5696  df-ima 5697  df-pred 6320  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-iota 6513  df-fun 6562  df-fn 6563  df-f 6564  df-f1 6565  df-fo 6566  df-f1o 6567  df-fv 6568  df-ov 7435  df-oprab 7436  df-mpo 7437  df-om 7889  df-1st 8015  df-2nd 8016  df-frecs 8307  df-wrecs 8338  df-recs 8412  df-rdg 8451  df-nn 12268  df-slot 17220  df-ndx 17232  df-base 17249  df-mat 22413  df-marepv 22566

This theorem is referenced by:  marepvval0  22573