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

Theorem mply1topmatval 21447
 Description: A polynomial over matrices transformed into a polynomial matrix. 𝐼 is the inverse function of the transformation 𝑇 of polynomial matrices into polynomials over matrices: (𝑇‘(𝐼‘𝑂)) = 𝑂) (see mp2pm2mp 21454). (Contributed by AV, 6-Oct-2019.)
Hypotheses
Ref Expression
mply1topmat.a 𝐴 = (𝑁 Mat 𝑅)
mply1topmat.q 𝑄 = (Poly1𝐴)
mply1topmat.l 𝐿 = (Base‘𝑄)
mply1topmat.p 𝑃 = (Poly1𝑅)
mply1topmat.m · = ( ·𝑠𝑃)
mply1topmat.e 𝐸 = (.g‘(mulGrp‘𝑃))
mply1topmat.y 𝑌 = (var1𝑅)
mply1topmat.i 𝐼 = (𝑝𝐿 ↦ (𝑖𝑁, 𝑗𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑝)‘𝑘)𝑗) · (𝑘𝐸𝑌))))))
Assertion
Ref Expression
mply1topmatval ((𝑁𝑉𝑂𝐿) → (𝐼𝑂) = (𝑖𝑁, 𝑗𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌))))))
Distinct variable groups:   𝑖,𝑁,𝑗,𝑝   𝐸,𝑝   𝐿,𝑝   𝑃,𝑝   𝑉,𝑝   𝑌,𝑝   𝑖,𝑂,𝑗,𝑘,𝑝   · ,𝑘,𝑝
Allowed substitution hints:   𝐴(𝑖,𝑗,𝑘,𝑝)   𝑃(𝑖,𝑗,𝑘)   𝑄(𝑖,𝑗,𝑘,𝑝)   𝑅(𝑖,𝑗,𝑘,𝑝)   · (𝑖,𝑗)   𝐸(𝑖,𝑗,𝑘)   𝐼(𝑖,𝑗,𝑘,𝑝)   𝐿(𝑖,𝑗,𝑘)   𝑁(𝑘)   𝑉(𝑖,𝑗,𝑘)   𝑌(𝑖,𝑗,𝑘)

Proof of Theorem mply1topmatval
StepHypRef Expression
1 mply1topmat.i . 2 𝐼 = (𝑝𝐿 ↦ (𝑖𝑁, 𝑗𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑝)‘𝑘)𝑗) · (𝑘𝐸𝑌))))))
2 fveq2 6652 . . . . . . . 8 (𝑝 = 𝑂 → (coe1𝑝) = (coe1𝑂))
32fveq1d 6654 . . . . . . 7 (𝑝 = 𝑂 → ((coe1𝑝)‘𝑘) = ((coe1𝑂)‘𝑘))
43oveqd 7159 . . . . . 6 (𝑝 = 𝑂 → (𝑖((coe1𝑝)‘𝑘)𝑗) = (𝑖((coe1𝑂)‘𝑘)𝑗))
54oveq1d 7157 . . . . 5 (𝑝 = 𝑂 → ((𝑖((coe1𝑝)‘𝑘)𝑗) · (𝑘𝐸𝑌)) = ((𝑖((coe1𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌)))
65mpteq2dv 5129 . . . 4 (𝑝 = 𝑂 → (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑝)‘𝑘)𝑗) · (𝑘𝐸𝑌))) = (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌))))
76oveq2d 7158 . . 3 (𝑝 = 𝑂 → (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑝)‘𝑘)𝑗) · (𝑘𝐸𝑌)))) = (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌)))))
87mpoeq3dv 7219 . 2 (𝑝 = 𝑂 → (𝑖𝑁, 𝑗𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑝)‘𝑘)𝑗) · (𝑘𝐸𝑌))))) = (𝑖𝑁, 𝑗𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌))))))
9 simpr 488 . 2 ((𝑁𝑉𝑂𝐿) → 𝑂𝐿)
10 simpl 486 . . 3 ((𝑁𝑉𝑂𝐿) → 𝑁𝑉)
11 mpoexga 7768 . . 3 ((𝑁𝑉𝑁𝑉) → (𝑖𝑁, 𝑗𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌))))) ∈ V)
1210, 11syldan 594 . 2 ((𝑁𝑉𝑂𝐿) → (𝑖𝑁, 𝑗𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌))))) ∈ V)
131, 8, 9, 12fvmptd3 6775 1 ((𝑁𝑉𝑂𝐿) → (𝐼𝑂) = (𝑖𝑁, 𝑗𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌))))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   = wceq 1538   ∈ wcel 2111  Vcvv 3441   ↦ cmpt 5113  ‘cfv 6329  (class class class)co 7142   ∈ cmpo 7144  ℕ0cn0 11900  Basecbs 16492   ·𝑠 cvsca 16578   Σg cgsu 16723  .gcmg 18234  mulGrpcmgp 19250  var1cv1 20843  Poly1cpl1 20844  coe1cco1 20845   Mat cmat 21050 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5157  ax-sep 5170  ax-nul 5177  ax-pow 5234  ax-pr 5298  ax-un 7451 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3722  df-csb 3830  df-dif 3885  df-un 3887  df-in 3889  df-ss 3899  df-nul 4246  df-if 4428  df-pw 4501  df-sn 4528  df-pr 4530  df-op 4534  df-uni 4804  df-iun 4886  df-br 5034  df-opab 5096  df-mpt 5114  df-id 5428  df-xp 5528  df-rel 5529  df-cnv 5530  df-co 5531  df-dm 5532  df-rn 5533  df-res 5534  df-ima 5535  df-iota 6288  df-fun 6331  df-fn 6332  df-f 6333  df-f1 6334  df-fo 6335  df-f1o 6336  df-fv 6337  df-ov 7145  df-oprab 7146  df-mpo 7147  df-1st 7681  df-2nd 7682 This theorem is referenced by:  mply1topmatcl  21448
 Copyright terms: Public domain W3C validator