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

Theorem zlmval 21836
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 3475 . . 3 (𝐺 ∈ 𝑉 → 𝐺 ∈ V)
3 oveq1 7437 . . . . 5 (𝑔 = 𝐺 → (𝑔 sSet ⟨(Scalar‘ndx), ℤring⟩) = (𝐺 sSet ⟨(Scalar‘ndx), ℤring⟩))
4 fveq2 6896 . . . . . . 7 (𝑔 = 𝐺 → (.g‘𝑔) = (.g‘𝐺))
5 zlmval.m . . . . . . 7 · = (.g‘𝐺)
64, 5eqtr4di 2816 . . . . . 6 (𝑔 = 𝐺 → (.g‘𝑔) = · )
76opeq2d 4850 . . . . 5 (𝑔 = 𝐺 → ⟨( ·𝑠 ‘ndx), (.g‘𝑔)⟩ = ⟨( ·𝑠 ‘ndx), · ⟩)
83, 7oveq12d 7448 . . . 4 (𝑔 = 𝐺 → ((𝑔 sSet ⟨(Scalar‘ndx), ℤring⟩) sSet ⟨( ·𝑠 ‘ndx), (.g‘𝑔)⟩) = ((𝐺 sSet ⟨(Scalar‘ndx), ℤring⟩) sSet ⟨( ·𝑠 ‘ndx), · ⟩))
9 df-zlm 21825 . . . 4 ℤMod = (𝑔 ∈ V ↦ ((𝑔 sSet ⟨(Scalar‘ndx), ℤring⟩) sSet ⟨( ·𝑠 ‘ndx), (.g‘𝑔)⟩))
10 ovex 7463 . . . 4 ((𝐺 sSet ⟨(Scalar‘ndx), ℤring⟩) sSet ⟨( ·𝑠 ‘ndx), · ⟩) ∈ V
118, 9, 10fvmpt 7004 . . 3 (𝐺 ∈ V → (ℤMod‘𝐺) = ((𝐺 sSet ⟨(Scalar‘ndx), ℤring⟩) sSet ⟨( ·𝑠 ‘ndx), · ⟩))
122, 11syl 18 . 2 (𝐺 ∈ 𝑉 → (ℤMod‘𝐺) = ((𝐺 sSet ⟨(Scalar‘ndx), ℤring⟩) sSet ⟨( ·𝑠 ‘ndx), · ⟩))
131, 12eqtrid 2810 1 (𝐺 ∈ 𝑉 → 𝑊 = ((𝐺 sSet ⟨(Scalar‘ndx), ℤring⟩) sSet ⟨( ·𝑠 ‘ndx), · ⟩))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2146  Vcvv 3454  ⟨cop 4838  ‘cfv 6547  (class class class)co 7430   sSet csts 17356  ndxcnx 17386  Scalarcsca 17446   ·𝑠 cvsca 17447  .gcmg 19292  ℤringczring 21767  ℤModczlm 21821
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6501  df-fun 6549  df-fv 6555  df-ov 7433  df-zlm 21825
This theorem is used by:  zlmlem  21837  zlmsca  21841  zlmvsca  21842  zlmds  34650  zlmtset  34651
  Copyright terms: Public domain W3C validator