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

Theorem cpmatel 22213
Description: Property of a constant polynomial matrix. (Contributed by AV, 15-Nov-2019.)
Hypotheses
Ref Expression
cpmat.s 𝑆 = (𝑁 ConstPolyMat 𝑅)
cpmat.p 𝑃 = (Poly1𝑅)
cpmat.c 𝐶 = (𝑁 Mat 𝑃)
cpmat.b 𝐵 = (Base‘𝐶)
Assertion
Ref Expression
cpmatel ((𝑁 ∈ Fin ∧ 𝑅𝑉𝑀𝐵) → (𝑀𝑆 ↔ ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g𝑅)))
Distinct variable groups:   𝑖,𝑁,𝑗,𝑘   𝑅,𝑖,𝑗,𝑘   𝑖,𝑀,𝑗,𝑘
Allowed substitution hints:   𝐵(𝑖,𝑗,𝑘)   𝐶(𝑖,𝑗,𝑘)   𝑃(𝑖,𝑗,𝑘)   𝑆(𝑖,𝑗,𝑘)   𝑉(𝑖,𝑗,𝑘)

Proof of Theorem cpmatel
Dummy variable 𝑚 is distinct from all other variables.
StepHypRef Expression
1 cpmat.s . . . . . 6 𝑆 = (𝑁 ConstPolyMat 𝑅)
2 cpmat.p . . . . . 6 𝑃 = (Poly1𝑅)
3 cpmat.c . . . . . 6 𝐶 = (𝑁 Mat 𝑃)
4 cpmat.b . . . . . 6 𝐵 = (Base‘𝐶)
51, 2, 3, 4cpmat 22211 . . . . 5 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝑆 = {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑅)})
653adant3 1133 . . . 4 ((𝑁 ∈ Fin ∧ 𝑅𝑉𝑀𝐵) → 𝑆 = {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑅)})
76eleq2d 2820 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉𝑀𝐵) → (𝑀𝑆𝑀 ∈ {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑅)}))
8 oveq 7415 . . . . . . . . 9 (𝑚 = 𝑀 → (𝑖𝑚𝑗) = (𝑖𝑀𝑗))
98fveq2d 6896 . . . . . . . 8 (𝑚 = 𝑀 → (coe1‘(𝑖𝑚𝑗)) = (coe1‘(𝑖𝑀𝑗)))
109fveq1d 6894 . . . . . . 7 (𝑚 = 𝑀 → ((coe1‘(𝑖𝑚𝑗))‘𝑘) = ((coe1‘(𝑖𝑀𝑗))‘𝑘))
1110eqeq1d 2735 . . . . . 6 (𝑚 = 𝑀 → (((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑅) ↔ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g𝑅)))
1211ralbidv 3178 . . . . 5 (𝑚 = 𝑀 → (∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑅) ↔ ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g𝑅)))
13122ralbidv 3219 . . . 4 (𝑚 = 𝑀 → (∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑅) ↔ ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g𝑅)))
1413elrab 3684 . . 3 (𝑀 ∈ {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g𝑅)} ↔ (𝑀𝐵 ∧ ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g𝑅)))
157, 14bitrdi 287 . 2 ((𝑁 ∈ Fin ∧ 𝑅𝑉𝑀𝐵) → (𝑀𝑆 ↔ (𝑀𝐵 ∧ ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g𝑅))))
16153anibar 1330 1 ((𝑁 ∈ Fin ∧ 𝑅𝑉𝑀𝐵) → (𝑀𝑆 ↔ ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g𝑅)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 397  w3a 1088   = wceq 1542  wcel 2107  wral 3062  {crab 3433  cfv 6544  (class class class)co 7409  Fincfn 8939  cn 12212  Basecbs 17144  0gc0g 17385  Poly1cpl1 21701  coe1cco1 21702   Mat cmat 21907   ConstPolyMat ccpmat 22205
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pr 5428
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-sbc 3779  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-br 5150  df-opab 5212  df-id 5575  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-iota 6496  df-fun 6546  df-fv 6552  df-ov 7412  df-oprab 7413  df-mpo 7414  df-cpmat 22208
This theorem is referenced by:  cpmatelimp  22214  cpmatel2  22215  1elcpmat  22217  cpmatmcl  22221  m2cpm  22243
  Copyright terms: Public domain W3C validator