| 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 7456 | . . . 4 ⊢ (𝐺 sSet 〈(Scalar‘ndx), ℤring〉) ∈ V | |
| 2 | zlmvsca.2 | . . . . 5 ⊢ · = (.g‘𝐺) | |
| 3 | 2 | fvexi 6902 | . . . 4 ⊢ · ∈ V |
| 4 | vscaid 17398 | . . . . 5 ⊢ ·𝑠 = Slot ( ·𝑠 ‘ndx) | |
| 5 | 4 | setsid 17292 | . . . 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 21702 | . . . 4 ⊢ (𝐺 ∈ V → 𝑊 = ((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), · 〉)) |
| 9 | 8 | fveq2d 6892 | . . 3 ⊢ (𝐺 ∈ V → ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), · 〉))) |
| 10 | 6, 9 | eqtr4id 2820 | . 2 ⊢ (𝐺 ∈ V → · = ( ·𝑠 ‘𝑊)) |
| 11 | 4 | str0 17274 | . . 3 ⊢ ∅ = ( ·𝑠 ‘∅) |
| 12 | fvprc 6880 | . . . 4 ⊢ (¬ 𝐺 ∈ V → (.g‘𝐺) = ∅) | |
| 13 | 2, 12 | eqtrid 2813 | . . 3 ⊢ (¬ 𝐺 ∈ V → · = ∅) |
| 14 | fvprc 6880 | . . . . 5 ⊢ (¬ 𝐺 ∈ V → (ℤMod‘𝐺) = ∅) | |
| 15 | 7, 14 | eqtrid 2813 | . . . 4 ⊢ (¬ 𝐺 ∈ V → 𝑊 = ∅) |
| 16 | 15 | fveq2d 6892 | . . 3 ⊢ (¬ 𝐺 ∈ V → ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘∅)) |
| 17 | 11, 13, 16 | 3eqtr4a 2827 | . 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 2146 Vcvv 3458 ∅c0 4289 〈cop 4600 ‘cfv 6543 (class class class)co 7423 sSet csts 17248 ndxcnx 17278 Scalarcsca 17338 ·𝑠 cvsca 17339 .gcmg 19164 ℤringczring 21633 ℤModczlm 21687 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-cnex 11174 ax-1cn 11176 ax-addcl 11178 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7426 df-oprab 7427 df-mpo 7428 df-om 7872 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 df-nn 12252 df-2 12321 df-3 12322 df-4 12323 df-5 12324 df-6 12325 df-sets 17249 df-slot 17267 df-ndx 17279 df-vsca 17352 df-zlm 21691 |
| This theorem is used by: zlmlmod 21709 zlmassa 22090 clmzlmvsca 25309 nmmulg 34387 cnzh 34389 rezh 34390 |
| Copyright terms: Public domain | W3C validator |