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

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

Proof of Theorem cpmatelimp
StepHypRef Expression
1 cpmat.s . . . . 5 𝑆 = (𝑁 ConstPolyMat 𝑅)
2 cpmat.p . . . . 5 𝑃 = (Poly1𝑅)
3 cpmat.c . . . . 5 𝐶 = (𝑁 Mat 𝑃)
4 cpmat.b . . . . 5 𝐵 = (Base‘𝐶)
51, 2, 3, 4cpmatpmat 22675 . . . 4 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀𝑆) → 𝑀𝐵)
653expa 1119 . . 3 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀𝑆) → 𝑀𝐵)
71, 2, 3, 4cpmatel 22676 . . . . . 6 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀𝐵) → (𝑀𝑆 ↔ ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g𝑅)))
873expa 1119 . . . . 5 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀𝐵) → (𝑀𝑆 ↔ ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g𝑅)))
98biimpd 229 . . . 4 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀𝐵) → (𝑀𝑆 → ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g𝑅)))
109impancom 451 . . 3 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀𝑆) → (𝑀𝐵 → ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g𝑅)))
116, 10jcai 516 . 2 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀𝑆) → (𝑀𝐵 ∧ ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g𝑅)))
1211ex 412 1 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑀𝑆 → (𝑀𝐵 ∧ ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g𝑅))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wral 3051  cfv 6498  (class class class)co 7367  Fincfn 8893  cn 12174  Basecbs 17179  0gc0g 17402  Ringcrg 20214  Poly1cpl1 22140  coe1cco1 22141   Mat cmat 22372   ConstPolyMat ccpmat 22668
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 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-sbc 3729  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-iota 6454  df-fun 6500  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-cpmat 22671
This theorem is referenced by:  cpmatmcllem  22683  m2cpminvid2lem  22719
  Copyright terms: Public domain W3C validator