Metamath Proof Explorer


Theorem cpmat

Description: Value of the constructor of the set of all constant polynomial matrices, i.e. the set of all N x N matrices of polynomials over a ring R . (Contributed by AV, 15-Nov-2019)

Ref Expression
Hypotheses cpmat.s S=NConstPolyMatR
cpmat.p P=Poly1R
cpmat.c C=NMatP
cpmat.b B=BaseC
Assertion cpmat NFinRVS=mB|iNjNkcoe1imjk=0R

Proof

Step Hyp Ref Expression
1 cpmat.s S=NConstPolyMatR
2 cpmat.p P=Poly1R
3 cpmat.c C=NMatP
4 cpmat.b B=BaseC
5 df-cpmat ConstPolyMat=nFin,rVmBasenMatPoly1r|injnkcoe1imjk=0r
6 5 a1i NFinRVConstPolyMat=nFin,rVmBasenMatPoly1r|injnkcoe1imjk=0r
7 simpl n=Nr=Rn=N
8 fveq2 r=RPoly1r=Poly1R
9 8 adantl n=Nr=RPoly1r=Poly1R
10 7 9 oveq12d n=Nr=RnMatPoly1r=NMatPoly1R
11 10 fveq2d n=Nr=RBasenMatPoly1r=BaseNMatPoly1R
12 2 oveq2i NMatP=NMatPoly1R
13 3 12 eqtri C=NMatPoly1R
14 13 fveq2i BaseC=BaseNMatPoly1R
15 4 14 eqtri B=BaseNMatPoly1R
16 11 15 eqtr4di n=Nr=RBasenMatPoly1r=B
17 fveq2 r=R0r=0R
18 17 adantl n=Nr=R0r=0R
19 18 eqeq2d n=Nr=Rcoe1imjk=0rcoe1imjk=0R
20 19 ralbidv n=Nr=Rkcoe1imjk=0rkcoe1imjk=0R
21 7 20 raleqbidv n=Nr=Rjnkcoe1imjk=0rjNkcoe1imjk=0R
22 7 21 raleqbidv n=Nr=Rinjnkcoe1imjk=0riNjNkcoe1imjk=0R
23 16 22 rabeqbidv n=Nr=RmBasenMatPoly1r|injnkcoe1imjk=0r=mB|iNjNkcoe1imjk=0R
24 23 adantl NFinRVn=Nr=RmBasenMatPoly1r|injnkcoe1imjk=0r=mB|iNjNkcoe1imjk=0R
25 simpl NFinRVNFin
26 elex RVRV
27 26 adantl NFinRVRV
28 4 fvexi BV
29 rabexg BVmB|iNjNkcoe1imjk=0RV
30 28 29 mp1i NFinRVmB|iNjNkcoe1imjk=0RV
31 6 24 25 27 30 ovmpod NFinRVNConstPolyMatR=mB|iNjNkcoe1imjk=0R
32 1 31 eqtrid NFinRVS=mB|iNjNkcoe1imjk=0R