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

Theorem cpmat 20454
Description: Value of the constructor of the set of all constant polynomial matrices, i.e. the set of all 𝑁 x 𝑁 matrices of polynomials over a ring 𝑅. (Contributed by AV, 15-Nov-2019.)
Hypotheses
Ref Expression
cpmat.s 𝑆 = (𝑁 ConstPolyMat 𝑅)
cpmat.p 𝑃 = (Poly1𝑅)
cpmat.c 𝐶 = (𝑁 Mat 𝑃)
cpmat.b 𝐵 = (Base‘𝐶)
Assertion
Ref Expression
cpmat ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝑆 = {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑅)})
Distinct variable groups:   𝐵,𝑚   𝑖,𝑁,𝑗,𝑘,𝑚   𝑅,𝑖,𝑗,𝑘,𝑚
Allowed substitution hints:   𝐵(𝑖,𝑗,𝑘)   𝐶(𝑖,𝑗,𝑘,𝑚)   𝑃(𝑖,𝑗,𝑘,𝑚)   𝑆(𝑖,𝑗,𝑘,𝑚)   𝑉(𝑖,𝑗,𝑘,𝑚)

Proof of Theorem cpmat
Dummy variables 𝑛 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cpmat.s . 2 𝑆 = (𝑁 ConstPolyMat 𝑅)
2 df-cpmat 20451 . . . 4 ConstPolyMat = (𝑛 ∈ Fin, 𝑟 ∈ V ↦ {𝑚 ∈ (Base‘(𝑛 Mat (Poly1𝑟))) ∣ ∀𝑖𝑛𝑗𝑛𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑟)})
32a1i 11 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → ConstPolyMat = (𝑛 ∈ Fin, 𝑟 ∈ V ↦ {𝑚 ∈ (Base‘(𝑛 Mat (Poly1𝑟))) ∣ ∀𝑖𝑛𝑗𝑛𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑟)}))
4 simpl 473 . . . . . . . 8 ((𝑛 = 𝑁𝑟 = 𝑅) → 𝑛 = 𝑁)
5 fveq2 6158 . . . . . . . . 9 (𝑟 = 𝑅 → (Poly1𝑟) = (Poly1𝑅))
65adantl 482 . . . . . . . 8 ((𝑛 = 𝑁𝑟 = 𝑅) → (Poly1𝑟) = (Poly1𝑅))
74, 6oveq12d 6633 . . . . . . 7 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑛 Mat (Poly1𝑟)) = (𝑁 Mat (Poly1𝑅)))
87fveq2d 6162 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → (Base‘(𝑛 Mat (Poly1𝑟))) = (Base‘(𝑁 Mat (Poly1𝑅))))
9 cpmat.b . . . . . . 7 𝐵 = (Base‘𝐶)
10 cpmat.c . . . . . . . . 9 𝐶 = (𝑁 Mat 𝑃)
11 cpmat.p . . . . . . . . . 10 𝑃 = (Poly1𝑅)
1211oveq2i 6626 . . . . . . . . 9 (𝑁 Mat 𝑃) = (𝑁 Mat (Poly1𝑅))
1310, 12eqtri 2643 . . . . . . . 8 𝐶 = (𝑁 Mat (Poly1𝑅))
1413fveq2i 6161 . . . . . . 7 (Base‘𝐶) = (Base‘(𝑁 Mat (Poly1𝑅)))
159, 14eqtri 2643 . . . . . 6 𝐵 = (Base‘(𝑁 Mat (Poly1𝑅)))
168, 15syl6eqr 2673 . . . . 5 ((𝑛 = 𝑁𝑟 = 𝑅) → (Base‘(𝑛 Mat (Poly1𝑟))) = 𝐵)
17 fveq2 6158 . . . . . . . . . 10 (𝑟 = 𝑅 → (0g𝑟) = (0g𝑅))
1817adantl 482 . . . . . . . . 9 ((𝑛 = 𝑁𝑟 = 𝑅) → (0g𝑟) = (0g𝑅))
1918eqeq2d 2631 . . . . . . . 8 ((𝑛 = 𝑁𝑟 = 𝑅) → (((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑟) ↔ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑅)))
2019ralbidv 2982 . . . . . . 7 ((𝑛 = 𝑁𝑟 = 𝑅) → (∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑟) ↔ ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑅)))
214, 20raleqbidv 3145 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → (∀𝑗𝑛𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑟) ↔ ∀𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑅)))
224, 21raleqbidv 3145 . . . . 5 ((𝑛 = 𝑁𝑟 = 𝑅) → (∀𝑖𝑛𝑗𝑛𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑟) ↔ ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑅)))
2316, 22rabeqbidv 3185 . . . 4 ((𝑛 = 𝑁𝑟 = 𝑅) → {𝑚 ∈ (Base‘(𝑛 Mat (Poly1𝑟))) ∣ ∀𝑖𝑛𝑗𝑛𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑟)} = {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑅)})
2423adantl 482 . . 3 (((𝑁 ∈ Fin ∧ 𝑅𝑉) ∧ (𝑛 = 𝑁𝑟 = 𝑅)) → {𝑚 ∈ (Base‘(𝑛 Mat (Poly1𝑟))) ∣ ∀𝑖𝑛𝑗𝑛𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑟)} = {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑅)})
25 simpl 473 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝑁 ∈ Fin)
26 elex 3202 . . . 4 (𝑅𝑉𝑅 ∈ V)
2726adantl 482 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝑅 ∈ V)
28 fvex 6168 . . . . 5 (Base‘𝐶) ∈ V
299, 28eqeltri 2694 . . . 4 𝐵 ∈ V
30 rabexg 4782 . . . 4 (𝐵 ∈ V → {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑅)} ∈ V)
3129, 30mp1i 13 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑅)} ∈ V)
323, 24, 25, 27, 31ovmpt2d 6753 . 2 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → (𝑁 ConstPolyMat 𝑅) = {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑅)})
331, 32syl5eq 2667 1 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝑆 = {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑅)})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384   = wceq 1480  wcel 1987  wral 2908  {crab 2912  Vcvv 3190  cfv 5857  (class class class)co 6615  cmpt2 6617  Fincfn 7915  cn 10980  Basecbs 15800  0gc0g 16040  Poly1cpl1 19487  coe1cco1 19488   Mat cmat 20153   ConstPolyMat ccpmat 20448
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4751  ax-nul 4759  ax-pr 4877
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ral 2913  df-rex 2914  df-rab 2917  df-v 3192  df-sbc 3423  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-nul 3898  df-if 4065  df-sn 4156  df-pr 4158  df-op 4162  df-uni 4410  df-br 4624  df-opab 4684  df-id 4999  df-xp 5090  df-rel 5091  df-cnv 5092  df-co 5093  df-dm 5094  df-iota 5820  df-fun 5859  df-fv 5865  df-ov 6618  df-oprab 6619  df-mpt2 6620  df-cpmat 20451
This theorem is referenced by:  cpmatpmat  20455  cpmatel  20456  cpmatsubgpmat  20465
  Copyright terms: Public domain W3C validator