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

Theorem idpm2idmp 22776
Description: The transformation of the identity polynomial matrix into polynomials over matrices results in the identity of the polynomials over matrices. (Contributed by AV, 18-Oct-2019.) (Revised by AV, 5-Dec-2019.)
Hypotheses
Ref Expression
pm2mpval.p 𝑃 = (Poly1𝑅)
pm2mpval.c 𝐶 = (𝑁 Mat 𝑃)
pm2mpval.b 𝐵 = (Base‘𝐶)
pm2mpval.m = ( ·𝑠𝑄)
pm2mpval.e = (.g‘(mulGrp‘𝑄))
pm2mpval.x 𝑋 = (var1𝐴)
pm2mpval.a 𝐴 = (𝑁 Mat 𝑅)
pm2mpval.q 𝑄 = (Poly1𝐴)
pm2mpval.t 𝑇 = (𝑁 pMatToMatPoly 𝑅)
Assertion
Ref Expression
idpm2idmp ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑇‘(1r𝐶)) = (1r𝑄))

Proof of Theorem idpm2idmp
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 pm2mpval.p . . . . 5 𝑃 = (Poly1𝑅)
2 pm2mpval.c . . . . 5 𝐶 = (𝑁 Mat 𝑃)
31, 2pmatring 22667 . . . 4 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐶 ∈ Ring)
4 pm2mpval.b . . . . 5 𝐵 = (Base‘𝐶)
5 eqid 2737 . . . . 5 (1r𝐶) = (1r𝐶)
64, 5ringidcl 20237 . . . 4 (𝐶 ∈ Ring → (1r𝐶) ∈ 𝐵)
73, 6syl 17 . . 3 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (1r𝐶) ∈ 𝐵)
8 pm2mpval.m . . . 4 = ( ·𝑠𝑄)
9 pm2mpval.e . . . 4 = (.g‘(mulGrp‘𝑄))
10 pm2mpval.x . . . 4 𝑋 = (var1𝐴)
11 pm2mpval.a . . . 4 𝐴 = (𝑁 Mat 𝑅)
12 pm2mpval.q . . . 4 𝑄 = (Poly1𝐴)
13 pm2mpval.t . . . 4 𝑇 = (𝑁 pMatToMatPoly 𝑅)
141, 2, 4, 8, 9, 10, 11, 12, 13pm2mpfval 22771 . . 3 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ (1r𝐶) ∈ 𝐵) → (𝑇‘(1r𝐶)) = (𝑄 Σg (𝑘 ∈ ℕ0 ↦ (((1r𝐶) decompPMat 𝑘) (𝑘 𝑋)))))
157, 14mpd3an3 1465 . 2 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑇‘(1r𝐶)) = (𝑄 Σg (𝑘 ∈ ℕ0 ↦ (((1r𝐶) decompPMat 𝑘) (𝑘 𝑋)))))
16 eqid 2737 . . . . . . 7 (0g𝐴) = (0g𝐴)
17 eqid 2737 . . . . . . 7 (1r𝐴) = (1r𝐴)
181, 2, 5, 11, 16, 17decpmatid 22745 . . . . . 6 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑘 ∈ ℕ0) → ((1r𝐶) decompPMat 𝑘) = if(𝑘 = 0, (1r𝐴), (0g𝐴)))
19183expa 1119 . . . . 5 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → ((1r𝐶) decompPMat 𝑘) = if(𝑘 = 0, (1r𝐴), (0g𝐴)))
2019oveq1d 7375 . . . 4 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → (((1r𝐶) decompPMat 𝑘) (𝑘 𝑋)) = (if(𝑘 = 0, (1r𝐴), (0g𝐴)) (𝑘 𝑋)))
2120mpteq2dva 5179 . . 3 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑘 ∈ ℕ0 ↦ (((1r𝐶) decompPMat 𝑘) (𝑘 𝑋))) = (𝑘 ∈ ℕ0 ↦ (if(𝑘 = 0, (1r𝐴), (0g𝐴)) (𝑘 𝑋))))
2221oveq2d 7376 . 2 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑄 Σg (𝑘 ∈ ℕ0 ↦ (((1r𝐶) decompPMat 𝑘) (𝑘 𝑋)))) = (𝑄 Σg (𝑘 ∈ ℕ0 ↦ (if(𝑘 = 0, (1r𝐴), (0g𝐴)) (𝑘 𝑋)))))
23 ovif 7458 . . . . . 6 (if(𝑘 = 0, (1r𝐴), (0g𝐴)) (𝑘 𝑋)) = if(𝑘 = 0, ((1r𝐴) (𝑘 𝑋)), ((0g𝐴) (𝑘 𝑋)))
2411matring 22418 . . . . . . . . . . . 12 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐴 ∈ Ring)
2512ply1sca 22226 . . . . . . . . . . . 12 (𝐴 ∈ Ring → 𝐴 = (Scalar‘𝑄))
2624, 25syl 17 . . . . . . . . . . 11 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐴 = (Scalar‘𝑄))
2726adantr 480 . . . . . . . . . 10 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → 𝐴 = (Scalar‘𝑄))
2827fveq2d 6838 . . . . . . . . 9 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → (1r𝐴) = (1r‘(Scalar‘𝑄)))
2928oveq1d 7375 . . . . . . . 8 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → ((1r𝐴) (𝑘 𝑋)) = ((1r‘(Scalar‘𝑄)) (𝑘 𝑋)))
3012ply1lmod 22225 . . . . . . . . . 10 (𝐴 ∈ Ring → 𝑄 ∈ LMod)
3124, 30syl 17 . . . . . . . . 9 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝑄 ∈ LMod)
32 eqid 2737 . . . . . . . . . . 11 (mulGrp‘𝑄) = (mulGrp‘𝑄)
33 eqid 2737 . . . . . . . . . . 11 (Base‘𝑄) = (Base‘𝑄)
3412, 10, 32, 9, 33ply1moncl 22246 . . . . . . . . . 10 ((𝐴 ∈ Ring ∧ 𝑘 ∈ ℕ0) → (𝑘 𝑋) ∈ (Base‘𝑄))
3524, 34sylan 581 . . . . . . . . 9 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → (𝑘 𝑋) ∈ (Base‘𝑄))
36 eqid 2737 . . . . . . . . . 10 (Scalar‘𝑄) = (Scalar‘𝑄)
37 eqid 2737 . . . . . . . . . 10 (1r‘(Scalar‘𝑄)) = (1r‘(Scalar‘𝑄))
3833, 36, 8, 37lmodvs1 20876 . . . . . . . . 9 ((𝑄 ∈ LMod ∧ (𝑘 𝑋) ∈ (Base‘𝑄)) → ((1r‘(Scalar‘𝑄)) (𝑘 𝑋)) = (𝑘 𝑋))
3931, 35, 38syl2an2r 686 . . . . . . . 8 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → ((1r‘(Scalar‘𝑄)) (𝑘 𝑋)) = (𝑘 𝑋))
4029, 39eqtrd 2772 . . . . . . 7 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → ((1r𝐴) (𝑘 𝑋)) = (𝑘 𝑋))
4127fveq2d 6838 . . . . . . . . 9 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → (0g𝐴) = (0g‘(Scalar‘𝑄)))
4241oveq1d 7375 . . . . . . . 8 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → ((0g𝐴) (𝑘 𝑋)) = ((0g‘(Scalar‘𝑄)) (𝑘 𝑋)))
43 eqid 2737 . . . . . . . . . 10 (0g‘(Scalar‘𝑄)) = (0g‘(Scalar‘𝑄))
44 eqid 2737 . . . . . . . . . 10 (0g𝑄) = (0g𝑄)
4533, 36, 8, 43, 44lmod0vs 20881 . . . . . . . . 9 ((𝑄 ∈ LMod ∧ (𝑘 𝑋) ∈ (Base‘𝑄)) → ((0g‘(Scalar‘𝑄)) (𝑘 𝑋)) = (0g𝑄))
4631, 35, 45syl2an2r 686 . . . . . . . 8 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → ((0g‘(Scalar‘𝑄)) (𝑘 𝑋)) = (0g𝑄))
4742, 46eqtrd 2772 . . . . . . 7 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → ((0g𝐴) (𝑘 𝑋)) = (0g𝑄))
4840, 47ifeq12d 4489 . . . . . 6 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → if(𝑘 = 0, ((1r𝐴) (𝑘 𝑋)), ((0g𝐴) (𝑘 𝑋))) = if(𝑘 = 0, (𝑘 𝑋), (0g𝑄)))
4923, 48eqtrid 2784 . . . . 5 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → (if(𝑘 = 0, (1r𝐴), (0g𝐴)) (𝑘 𝑋)) = if(𝑘 = 0, (𝑘 𝑋), (0g𝑄)))
5049mpteq2dva 5179 . . . 4 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑘 ∈ ℕ0 ↦ (if(𝑘 = 0, (1r𝐴), (0g𝐴)) (𝑘 𝑋))) = (𝑘 ∈ ℕ0 ↦ if(𝑘 = 0, (𝑘 𝑋), (0g𝑄))))
5150oveq2d 7376 . . 3 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑄 Σg (𝑘 ∈ ℕ0 ↦ (if(𝑘 = 0, (1r𝐴), (0g𝐴)) (𝑘 𝑋)))) = (𝑄 Σg (𝑘 ∈ ℕ0 ↦ if(𝑘 = 0, (𝑘 𝑋), (0g𝑄)))))
5212ply1ring 22221 . . . . 5 (𝐴 ∈ Ring → 𝑄 ∈ Ring)
53 ringmnd 20215 . . . . 5 (𝑄 ∈ Ring → 𝑄 ∈ Mnd)
5424, 52, 533syl 18 . . . 4 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝑄 ∈ Mnd)
55 nn0ex 12434 . . . . 5 0 ∈ V
5655a1i 11 . . . 4 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → ℕ0 ∈ V)
57 0nn0 12443 . . . . 5 0 ∈ ℕ0
5857a1i 11 . . . 4 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 0 ∈ ℕ0)
59 eqid 2737 . . . 4 (𝑘 ∈ ℕ0 ↦ if(𝑘 = 0, (𝑘 𝑋), (0g𝑄))) = (𝑘 ∈ ℕ0 ↦ if(𝑘 = 0, (𝑘 𝑋), (0g𝑄)))
6035ralrimiva 3130 . . . 4 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → ∀𝑘 ∈ ℕ0 (𝑘 𝑋) ∈ (Base‘𝑄))
6144, 54, 56, 58, 59, 60gsummpt1n0 19931 . . 3 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑄 Σg (𝑘 ∈ ℕ0 ↦ if(𝑘 = 0, (𝑘 𝑋), (0g𝑄)))) = 0 / 𝑘(𝑘 𝑋))
62 c0ex 11129 . . . . 5 0 ∈ V
63 csbov1g 7407 . . . . 5 (0 ∈ V → 0 / 𝑘(𝑘 𝑋) = (0 / 𝑘𝑘 𝑋))
6462, 63mp1i 13 . . . 4 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 0 / 𝑘(𝑘 𝑋) = (0 / 𝑘𝑘 𝑋))
65 csbvarg 4375 . . . . . 6 (0 ∈ V → 0 / 𝑘𝑘 = 0)
6662, 65mp1i 13 . . . . 5 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 0 / 𝑘𝑘 = 0)
6766oveq1d 7375 . . . 4 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (0 / 𝑘𝑘 𝑋) = (0 𝑋))
6812, 10, 32, 9ply1idvr1 22269 . . . . 5 (𝐴 ∈ Ring → (0 𝑋) = (1r𝑄))
6924, 68syl 17 . . . 4 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (0 𝑋) = (1r𝑄))
7064, 67, 693eqtrd 2776 . . 3 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 0 / 𝑘(𝑘 𝑋) = (1r𝑄))
7151, 61, 703eqtrd 2776 . 2 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑄 Σg (𝑘 ∈ ℕ0 ↦ (if(𝑘 = 0, (1r𝐴), (0g𝐴)) (𝑘 𝑋)))) = (1r𝑄))
7215, 22, 713eqtrd 2776 1 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑇‘(1r𝐶)) = (1r𝑄))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  Vcvv 3430  csb 3838  ifcif 4467  cmpt 5167  cfv 6492  (class class class)co 7360  Fincfn 8886  0cc0 11029  0cn0 12428  Basecbs 17170  Scalarcsca 17214   ·𝑠 cvsca 17215  0gc0g 17393   Σg cgsu 17394  Mndcmnd 18693  .gcmg 19034  mulGrpcmgp 20112  1rcur 20153  Ringcrg 20205  LModclmod 20846  var1cv1 22149  Poly1cpl1 22150   Mat cmat 22382   decompPMat cdecpmat 22737   pMatToMatPoly cpm2mp 22767
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-tp 4573  df-op 4575  df-ot 4577  df-uni 4852  df-int 4891  df-iun 4936  df-iin 4937  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-se 5578  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-isom 6501  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-of 7624  df-ofr 7625  df-om 7811  df-1st 7935  df-2nd 7936  df-supp 8104  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-1o 8398  df-2o 8399  df-er 8636  df-map 8768  df-pm 8769  df-ixp 8839  df-en 8887  df-dom 8888  df-sdom 8889  df-fin 8890  df-fsupp 9268  df-sup 9348  df-oi 9418  df-card 9854  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-nn 12166  df-2 12235  df-3 12236  df-4 12237  df-5 12238  df-6 12239  df-7 12240  df-8 12241  df-9 12242  df-n0 12429  df-z 12516  df-dec 12636  df-uz 12780  df-fz 13453  df-fzo 13600  df-seq 13955  df-hash 14284  df-struct 17108  df-sets 17125  df-slot 17143  df-ndx 17155  df-base 17171  df-ress 17192  df-plusg 17224  df-mulr 17225  df-sca 17227  df-vsca 17228  df-ip 17229  df-tset 17230  df-ple 17231  df-ds 17233  df-hom 17235  df-cco 17236  df-0g 17395  df-gsum 17396  df-prds 17401  df-pws 17403  df-mre 17539  df-mrc 17540  df-acs 17542  df-mgm 18599  df-sgrp 18678  df-mnd 18694  df-mhm 18742  df-submnd 18743  df-grp 18903  df-minusg 18904  df-sbg 18905  df-mulg 19035  df-subg 19090  df-ghm 19179  df-cntz 19283  df-cmn 19748  df-abl 19749  df-mgp 20113  df-rng 20125  df-ur 20154  df-ring 20207  df-subrng 20514  df-subrg 20538  df-lmod 20848  df-lss 20918  df-sra 21160  df-rgmod 21161  df-dsmm 21722  df-frlm 21737  df-psr 21899  df-mvr 21900  df-mpl 21901  df-opsr 21903  df-psr1 22153  df-vr1 22154  df-ply1 22155  df-coe1 22156  df-mamu 22366  df-mat 22383  df-decpmat 22738  df-pm2mp 22768
This theorem is referenced by:  pm2mpmhm  22795
  Copyright terms: Public domain W3C validator