| 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 7445 | . . . 4 ⊢ (𝐺 sSet 〈(Scalar‘ndx), ℤring〉) ∈ V | |
| 2 | zlmvsca.2 | . . . . 5 ⊢ · = (.g‘𝐺) | |
| 3 | 2 | fvexi 6891 | . . . 4 ⊢ · ∈ V |
| 4 | vscaid 17471 | . . . . 5 ⊢ ·𝑠 = Slot ( ·𝑠 ‘ndx) | |
| 5 | 4 | setsid 17365 | . . . 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 21801 | . . . 4 ⊢ (𝐺 ∈ V → 𝑊 = ((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), · 〉)) |
| 9 | 8 | fveq2d 6881 | . . 3 ⊢ (𝐺 ∈ V → ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), · 〉))) |
| 10 | 6, 9 | eqtr4id 2815 | . 2 ⊢ (𝐺 ∈ V → · = ( ·𝑠 ‘𝑊)) |
| 11 | 4 | str0 17347 | . . 3 ⊢ ∅ = ( ·𝑠 ‘∅) |
| 12 | fvprc 6869 | . . . 4 ⊢ (¬ 𝐺 ∈ V → (.g‘𝐺) = ∅) | |
| 13 | 2, 12 | eqtrid 2808 | . . 3 ⊢ (¬ 𝐺 ∈ V → · = ∅) |
| 14 | fvprc 6869 | . . . . 5 ⊢ (¬ 𝐺 ∈ V → (ℤMod‘𝐺) = ∅) | |
| 15 | 7, 14 | eqtrid 2808 | . . . 4 ⊢ (¬ 𝐺 ∈ V → 𝑊 = ∅) |
| 16 | 15 | fveq2d 6881 | . . 3 ⊢ (¬ 𝐺 ∈ V → ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘∅)) |
| 17 | 11, 13, 16 | 3eqtr4a 2822 | . 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 3451 ∅c0 4279 〈cop 4590 ‘cfv 6531 (class class class)co 7412 sSet csts 17321 ndxcnx 17351 Scalarcsca 17411 ·𝑠 cvsca 17412 .gcmg 19257 ℤringczring 21732 ℤModczlm 21786 |
| 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-pow 5327 ax-pr 5391 ax-un 7740 ax-cnex 11237 ax-1cn 11239 ax-addcl 11241 |
| 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 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-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-nn 12317 df-2 12386 df-3 12387 df-4 12388 df-5 12389 df-6 12390 df-sets 17322 df-slot 17340 df-ndx 17352 df-vsca 17425 df-zlm 21790 |
| This theorem is used by: zlmlmod 21808 zlmassa 22191 clmzlmvsca 25414 nmmulg 34580 cnzh 34582 rezh 34583 |
| Copyright terms: Public domain | W3C validator |