| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > zlmval | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| zlmval.w | ⊢ 𝑊 = (ℤMod‘𝐺) |
| zlmval.m | ⊢ · = (.g‘𝐺) |
| Ref | Expression |
|---|---|
| zlmval | ⊢ (𝐺 ∈ 𝑉 → 𝑊 = ((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), · 〉)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | zlmval.w | . 2 ⊢ 𝑊 = (ℤMod‘𝐺) | |
| 2 | elex 3475 | . . 3 ⊢ (𝐺 ∈ 𝑉 → 𝐺 ∈ V) | |
| 3 | oveq1 7458 | . . . . 5 ⊢ (𝑔 = 𝐺 → (𝑔 sSet 〈(Scalar‘ndx), ℤring〉) = (𝐺 sSet 〈(Scalar‘ndx), ℤring〉)) | |
| 4 | fveq2 6916 | . . . . . . 7 ⊢ (𝑔 = 𝐺 → (.g‘𝑔) = (.g‘𝐺)) | |
| 5 | zlmval.m | . . . . . . 7 ⊢ · = (.g‘𝐺) | |
| 6 | 4, 5 | eqtr4di 2816 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (.g‘𝑔) = · ) |
| 7 | 6 | opeq2d 4852 | . . . . 5 ⊢ (𝑔 = 𝐺 → 〈( ·𝑠 ‘ndx), (.g‘𝑔)〉 = 〈( ·𝑠 ‘ndx), · 〉) |
| 8 | 3, 7 | oveq12d 7469 | . . . 4 ⊢ (𝑔 = 𝐺 → ((𝑔 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝑔)〉) = ((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), · 〉)) |
| 9 | df-zlm 21865 | . . . 4 ⊢ ℤMod = (𝑔 ∈ V ↦ ((𝑔 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝑔)〉)) | |
| 10 | ovex 7484 | . . . 4 ⊢ ((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), · 〉) ∈ V | |
| 11 | 8, 9, 10 | fvmpt 7024 | . . 3 ⊢ (𝐺 ∈ V → (ℤMod‘𝐺) = ((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), · 〉)) |
| 12 | 2, 11 | syl 18 | . 2 ⊢ (𝐺 ∈ 𝑉 → (ℤMod‘𝐺) = ((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), · 〉)) |
| 13 | 1, 12 | eqtrid 2810 | 1 ⊢ (𝐺 ∈ 𝑉 → 𝑊 = ((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), · 〉)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 Vcvv 3454 〈cop 4840 ‘cfv 6566 (class class class)co 7451 sSet csts 17385 ndxcnx 17415 Scalarcsca 17475 ·𝑠 cvsca 17476 .gcmg 19327 ℤringczring 21806 ℤModczlm 21861 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pr 5398 |
| 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 2102 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 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-iota 6520 df-fun 6568 df-fv 6574 df-ov 7454 df-zlm 21865 |
| This theorem is used by: zlmlem 21877 zlmsca 21881 zlmvsca 21882 zlmds 34705 zlmtset 34706 |
| Copyright terms: Public domain | W3C validator |