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

Theorem mat2pmatfval 22930
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 22914 . . . 4 matToPolyMat = (𝑛 ∈ Fin, 𝑟 ∈ V ↦ (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ↦ (𝑥𝑛, 𝑦𝑛 ↦ ((algSc‘(Poly1𝑟))‘(𝑥𝑚𝑦)))))
32a1i 11 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → matToPolyMat = (𝑛 ∈ Fin, 𝑟 ∈ V ↦ (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ↦ (𝑥𝑛, 𝑦𝑛 ↦ ((algSc‘(Poly1𝑟))‘(𝑥𝑚𝑦))))))
4 oveq12 7428 . . . . . . 7 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑛 Mat 𝑟) = (𝑁 Mat 𝑅))
54fveq2d 6889 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = (Base‘(𝑁 Mat 𝑅)))
6 mat2pmatfval.b . . . . . . 7 𝐵 = (Base‘𝐴)
7 mat2pmatfval.a . . . . . . . 8 𝐴 = (𝑁 Mat 𝑅)
87fveq2i 6888 . . . . . . 7 (Base‘𝐴) = (Base‘(𝑁 Mat 𝑅))
96, 8eqtr2i 2789 . . . . . 6 (Base‘(𝑁 Mat 𝑅)) = 𝐵
105, 9eqtrdi 2816 . . . . 5 ((𝑛 = 𝑁𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = 𝐵)
11 simpl 488 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → 𝑛 = 𝑁)
12 2fveq3 6890 . . . . . . . . 9 (𝑟 = 𝑅 → (algSc‘(Poly1𝑟)) = (algSc‘(Poly1𝑅)))
1312adantl 487 . . . . . . . 8 ((𝑛 = 𝑁𝑟 = 𝑅) → (algSc‘(Poly1𝑟)) = (algSc‘(Poly1𝑅)))
14 mat2pmatfval.s . . . . . . . . 9 𝑆 = (algSc‘𝑃)
15 mat2pmatfval.p . . . . . . . . . 10 𝑃 = (Poly1𝑅)
1615fveq2i 6888 . . . . . . . . 9 (algSc‘𝑃) = (algSc‘(Poly1𝑅))
1714, 16eqtr2i 2789 . . . . . . . 8 (algSc‘(Poly1𝑅)) = 𝑆
1813, 17eqtrdi 2816 . . . . . . 7 ((𝑛 = 𝑁𝑟 = 𝑅) → (algSc‘(Poly1𝑟)) = 𝑆)
1918fveq1d 6887 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → ((algSc‘(Poly1𝑟))‘(𝑥𝑚𝑦)) = (𝑆‘(𝑥𝑚𝑦)))
2011, 11, 19mpoeq123dv 7494 . . . . 5 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑥𝑛, 𝑦𝑛 ↦ ((algSc‘(Poly1𝑟))‘(𝑥𝑚𝑦))) = (𝑥𝑁, 𝑦𝑁 ↦ (𝑆‘(𝑥𝑚𝑦))))
2110, 20mpteq12dv 5200 . . . 4 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ↦ (𝑥𝑛, 𝑦𝑛 ↦ ((algSc‘(Poly1𝑟))‘(𝑥𝑚𝑦)))) = (𝑚𝐵 ↦ (𝑥𝑁, 𝑦𝑁 ↦ (𝑆‘(𝑥𝑚𝑦)))))
2221adantl 487 . . 3 (((𝑁 ∈ Fin ∧ 𝑅𝑉) ∧ (𝑛 = 𝑁𝑟 = 𝑅)) → (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ↦ (𝑥𝑛, 𝑦𝑛 ↦ ((algSc‘(Poly1𝑟))‘(𝑥𝑚𝑦)))) = (𝑚𝐵 ↦ (𝑥𝑁, 𝑦𝑁 ↦ (𝑆‘(𝑥𝑚𝑦)))))
23 simpl 488 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝑁 ∈ Fin)
24 elex 3478 . . . 4 (𝑅𝑉𝑅 ∈ V)
2524adantl 487 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝑅 ∈ V)
266fvexi 6899 . . . 4 𝐵 ∈ V
27 mptexg 7226 . . . 4 (𝐵 ∈ V → (𝑚𝐵 ↦ (𝑥𝑁, 𝑦𝑁 ↦ (𝑆‘(𝑥𝑚𝑦)))) ∈ V)
2826, 27mp1i 14 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → (𝑚𝐵 ↦ (𝑥𝑁, 𝑦𝑁 ↦ (𝑆‘(𝑥𝑚𝑦)))) ∈ V)
293, 22, 23, 25, 28ovmpod 7571 . 2 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → (𝑁 matToPolyMat 𝑅) = (𝑚𝐵 ↦ (𝑥𝑁, 𝑦𝑁 ↦ (𝑆‘(𝑥𝑚𝑦)))))
301, 29eqtrid 2812 1 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝑇 = (𝑚𝐵 ↦ (𝑥𝑁, 𝑦𝑁 ↦ (𝑆‘(𝑥𝑚𝑦)))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2146  Vcvv 3457  cmpt 5194  cfv 6540  (class class class)co 7419  cmpo 7421  Fincfn 8949  Basecbs 17291  algSccascl 22052  Poly1cpl1 22387   Mat cmat 22614   matToPolyMat cmat2pmat 22911
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pr 5406
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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-mat2pmat 22914
This theorem is used by:  mat2pmatval  22931  mat2pmatf  22935  m2cpmf  22949
  Copyright terms: Public domain W3C validator