| 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 7453 | . . . 4 ⊢ (𝐺 sSet 〈(Scalar‘ndx), ℤring〉) ∈ V | |
| 2 | zlmvsca.2 | . . . . 5 ⊢ · = (.g‘𝐺) | |
| 3 | 2 | fvexi 6899 | . . . 4 ⊢ · ∈ V |
| 4 | vscaid 17496 | . . . . 5 ⊢ ·𝑠 = Slot ( ·𝑠 ‘ndx) | |
| 5 | 4 | setsid 17390 | . . . 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 21826 | . . . 4 ⊢ (𝐺 ∈ V → 𝑊 = ((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), · 〉)) |
| 9 | 8 | fveq2d 6889 | . . 3 ⊢ (𝐺 ∈ V → ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), · 〉))) |
| 10 | 6, 9 | eqtr4id 2814 | . 2 ⊢ (𝐺 ∈ V → · = ( ·𝑠 ‘𝑊)) |
| 11 | 4 | str0 17372 | . . 3 ⊢ ∅ = ( ·𝑠 ‘∅) |
| 12 | fvprc 6877 | . . . 4 ⊢ (¬ 𝐺 ∈ V → (.g‘𝐺) = ∅) | |
| 13 | 2, 12 | eqtrid 2807 | . . 3 ⊢ (¬ 𝐺 ∈ V → · = ∅) |
| 14 | fvprc 6877 | . . . . 5 ⊢ (¬ 𝐺 ∈ V → (ℤMod‘𝐺) = ∅) | |
| 15 | 7, 14 | eqtrid 2807 | . . . 4 ⊢ (¬ 𝐺 ∈ V → 𝑊 = ∅) |
| 16 | 15 | fveq2d 6889 | . . 3 ⊢ (¬ 𝐺 ∈ V → ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘∅)) |
| 17 | 11, 13, 16 | 3eqtr4a 2821 | . 2 ⊢ (¬ 𝐺 ∈ V → · = ( ·𝑠 ‘𝑊)) |
| 18 | 10, 17 | pm2.61i 184 | 1 ⊢ · = ( ·𝑠 ‘𝑊) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 = wceq 1569 ∈ wcel 2144 Vcvv 3450 ∅c0 4278 〈cop 4834 ‘cfv 6538 (class class class)co 7420 sSet csts 17346 ndxcnx 17376 Scalarcsca 17436 ·𝑠 cvsca 17437 .gcmg 19282 ℤringczring 21757 ℤModczlm 21811 |
| 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 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11259 ax-1cn 11261 ax-addcl 11263 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-2nd 8002 df-frecs 8302 df-wrecs 8333 df-recs 8382 df-rdg 8421 df-nn 12339 df-2 12408 df-3 12409 df-4 12410 df-5 12411 df-6 12412 df-sets 17347 df-slot 17365 df-ndx 17377 df-vsca 17450 df-zlm 21815 |
| This theorem is used by: zlmlmod 21833 zlmassa 22216 clmzlmvsca 25439 nmmulg 34644 cnzh 34646 rezh 34647 |
| Copyright terms: Public domain | W3C validator |