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

Theorem mply1topmatval 22826
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 22833). (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 6907 . . . . . . . 8 (𝑝 = 𝑂 → (coe1𝑝) = (coe1𝑂))
32fveq1d 6909 . . . . . . 7 (𝑝 = 𝑂 → ((coe1𝑝)‘𝑘) = ((coe1𝑂)‘𝑘))
43oveqd 7448 . . . . . 6 (𝑝 = 𝑂 → (𝑖((coe1𝑝)‘𝑘)𝑗) = (𝑖((coe1𝑂)‘𝑘)𝑗))
54oveq1d 7446 . . . . 5 (𝑝 = 𝑂 → ((𝑖((coe1𝑝)‘𝑘)𝑗) · (𝑘𝐸𝑌)) = ((𝑖((coe1𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌)))
65mpteq2dv 5250 . . . 4 (𝑝 = 𝑂 → (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑝)‘𝑘)𝑗) · (𝑘𝐸𝑌))) = (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌))))
76oveq2d 7447 . . 3 (𝑝 = 𝑂 → (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑝)‘𝑘)𝑗) · (𝑘𝐸𝑌)))) = (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌)))))
87mpoeq3dv 7512 . 2 (𝑝 = 𝑂 → (𝑖𝑁, 𝑗𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑝)‘𝑘)𝑗) · (𝑘𝐸𝑌))))) = (𝑖𝑁, 𝑗𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌))))))
9 simpr 484 . 2 ((𝑁𝑉𝑂𝐿) → 𝑂𝐿)
10 simpl 482 . . 3 ((𝑁𝑉𝑂𝐿) → 𝑁𝑉)
11 mpoexga 8101 . . 3 ((𝑁𝑉𝑁𝑉) → (𝑖𝑁, 𝑗𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌))))) ∈ V)
1210, 11syldan 591 . 2 ((𝑁𝑉𝑂𝐿) → (𝑖𝑁, 𝑗𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌))))) ∈ V)
131, 8, 9, 12fvmptd3 7039 1 ((𝑁𝑉𝑂𝐿) → (𝐼𝑂) = (𝑖𝑁, 𝑗𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌))))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1537  wcel 2106  Vcvv 3478  cmpt 5231  cfv 6563  (class class class)co 7431  cmpo 7433  0cn0 12524  Basecbs 17245   ·𝑠 cvsca 17302   Σg cgsu 17487  .gcmg 19098  mulGrpcmgp 20152  var1cv1 22193  Poly1cpl1 22194  coe1cco1 22195   Mat cmat 22427
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-ov 7434  df-oprab 7435  df-mpo 7436  df-1st 8013  df-2nd 8014
This theorem is referenced by:  mply1topmatcl  22827
  Copyright terms: Public domain W3C validator