MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mat2pmatfval Structured version   Visualization version   GIF version

Theorem mat2pmatfval 22949
Description: Value of the matrix transformation. (Contributed by AV, 31-Jul-2019.)
Hypotheses
Ref Expression
mat2pmatfval.t 𝑇 = (𝑁 matToPolyMat 𝑅)
mat2pmatfval.a 𝐴 = (𝑁 Mat 𝑅)
mat2pmatfval.b 𝐵 = (Base‘𝐴)
mat2pmatfval.p 𝑃 = (Poly1𝑅)
mat2pmatfval.s 𝑆 = (algSc‘𝑃)
Assertion
Ref Expression
mat2pmatfval ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝑇 = (𝑚𝐵 ↦ (𝑥𝑁, 𝑦𝑁 ↦ (𝑆‘(𝑥𝑚𝑦)))))
Distinct variable groups:   𝐵,𝑚   𝑥,𝑚,𝑦,𝑁   𝑅,𝑚,𝑥,𝑦
Allowed substitution hints:   𝐴(𝑥, 𝑦, 𝑚)   𝐵(𝑥, 𝑦)   𝑃(𝑥, 𝑦, 𝑚)   𝑆(𝑥, 𝑦, 𝑚)   𝑇(𝑥, 𝑦, 𝑚)   𝑉(𝑥, 𝑦, 𝑚)

Proof of Theorem mat2pmatfval
Dummy variables 𝑛 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mat2pmatfval.t . 2 𝑇 = (𝑁 matToPolyMat 𝑅)
2 df-mat2pmat 22933 . . . 4 matToPolyMat = (𝑛 ∈ Fin, 𝑟 ∈ V ↦ (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ↦ (𝑥𝑛, 𝑦𝑛 ↦ ((algSc‘(Poly1𝑟))‘(𝑥𝑚𝑦)))))
32a1i 11 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → matToPolyMat = (𝑛 ∈ Fin, 𝑟 ∈ V ↦ (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ↦ (𝑥𝑛, 𝑦𝑛 ↦ ((algSc‘(Poly1𝑟))‘(𝑥𝑚𝑦))))))
4 oveq12 7423 . . . . . . 7 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑛 Mat 𝑟) = (𝑁 Mat 𝑅))
54fveq2d 6883 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = (Base‘(𝑁 Mat 𝑅)))
6 mat2pmatfval.b . . . . . . 7 𝐵 = (Base‘𝐴)
7 mat2pmatfval.a . . . . . . . 8 𝐴 = (𝑁 Mat 𝑅)
87fveq2i 6882 . . . . . . 7 (Base‘𝐴) = (Base‘(𝑁 Mat 𝑅))
96, 8eqtr2i 2784 . . . . . 6 (Base‘(𝑁 Mat 𝑅)) = 𝐵
105, 9eqtrdi 2811 . . . . 5 ((𝑛 = 𝑁𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = 𝐵)
11 simpl 488 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → 𝑛 = 𝑁)
12 2fveq3 6884 . . . . . . . . 9 (𝑟 = 𝑅 → (algSc‘(Poly1𝑟)) = (algSc‘(Poly1𝑅)))
1312adantl 487 . . . . . . . 8 ((𝑛 = 𝑁𝑟 = 𝑅) → (algSc‘(Poly1𝑟)) = (algSc‘(Poly1𝑅)))
14 mat2pmatfval.s . . . . . . . . 9 𝑆 = (algSc‘𝑃)
15 mat2pmatfval.p . . . . . . . . . 10 𝑃 = (Poly1𝑅)
1615fveq2i 6882 . . . . . . . . 9 (algSc‘𝑃) = (algSc‘(Poly1𝑅))
1714, 16eqtr2i 2784 . . . . . . . 8 (algSc‘(Poly1𝑅)) = 𝑆
1813, 17eqtrdi 2811 . . . . . . 7 ((𝑛 = 𝑁𝑟 = 𝑅) → (algSc‘(Poly1𝑟)) = 𝑆)
1918fveq1d 6881 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → ((algSc‘(Poly1𝑟))‘(𝑥𝑚𝑦)) = (𝑆‘(𝑥𝑚𝑦)))
2011, 11, 19mpoeq123dv 7489 . . . . 5 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑥𝑛, 𝑦𝑛 ↦ ((algSc‘(Poly1𝑟))‘(𝑥𝑚𝑦))) = (𝑥𝑁, 𝑦𝑁 ↦ (𝑆‘(𝑥𝑚𝑦))))
2110, 20mpteq12dv 5192 . . . 4 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ↦ (𝑥𝑛, 𝑦𝑛 ↦ ((algSc‘(Poly1𝑟))‘(𝑥𝑚𝑦)))) = (𝑚𝐵 ↦ (𝑥𝑁, 𝑦𝑁 ↦ (𝑆‘(𝑥𝑚𝑦)))))
2221adantl 487 . . 3 (((𝑁 ∈ Fin ∧ 𝑅𝑉) ∧ (𝑛 = 𝑁𝑟 = 𝑅)) → (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ↦ (𝑥𝑛, 𝑦𝑛 ↦ ((algSc‘(Poly1𝑟))‘(𝑥𝑚𝑦)))) = (𝑚𝐵 ↦ (𝑥𝑁, 𝑦𝑁 ↦ (𝑆‘(𝑥𝑚𝑦)))))
23 simpl 488 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝑁 ∈ Fin)
24 elex 3471 . . . 4 (𝑅𝑉𝑅 ∈ V)
2524adantl 487 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝑅 ∈ V)
266fvexi 6893 . . . 4 𝐵 ∈ V
27 mptexg 7221 . . . 4 (𝐵 ∈ V → (𝑚𝐵 ↦ (𝑥𝑁, 𝑦𝑁 ↦ (𝑆‘(𝑥𝑚𝑦)))) ∈ V)
2826, 27mp1i 14 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → (𝑚𝐵 ↦ (𝑥𝑁, 𝑦𝑁 ↦ (𝑆‘(𝑥𝑚𝑦)))) ∈ V)
293, 22, 23, 25, 28ovmpod 7566 . 2 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → (𝑁 matToPolyMat 𝑅) = (𝑚𝐵 ↦ (𝑥𝑁, 𝑦𝑁 ↦ (𝑆‘(𝑥𝑚𝑦)))))
301, 29eqtrid 2807 1 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝑇 = (𝑚𝐵 ↦ (𝑥𝑁, 𝑦𝑁 ↦ (𝑆‘(𝑥𝑚𝑦)))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  Vcvv 3450  cmpt 5186  cfv 6533  (class class class)co 7414  cmpo 7416  Fincfn 8953  Basecbs 17302  algSccascl 22068  Poly1cpl1 22403   Mat cmat 22630   matToPolyMat cmat2pmat 22930
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-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-nul 4280  df-if 4483  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-id 5550  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-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-mat2pmat 22933
This theorem is used by:  mat2pmatval  22950  mat2pmatf  22954  m2cpmf  22968
  Copyright terms: Public domain W3C validator