Theorem matval 22355

Description: Value of the matrix algebra. (Contributed by Stefan O'Rear, 4-Sep-2015.)

Hypotheses

Ref	Expression
matval.a	⊢ 𝐴 = (𝑁 Mat 𝑅)
matval.g	⊢ 𝐺 = (𝑅 freeLMod (𝑁 × 𝑁))
matval.t	⊢ · = (𝑅 maMul ⟨𝑁, 𝑁, 𝑁⟩)

Assertion

Ref	Expression
matval	⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → 𝐴 = (𝐺 sSet ⟨(.r‘ndx), · ⟩))

Proof of Theorem matval

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

Step	Hyp	Ref	Expression
1		matval.a	. 2 ⊢ 𝐴 = (𝑁 Mat 𝑅)
2		elex 3461	. . 3 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V)
3		id 22	. . . . . . 7 ⊢ (𝑟 = 𝑅 → 𝑟 = 𝑅)
4		id 22	. . . . . . . 8 ⊢ (𝑛 = 𝑁 → 𝑛 = 𝑁)
5	4	sqxpeqd 5656	. . . . . . 7 ⊢ (𝑛 = 𝑁 → (𝑛 × 𝑛) = (𝑁 × 𝑁))
6	3, 5	oveqan12rd 7378	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑟 freeLMod (𝑛 × 𝑛)) = (𝑅 freeLMod (𝑁 × 𝑁)))
7		matval.g	. . . . . 6 ⊢ 𝐺 = (𝑅 freeLMod (𝑁 × 𝑁))
8	6, 7	eqtr4di 2789	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑟 freeLMod (𝑛 × 𝑛)) = 𝐺)
9	4, 4, 4	oteq123d 4844	. . . . . . . 8 ⊢ (𝑛 = 𝑁 → ⟨𝑛, 𝑛, 𝑛⟩ = ⟨𝑁, 𝑁, 𝑁⟩)
10	3, 9	oveqan12rd 7378	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑟 maMul ⟨𝑛, 𝑛, 𝑛⟩) = (𝑅 maMul ⟨𝑁, 𝑁, 𝑁⟩))
11		matval.t	. . . . . . 7 ⊢ · = (𝑅 maMul ⟨𝑁, 𝑁, 𝑁⟩)
12	10, 11	eqtr4di 2789	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑟 maMul ⟨𝑛, 𝑛, 𝑛⟩) = · )
13	12	opeq2d 4836	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → ⟨(.r‘ndx), (𝑟 maMul ⟨𝑛, 𝑛, 𝑛⟩)⟩ = ⟨(.r‘ndx), · ⟩)
14	8, 13	oveq12d 7376	. . . 4 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → ((𝑟 freeLMod (𝑛 × 𝑛)) sSet ⟨(.r‘ndx), (𝑟 maMul ⟨𝑛, 𝑛, 𝑛⟩)⟩) = (𝐺 sSet ⟨(.r‘ndx), · ⟩))
15		df-mat 22352	. . . 4 ⊢ Mat = (𝑛 ∈ Fin, 𝑟 ∈ V ↦ ((𝑟 freeLMod (𝑛 × 𝑛)) sSet ⟨(.r‘ndx), (𝑟 maMul ⟨𝑛, 𝑛, 𝑛⟩)⟩))
16		ovex 7391	. . . 4 ⊢ (𝐺 sSet ⟨(.r‘ndx), · ⟩) ∈ V
17	14, 15, 16	ovmpoa 7513	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ V) → (𝑁 Mat 𝑅) = (𝐺 sSet ⟨(.r‘ndx), · ⟩))
18	2, 17	sylan2 593	. 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → (𝑁 Mat 𝑅) = (𝐺 sSet ⟨(.r‘ndx), · ⟩))
19	1, 18	eqtrid 2783	1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → 𝐴 = (𝐺 sSet ⟨(.r‘ndx), · ⟩))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1541   ∈ wcel 2113  Vcvv 3440  ⟨cop 4586  ⟨cotp 4588   × cxp 5622  ‘cfv 6492  (class class class)co 7358  Fincfn 8883   sSet csts 17090  ndxcnx 17120  ._rcmulr 17178   freeLMod cfrlm 21701   maMul cmmul 22334   Mat cmat 22351

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 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-sbc 3741  df-dif 3904  df-un 3906  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-ot 4589  df-uni 4864  df-br 5099  df-opab 5161  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-iota 6448  df-fun 6494  df-fv 6500  df-ov 7361  df-oprab 7362  df-mpo 7363  df-mat 22352

This theorem is referenced by:  matbas  22357  matplusg  22358  matsca  22359  matvsca  22360  matmulr  22382