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

Theorem idpm2idmp 22841
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 22732 . . . 4 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐶 ∈ Ring)
4 pm2mpval.b . . . . 5 𝐵 = (Base‘𝐶)
5 eqid 2761 . . . . 5 (1r𝐶) = (1r𝐶)
64, 5ringidcl 20294 . . . 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 22836 . . 3 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ (1r𝐶) ∈ 𝐵) → (𝑇‘(1r𝐶)) = (𝑄 Σg (𝑘 ∈ ℕ0 ↦ (((1r𝐶) decompPMat 𝑘) (𝑘 𝑋)))))
157, 14mpd3an3 1482 . 2 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑇‘(1r𝐶)) = (𝑄 Σg (𝑘 ∈ ℕ0 ↦ (((1r𝐶) decompPMat 𝑘) (𝑘 𝑋)))))
16 eqid 2761 . . . . . . 7 (0g𝐴) = (0g𝐴)
17 eqid 2761 . . . . . . 7 (1r𝐴) = (1r𝐴)
181, 2, 5, 11, 16, 17decpmatid 22810 . . . . . 6 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑘 ∈ ℕ0) → ((1r𝐶) decompPMat 𝑘) = if(𝑘 = 0, (1r𝐴), (0g𝐴)))
19183expa 1130 . . . . 5 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → ((1r𝐶) decompPMat 𝑘) = if(𝑘 = 0, (1r𝐴), (0g𝐴)))
2019oveq1d 7407 . . . 4 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → (((1r𝐶) decompPMat 𝑘) (𝑘 𝑋)) = (if(𝑘 = 0, (1r𝐴), (0g𝐴)) (𝑘 𝑋)))
2120mpteq2dva 5192 . . 3 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑘 ∈ ℕ0 ↦ (((1r𝐶) decompPMat 𝑘) (𝑘 𝑋))) = (𝑘 ∈ ℕ0 ↦ (if(𝑘 = 0, (1r𝐴), (0g𝐴)) (𝑘 𝑋))))
2221oveq2d 7408 . 2 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑄 Σg (𝑘 ∈ ℕ0 ↦ (((1r𝐶) decompPMat 𝑘) (𝑘 𝑋)))) = (𝑄 Σg (𝑘 ∈ ℕ0 ↦ (if(𝑘 = 0, (1r𝐴), (0g𝐴)) (𝑘 𝑋)))))
23 ovif 7490 . . . . . 6 (if(𝑘 = 0, (1r𝐴), (0g𝐴)) (𝑘 𝑋)) = if(𝑘 = 0, ((1r𝐴) (𝑘 𝑋)), ((0g𝐴) (𝑘 𝑋)))
2411matring 22483 . . . . . . . . . . . 12 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐴 ∈ Ring)
2512ply1sca 22294 . . . . . . . . . . . 12 (𝐴 ∈ Ring → 𝐴 = (Scalar‘𝑄))
2624, 25syl 17 . . . . . . . . . . 11 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐴 = (Scalar‘𝑄))
2726adantr 484 . . . . . . . . . 10 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → 𝐴 = (Scalar‘𝑄))
2827fveq2d 6867 . . . . . . . . 9 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → (1r𝐴) = (1r‘(Scalar‘𝑄)))
2928oveq1d 7407 . . . . . . . 8 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → ((1r𝐴) (𝑘 𝑋)) = ((1r‘(Scalar‘𝑄)) (𝑘 𝑋)))
3012ply1lmod 22293 . . . . . . . . . 10 (𝐴 ∈ Ring → 𝑄 ∈ LMod)
3124, 30syl 17 . . . . . . . . 9 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝑄 ∈ LMod)
32 eqid 2761 . . . . . . . . . . 11 (mulGrp‘𝑄) = (mulGrp‘𝑄)
33 eqid 2761 . . . . . . . . . . 11 (Base‘𝑄) = (Base‘𝑄)
3412, 10, 32, 9, 33ply1moncl 22314 . . . . . . . . . 10 ((𝐴 ∈ Ring ∧ 𝑘 ∈ ℕ0) → (𝑘 𝑋) ∈ (Base‘𝑄))
3524, 34sylan 589 . . . . . . . . 9 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → (𝑘 𝑋) ∈ (Base‘𝑄))
36 eqid 2761 . . . . . . . . . 10 (Scalar‘𝑄) = (Scalar‘𝑄)
37 eqid 2761 . . . . . . . . . 10 (1r‘(Scalar‘𝑄)) = (1r‘(Scalar‘𝑄))
3833, 36, 8, 37lmodvs1 20937 . . . . . . . . 9 ((𝑄 ∈ LMod ∧ (𝑘 𝑋) ∈ (Base‘𝑄)) → ((1r‘(Scalar‘𝑄)) (𝑘 𝑋)) = (𝑘 𝑋))
3931, 35, 38syl2an2r 695 . . . . . . . 8 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → ((1r‘(Scalar‘𝑄)) (𝑘 𝑋)) = (𝑘 𝑋))
4029, 39eqtrd 2796 . . . . . . 7 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → ((1r𝐴) (𝑘 𝑋)) = (𝑘 𝑋))
4127fveq2d 6867 . . . . . . . . 9 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → (0g𝐴) = (0g‘(Scalar‘𝑄)))
4241oveq1d 7407 . . . . . . . 8 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → ((0g𝐴) (𝑘 𝑋)) = ((0g‘(Scalar‘𝑄)) (𝑘 𝑋)))
43 eqid 2761 . . . . . . . . . 10 (0g‘(Scalar‘𝑄)) = (0g‘(Scalar‘𝑄))
44 eqid 2761 . . . . . . . . . 10 (0g𝑄) = (0g𝑄)
4533, 36, 8, 43, 44lmod0vs 20942 . . . . . . . . 9 ((𝑄 ∈ LMod ∧ (𝑘 𝑋) ∈ (Base‘𝑄)) → ((0g‘(Scalar‘𝑄)) (𝑘 𝑋)) = (0g𝑄))
4631, 35, 45syl2an2r 695 . . . . . . . 8 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → ((0g‘(Scalar‘𝑄)) (𝑘 𝑋)) = (0g𝑄))
4742, 46eqtrd 2796 . . . . . . 7 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → ((0g𝐴) (𝑘 𝑋)) = (0g𝑄))
4840, 47ifeq12d 4501 . . . . . 6 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → if(𝑘 = 0, ((1r𝐴) (𝑘 𝑋)), ((0g𝐴) (𝑘 𝑋))) = if(𝑘 = 0, (𝑘 𝑋), (0g𝑄)))
4923, 48eqtrid 2808 . . . . 5 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑘 ∈ ℕ0) → (if(𝑘 = 0, (1r𝐴), (0g𝐴)) (𝑘 𝑋)) = if(𝑘 = 0, (𝑘 𝑋), (0g𝑄)))
5049mpteq2dva 5192 . . . 4 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑘 ∈ ℕ0 ↦ (if(𝑘 = 0, (1r𝐴), (0g𝐴)) (𝑘 𝑋))) = (𝑘 ∈ ℕ0 ↦ if(𝑘 = 0, (𝑘 𝑋), (0g𝑄))))
5150oveq2d 7408 . . 3 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑄 Σg (𝑘 ∈ ℕ0 ↦ (if(𝑘 = 0, (1r𝐴), (0g𝐴)) (𝑘 𝑋)))) = (𝑄 Σg (𝑘 ∈ ℕ0 ↦ if(𝑘 = 0, (𝑘 𝑋), (0g𝑄)))))
5212ply1ring 22289 . . . . 5 (𝐴 ∈ Ring → 𝑄 ∈ Ring)
53 ringmnd 20272 . . . . 5 (𝑄 ∈ Ring → 𝑄 ∈ Mnd)
5424, 52, 533syl 18 . . . 4 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝑄 ∈ Mnd)
55 nn0ex 12484 . . . . 5 0 ∈ V
5655a1i 11 . . . 4 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → ℕ0 ∈ V)
57 0nn0 12493 . . . . 5 0 ∈ ℕ0
5857a1i 11 . . . 4 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 0 ∈ ℕ0)
59 eqid 2761 . . . 4 (𝑘 ∈ ℕ0 ↦ if(𝑘 = 0, (𝑘 𝑋), (0g𝑄))) = (𝑘 ∈ ℕ0 ↦ if(𝑘 = 0, (𝑘 𝑋), (0g𝑄)))
6035ralrimiva 3153 . . . 4 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → ∀𝑘 ∈ ℕ0 (𝑘 𝑋) ∈ (Base‘𝑄))
6144, 54, 56, 58, 59, 60gsummpt1n0 19988 . . 3 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑄 Σg (𝑘 ∈ ℕ0 ↦ if(𝑘 = 0, (𝑘 𝑋), (0g𝑄)))) = 0 / 𝑘(𝑘 𝑋))
62 c0ex 11170 . . . . 5 0 ∈ V
63 csbov1g 7439 . . . . 5 (0 ∈ V → 0 / 𝑘(𝑘 𝑋) = (0 / 𝑘𝑘 𝑋))
6462, 63mp1i 13 . . . 4 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 0 / 𝑘(𝑘 𝑋) = (0 / 𝑘𝑘 𝑋))
65 csbvarg 4387 . . . . . 6 (0 ∈ V → 0 / 𝑘𝑘 = 0)
6662, 65mp1i 13 . . . . 5 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 0 / 𝑘𝑘 = 0)
6766oveq1d 7407 . . . 4 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (0 / 𝑘𝑘 𝑋) = (0 𝑋))
6812, 10, 32, 9ply1idvr1 22337 . . . . 5 (𝐴 ∈ Ring → (0 𝑋) = (1r𝑄))
6924, 68syl 17 . . . 4 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (0 𝑋) = (1r𝑄))
7064, 67, 693eqtrd 2800 . . 3 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 0 / 𝑘(𝑘 𝑋) = (1r𝑄))
7151, 61, 703eqtrd 2800 . 2 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑄 Σg (𝑘 ∈ ℕ0 ↦ (if(𝑘 = 0, (1r𝐴), (0g𝐴)) (𝑘 𝑋)))) = (1r𝑄))
7215, 22, 713eqtrd 2800 1 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑇‘(1r𝐶)) = (1r𝑄))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1559  wcel 2141  Vcvv 3453  csb 3852  ifcif 4479  cmpt 5180  cfv 6517  (class class class)co 7392  Fincfn 8923  0cc0 11070  0cn0 12478  Basecbs 17228  Scalarcsca 17272   ·𝑠 cvsca 17273  0gc0g 17451   Σg cgsu 17452  Mndcmnd 18751  .gcmg 19092  mulGrpcmgp 20169  1rcur 20210  Ringcrg 20262  LModclmod 20907  var1cv1 22218  Poly1cpl1 22219   Mat cmat 22447   decompPMat cdecpmat 22802   pMatToMatPoly cpm2mp 22832
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7714  ax-cnex 11126  ax-resscn 11127  ax-1cn 11128  ax-icn 11129  ax-addcl 11130  ax-addrcl 11131  ax-mulcl 11132  ax-mulrcl 11133  ax-mulcom 11134  ax-addass 11135  ax-mulass 11136  ax-distr 11137  ax-i2m1 11138  ax-1ne0 11139  ax-1rid 11140  ax-rnegex 11141  ax-rrecex 11142  ax-cnre 11143  ax-pre-lttri 11144  ax-pre-lttrn 11145  ax-pre-ltadd 11146  ax-pre-mulgt0 11147
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3061  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-tp 4586  df-op 4588  df-ot 4590  df-uni 4865  df-int 4905  df-iun 4950  df-iin 4951  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5540  df-eprel 5545  df-po 5553  df-so 5554  df-fr 5598  df-se 5599  df-we 5600  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-pred 6284  df-ord 6345  df-on 6346  df-lim 6347  df-suc 6348  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-isom 6526  df-riota 7349  df-ov 7395  df-oprab 7396  df-mpo 7397  df-of 7656  df-ofr 7657  df-om 7843  df-1st 7966  df-2nd 7967  df-supp 8136  df-frecs 8257  df-wrecs 8288  df-recs 8337  df-rdg 8376  df-1o 8432  df-2o 8433  df-er 8673  df-map 8805  df-pm 8806  df-ixp 8876  df-en 8924  df-dom 8925  df-sdom 8926  df-fin 8927  df-fsupp 9305  df-sup 9385  df-oi 9455  df-card 9894  df-pnf 11215  df-mnf 11216  df-xr 11217  df-ltxr 11218  df-le 11219  df-sub 11413  df-neg 11414  df-nn 12208  df-2 12277  df-3 12278  df-4 12279  df-5 12280  df-6 12281  df-7 12282  df-8 12283  df-9 12284  df-n0 12479  df-z 12566  df-dec 12686  df-uz 12837  df-fz 13510  df-fzo 13657  df-seq 14012  df-hash 14341  df-struct 17166  df-sets 17183  df-slot 17201  df-ndx 17213  df-base 17229  df-ress 17250  df-plusg 17282  df-mulr 17283  df-sca 17285  df-vsca 17286  df-ip 17287  df-tset 17288  df-ple 17289  df-ds 17291  df-hom 17293  df-cco 17294  df-0g 17453  df-gsum 17454  df-prds 17459  df-pws 17461  df-mre 17597  df-mrc 17598  df-acs 17600  df-mgm 18657  df-sgrp 18736  df-mnd 18752  df-mhm 18800  df-submnd 18801  df-grp 18961  df-minusg 18962  df-sbg 18963  df-mulg 19093  df-subg 19148  df-ghm 19237  df-cntz 19340  df-cmn 19805  df-abl 19806  df-mgp 20170  df-rng 20182  df-ur 20211  df-ring 20264  df-subrng 20575  df-subrg 20599  df-lmod 20909  df-lss 20979  df-sra 21220  df-rgmod 21221  df-dsmm 21764  df-frlm 21779  df-psr 21941  df-mvr 21942  df-mpl 21943  df-opsr 21945  df-psr1 22222  df-vr1 22223  df-ply1 22224  df-coe1 22225  df-mamu 22431  df-mat 22448  df-decpmat 22803  df-pm2mp 22833
This theorem is referenced by:  pm2mpmhm  22860
  Copyright terms: Public domain W3C validator