| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > zlmvsca | Structured version Visualization version GIF version | ||
| Description: Scalar multiplication operation of a ℤ-module. (Contributed by Mario Carneiro, 2-Oct-2015.) |
| Ref | Expression |
|---|---|
| zlmbas.w | ⊢ 𝑊 = (ℤMod‘𝐺) |
| zlmvsca.2 | ⊢ · = (.g‘𝐺) |
| Ref | Expression |
|---|---|
| zlmvsca | ⊢ · = ( ·𝑠 ‘𝑊) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ovex 7450 | . . . 4 ⊢ (𝐺 sSet 〈(Scalar‘ndx), ℤring〉) ∈ V | |
| 2 | zlmvsca.2 | . . . . 5 ⊢ · = (.g‘𝐺) | |
| 3 | 2 | fvexi 6896 | . . . 4 ⊢ · ∈ V |
| 4 | vscaid 17411 | . . . . 5 ⊢ ·𝑠 = Slot ( ·𝑠 ‘ndx) | |
| 5 | 4 | setsid 17305 | . . . 4 ⊢ (((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) ∈ V ∧ · ∈ V) → · = ( ·𝑠 ‘((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), · 〉))) |
| 6 | 1, 3, 5 | mp2an 705 | . . 3 ⊢ · = ( ·𝑠 ‘((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), · 〉)) |
| 7 | zlmbas.w | . . . . 5 ⊢ 𝑊 = (ℤMod‘𝐺) | |
| 8 | 7, 2 | zlmval 21734 | . . . 4 ⊢ (𝐺 ∈ V → 𝑊 = ((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), · 〉)) |
| 9 | 8 | fveq2d 6886 | . . 3 ⊢ (𝐺 ∈ V → ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), · 〉))) |
| 10 | 6, 9 | eqtr4id 2816 | . 2 ⊢ (𝐺 ∈ V → · = ( ·𝑠 ‘𝑊)) |
| 11 | 4 | str0 17287 | . . 3 ⊢ ∅ = ( ·𝑠 ‘∅) |
| 12 | fvprc 6874 | . . . 4 ⊢ (¬ 𝐺 ∈ V → (.g‘𝐺) = ∅) | |
| 13 | 2, 12 | eqtrid 2809 | . . 3 ⊢ (¬ 𝐺 ∈ V → · = ∅) |
| 14 | fvprc 6874 | . . . . 5 ⊢ (¬ 𝐺 ∈ V → (ℤMod‘𝐺) = ∅) | |
| 15 | 7, 14 | eqtrid 2809 | . . . 4 ⊢ (¬ 𝐺 ∈ V → 𝑊 = ∅) |
| 16 | 15 | fveq2d 6886 | . . 3 ⊢ (¬ 𝐺 ∈ V → ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘∅)) |
| 17 | 11, 13, 16 | 3eqtr4a 2823 | . 2 ⊢ (¬ 𝐺 ∈ V → · = ( ·𝑠 ‘𝑊)) |
| 18 | 10, 17 | pm2.61i 184 | 1 ⊢ · = ( ·𝑠 ‘𝑊) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 = wceq 1570 ∈ wcel 2145 Vcvv 3453 ∅c0 4282 〈cop 4593 ‘cfv 6537 (class class class)co 7417 sSet csts 17261 ndxcnx 17291 Scalarcsca 17351 ·𝑠 cvsca 17352 .gcmg 19196 ℤringczring 21665 ℤModczlm 21719 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-cnex 11184 ax-1cn 11186 ax-addcl 11188 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7867 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-nn 12262 df-2 12331 df-3 12332 df-4 12333 df-5 12334 df-6 12335 df-sets 17262 df-slot 17280 df-ndx 17292 df-vsca 17365 df-zlm 21723 |
| This theorem is used by: zlmlmod 21741 zlmassa 22124 clmzlmvsca 25347 nmmulg 34484 cnzh 34486 rezh 34487 |
| Copyright terms: Public domain | W3C validator |