| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lmodvsneg | GIF version | ||
| Description: Multiplication of a vector by a negated scalar. (Contributed by Stefan O'Rear, 28-Feb-2015.) |
| Ref | Expression |
|---|---|
| lmodvsneg.b | ⊢ 𝐵 = (Base‘𝑊) |
| lmodvsneg.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| lmodvsneg.s | ⊢ · = ( ·𝑠 ‘𝑊) |
| lmodvsneg.n | ⊢ 𝑁 = (invg‘𝑊) |
| lmodvsneg.k | ⊢ 𝐾 = (Base‘𝐹) |
| lmodvsneg.m | ⊢ 𝑀 = (invg‘𝐹) |
| lmodvsneg.w | ⊢ (𝜑 → 𝑊 ∈ LMod) |
| lmodvsneg.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| lmodvsneg.r | ⊢ (𝜑 → 𝑅 ∈ 𝐾) |
| Ref | Expression |
|---|---|
| lmodvsneg | ⊢ (𝜑 → (𝑁‘(𝑅 · 𝑋)) = ((𝑀‘𝑅) · 𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lmodvsneg.w | . . 3 ⊢ (𝜑 → 𝑊 ∈ LMod) | |
| 2 | lmodvsneg.f | . . . . . . 7 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 3 | 2 | lmodring 14614 | . . . . . 6 ⊢ (𝑊 ∈ LMod → 𝐹 ∈ Ring) |
| 4 | 1, 3 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ Ring) |
| 5 | ringgrp 14288 | . . . . 5 ⊢ (𝐹 ∈ Ring → 𝐹 ∈ Grp) | |
| 6 | 4, 5 | syl 14 | . . . 4 ⊢ (𝜑 → 𝐹 ∈ Grp) |
| 7 | lmodvsneg.k | . . . . . 6 ⊢ 𝐾 = (Base‘𝐹) | |
| 8 | eqid 2238 | . . . . . 6 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
| 9 | 7, 8 | ringidcl 14308 | . . . . 5 ⊢ (𝐹 ∈ Ring → (1r‘𝐹) ∈ 𝐾) |
| 10 | 4, 9 | syl 14 | . . . 4 ⊢ (𝜑 → (1r‘𝐹) ∈ 𝐾) |
| 11 | lmodvsneg.m | . . . . 5 ⊢ 𝑀 = (invg‘𝐹) | |
| 12 | 7, 11 | grpinvcl 13836 | . . . 4 ⊢ ((𝐹 ∈ Grp ∧ (1r‘𝐹) ∈ 𝐾) → (𝑀‘(1r‘𝐹)) ∈ 𝐾) |
| 13 | 6, 10, 12 | syl2anc 415 | . . 3 ⊢ (𝜑 → (𝑀‘(1r‘𝐹)) ∈ 𝐾) |
| 14 | lmodvsneg.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ 𝐾) | |
| 15 | lmodvsneg.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 16 | lmodvsneg.b | . . . 4 ⊢ 𝐵 = (Base‘𝑊) | |
| 17 | lmodvsneg.s | . . . 4 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 18 | eqid 2238 | . . . 4 ⊢ (.r‘𝐹) = (.r‘𝐹) | |
| 19 | 16, 2, 17, 7, 18 | lmodvsass 14633 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ ((𝑀‘(1r‘𝐹)) ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵)) → (((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) · 𝑋) = ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋))) |
| 20 | 1, 13, 14, 15, 19 | syl13anc 1280 | . 2 ⊢ (𝜑 → (((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) · 𝑋) = ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋))) |
| 21 | 7, 18, 8, 11, 4, 14 | ringnegl 14339 | . . 3 ⊢ (𝜑 → ((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) = (𝑀‘𝑅)) |
| 22 | 21 | oveq1d 6094 | . 2 ⊢ (𝜑 → (((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) · 𝑋) = ((𝑀‘𝑅) · 𝑋)) |
| 23 | 16, 2, 17, 7 | lmodvscl 14624 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · 𝑋) ∈ 𝐵) |
| 24 | 1, 14, 15, 23 | syl3anc 1278 | . . 3 ⊢ (𝜑 → (𝑅 · 𝑋) ∈ 𝐵) |
| 25 | lmodvsneg.n | . . . 4 ⊢ 𝑁 = (invg‘𝑊) | |
| 26 | 16, 25, 2, 17, 8, 11 | lmodvneg1 14650 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑅 · 𝑋) ∈ 𝐵) → ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋)) = (𝑁‘(𝑅 · 𝑋))) |
| 27 | 1, 24, 26 | syl2anc 415 | . 2 ⊢ (𝜑 → ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋)) = (𝑁‘(𝑅 · 𝑋))) |
| 28 | 20, 22, 27 | 3eqtr3rd 2280 | 1 ⊢ (𝜑 → (𝑁‘(𝑅 · 𝑋)) = ((𝑀‘𝑅) · 𝑋)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1402 ∈ wcel 2209 ‘cfv 5375 (class class class)co 6079 Basecbs 13335 .rcmulr 13415 Scalarcsca 13417 ·𝑠 cvsca 13418 Grpcgrp 13788 invgcminusg 13789 1rcur 14245 Ringcrg 14283 LModclmod 14606 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4244 ax-sep 4247 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-cnex 8264 ax-resscn 8265 ax-1cn 8266 ax-1re 8267 ax-icn 8268 ax-addcl 8269 ax-addrcl 8270 ax-mulcl 8271 ax-addcom 8273 ax-addass 8275 ax-i2m1 8278 ax-0lt1 8279 ax-0id 8281 ax-rnegex 8282 ax-pre-ltirr 8285 ax-pre-ltadd 8289 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-f1 5380 df-fo 5381 df-f1o 5382 df-fv 5383 df-riota 6032 df-ov 6082 df-oprab 6083 df-mpo 6084 df-pnf 8356 df-mnf 8357 df-ltxr 8359 df-inn 9288 df-2 9346 df-3 9347 df-4 9348 df-5 9349 df-6 9350 df-ndx 13338 df-slot 13339 df-base 13341 df-sets 13342 df-plusg 13427 df-mulr 13428 df-sca 13430 df-vsca 13431 df-0g 13595 df-mgm 13659 df-sgrp 13700 df-mnd 13713 df-grp 13791 df-minusg 13792 df-mgp 14201 df-ur 14246 df-ring 14285 df-lmod 14608 |
| This theorem is referenced by: lmodnegadd 14656 |
| Copyright terms: Public domain | W3C validator |