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

Theorem mply1topmatval 22811
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 22818). (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 6905 . . . . . . . 8 (𝑝 = 𝑂 → (coe1𝑝) = (coe1𝑂))
32fveq1d 6907 . . . . . . 7 (𝑝 = 𝑂 → ((coe1𝑝)‘𝑘) = ((coe1𝑂)‘𝑘))
43oveqd 7449 . . . . . 6 (𝑝 = 𝑂 → (𝑖((coe1𝑝)‘𝑘)𝑗) = (𝑖((coe1𝑂)‘𝑘)𝑗))
54oveq1d 7447 . . . . 5 (𝑝 = 𝑂 → ((𝑖((coe1𝑝)‘𝑘)𝑗) · (𝑘𝐸𝑌)) = ((𝑖((coe1𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌)))
65mpteq2dv 5243 . . . 4 (𝑝 = 𝑂 → (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑝)‘𝑘)𝑗) · (𝑘𝐸𝑌))) = (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌))))
76oveq2d 7448 . . 3 (𝑝 = 𝑂 → (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑝)‘𝑘)𝑗) · (𝑘𝐸𝑌)))) = (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌)))))
87mpoeq3dv 7513 . 2 (𝑝 = 𝑂 → (𝑖𝑁, 𝑗𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑝)‘𝑘)𝑗) · (𝑘𝐸𝑌))))) = (𝑖𝑁, 𝑗𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌))))))
9 simpr 484 . 2 ((𝑁𝑉𝑂𝐿) → 𝑂𝐿)
10 simpl 482 . . 3 ((𝑁𝑉𝑂𝐿) → 𝑁𝑉)
11 mpoexga 8103 . . 3 ((𝑁𝑉𝑁𝑉) → (𝑖𝑁, 𝑗𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌))))) ∈ V)
1210, 11syldan 591 . 2 ((𝑁𝑉𝑂𝐿) → (𝑖𝑁, 𝑗𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌))))) ∈ V)
131, 8, 9, 12fvmptd3 7038 1 ((𝑁𝑉𝑂𝐿) → (𝐼𝑂) = (𝑖𝑁, 𝑗𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌))))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1539  wcel 2107  Vcvv 3479  cmpt 5224  cfv 6560  (class class class)co 7432  cmpo 7434  0cn0 12528  Basecbs 17248   ·𝑠 cvsca 17302   Σg cgsu 17486  .gcmg 19086  mulGrpcmgp 20138  var1cv1 22178  Poly1cpl1 22179  coe1cco1 22180   Mat cmat 22412
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-rep 5278  ax-sep 5295  ax-nul 5305  ax-pow 5364  ax-pr 5431  ax-un 7756
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3380  df-rab 3436  df-v 3481  df-sbc 3788  df-csb 3899  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-nul 4333  df-if 4525  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-iun 4992  df-br 5143  df-opab 5205  df-mpt 5225  df-id 5577  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-res 5696  df-ima 5697  df-iota 6513  df-fun 6562  df-fn 6563  df-f 6564  df-f1 6565  df-fo 6566  df-f1o 6567  df-fv 6568  df-ov 7435  df-oprab 7436  df-mpo 7437  df-1st 8015  df-2nd 8016
This theorem is referenced by:  mply1topmatcl  22812
  Copyright terms: Public domain W3C validator