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

Theorem cpmatelimp 22599
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 22597 . . . 4 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀𝑆) → 𝑀𝐵)
653expa 1118 . . 3 (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀𝑆) → 𝑀𝐵)
71, 2, 3, 4cpmatel 22598 . . . . . 6 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀𝐵) → (𝑀𝑆 ↔ ∀𝑖𝑁𝑗𝑁𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g𝑅)))
873expa 1118 . . . . 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 1540  wcel 2109  wral 3044  cfv 6511  (class class class)co 7387  Fincfn 8918  cn 12186  Basecbs 17179  0gc0g 17402  Ringcrg 20142  Poly1cpl1 22061  coe1cco1 22062   Mat cmat 22294   ConstPolyMat ccpmat 22590
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-iota 6464  df-fun 6513  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-cpmat 22593
This theorem is referenced by:  cpmatmcllem  22605  m2cpminvid2lem  22641
  Copyright terms: Public domain W3C validator