| 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 3472 | . . 3 ⊢ (𝐺 ∈ 𝑉 → 𝐺 ∈ V) | |
| 3 | oveq1 7427 | . . . . 5 ⊢ (𝑔 = 𝐺 → (𝑔 sSet 〈(Scalar‘ndx), ℤring〉) = (𝐺 sSet 〈(Scalar‘ndx), ℤring〉)) | |
| 4 | fveq2 6885 | . . . . . . 7 ⊢ (𝑔 = 𝐺 → (.g‘𝑔) = (.g‘𝐺)) | |
| 5 | zlmval.m | . . . . . . 7 ⊢ · = (.g‘𝐺) | |
| 6 | 4, 5 | eqtr4di 2814 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (.g‘𝑔) = · ) |
| 7 | 6 | opeq2d 4840 | . . . . 5 ⊢ (𝑔 = 𝐺 → 〈( ·𝑠 ‘ndx), (.g‘𝑔)〉 = 〈( ·𝑠 ‘ndx), · 〉) |
| 8 | 3, 7 | oveq12d 7438 | . . . 4 ⊢ (𝑔 = 𝐺 → ((𝑔 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝑔)〉) = ((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), · 〉)) |
| 9 | df-zlm 21810 | . . . 4 ⊢ ℤMod = (𝑔 ∈ V ↦ ((𝑔 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝑔)〉)) | |
| 10 | ovex 7453 | . . . 4 ⊢ ((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), · 〉) ∈ V | |
| 11 | 8, 9, 10 | fvmpt 6993 | . . 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 2808 | 1 ⊢ (𝐺 ∈ 𝑉 → 𝑊 = ((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), · 〉)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 Vcvv 3451 〈cop 4590 ‘cfv 6538 (class class class)co 7420 sSet csts 17341 ndxcnx 17371 Scalarcsca 17431 ·𝑠 cvsca 17432 .gcmg 19277 ℤringczring 21752 ℤModczlm 21806 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-iota 6494 df-fun 6540 df-fv 6546 df-ov 7423 df-zlm 21810 |
| This theorem is used by: zlmlem 21822 zlmsca 21826 zlmvsca 21827 zlmds 34594 zlmtset 34595 |
| Copyright terms: Public domain | W3C validator |