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

Theorem zlmval 21717
Description: Augment an abelian group with vector space operations to turn it into a -module. (Contributed by Mario Carneiro, 2-Oct-2015.) (Revised by AV, 12-Jun-2019.)
Hypotheses
Ref Expression
zlmval.w 𝑊 = (ℤMod‘𝐺)
zlmval.m · = (.g𝐺)
Assertion
Ref Expression
zlmval (𝐺𝑉𝑊 = ((𝐺 sSet ⟨(Scalar‘ndx), ℤring⟩) sSet ⟨( ·𝑠 ‘ndx), · ⟩))

Proof of Theorem zlmval
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 zlmval.w . 2 𝑊 = (ℤMod‘𝐺)
2 elex 3478 . . 3 (𝐺𝑉𝐺 ∈ V)
3 oveq1 7426 . . . . 5 (𝑔 = 𝐺 → (𝑔 sSet ⟨(Scalar‘ndx), ℤring⟩) = (𝐺 sSet ⟨(Scalar‘ndx), ℤring⟩))
4 fveq2 6885 . . . . . . 7 (𝑔 = 𝐺 → (.g𝑔) = (.g𝐺))
5 zlmval.m . . . . . . 7 · = (.g𝐺)
64, 5eqtr4di 2818 . . . . . 6 (𝑔 = 𝐺 → (.g𝑔) = · )
76opeq2d 4847 . . . . 5 (𝑔 = 𝐺 → ⟨( ·𝑠 ‘ndx), (.g𝑔)⟩ = ⟨( ·𝑠 ‘ndx), · ⟩)
83, 7oveq12d 7437 . . . 4 (𝑔 = 𝐺 → ((𝑔 sSet ⟨(Scalar‘ndx), ℤring⟩) sSet ⟨( ·𝑠 ‘ndx), (.g𝑔)⟩) = ((𝐺 sSet ⟨(Scalar‘ndx), ℤring⟩) sSet ⟨( ·𝑠 ‘ndx), · ⟩))
9 df-zlm 21706 . . . 4 ℤMod = (𝑔 ∈ V ↦ ((𝑔 sSet ⟨(Scalar‘ndx), ℤring⟩) sSet ⟨( ·𝑠 ‘ndx), (.g𝑔)⟩))
10 ovex 7452 . . . 4 ((𝐺 sSet ⟨(Scalar‘ndx), ℤring⟩) sSet ⟨( ·𝑠 ‘ndx), · ⟩) ∈ V
118, 9, 10fvmpt 6993 . . 3 (𝐺 ∈ V → (ℤMod‘𝐺) = ((𝐺 sSet ⟨(Scalar‘ndx), ℤring⟩) sSet ⟨( ·𝑠 ‘ndx), · ⟩))
122, 11syl 18 . 2 (𝐺𝑉 → (ℤMod‘𝐺) = ((𝐺 sSet ⟨(Scalar‘ndx), ℤring⟩) sSet ⟨( ·𝑠 ‘ndx), · ⟩))
131, 12eqtrid 2812 1 (𝐺𝑉𝑊 = ((𝐺 sSet ⟨(Scalar‘ndx), ℤring⟩) sSet ⟨( ·𝑠 ‘ndx), · ⟩))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  wcel 2146  Vcvv 3457  cop 4597  cfv 6540  (class class class)co 7419   sSet csts 17247  ndxcnx 17277  Scalarcsca 17337   ·𝑠 cvsca 17338  .gcmg 19179  ringczring 21648  ℤModczlm 21702
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6496  df-fun 6542  df-fv 6548  df-ov 7422  df-zlm 21706
This theorem is used by:  zlmlem  21718  zlmsca  21722  zlmvsca  21723  zlmds  34418  zlmtset  34419
  Copyright terms: Public domain W3C validator