| 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 14371 | . . . . . 6 ⊢ (𝑊 ∈ LMod → 𝐹 ∈ Ring) |
| 4 | 1, 3 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ Ring) |
| 5 | ringgrp 14076 | . . . . 5 ⊢ (𝐹 ∈ Ring → 𝐹 ∈ Grp) | |
| 6 | 4, 5 | syl 14 | . . . 4 ⊢ (𝜑 → 𝐹 ∈ Grp) |
| 7 | lmodvsneg.k | . . . . . 6 ⊢ 𝐾 = (Base‘𝐹) | |
| 8 | eqid 2231 | . . . . . 6 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
| 9 | 7, 8 | ringidcl 14095 | . . . . 5 ⊢ (𝐹 ∈ Ring → (1r‘𝐹) ∈ 𝐾) |
| 10 | 4, 9 | syl 14 | . . . 4 ⊢ (𝜑 → (1r‘𝐹) ∈ 𝐾) |
| 11 | lmodvsneg.m | . . . . 5 ⊢ 𝑀 = (invg‘𝐹) | |
| 12 | 7, 11 | grpinvcl 13692 | . . . 4 ⊢ ((𝐹 ∈ Grp ∧ (1r‘𝐹) ∈ 𝐾) → (𝑀‘(1r‘𝐹)) ∈ 𝐾) |
| 13 | 6, 10, 12 | syl2anc 411 | . . 3 ⊢ (𝜑 → (𝑀‘(1r‘𝐹)) ∈ 𝐾) |
| 14 | lmodvsneg.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ 𝐾) | |
| 15 | lmodvsneg.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 16 | lmodvsneg.b | . . . 4 ⊢ 𝐵 = (Base‘𝑊) | |
| 17 | lmodvsneg.s | . . . 4 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 18 | eqid 2231 | . . . 4 ⊢ (.r‘𝐹) = (.r‘𝐹) | |
| 19 | 16, 2, 17, 7, 18 | lmodvsass 14389 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ ((𝑀‘(1r‘𝐹)) ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵)) → (((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) · 𝑋) = ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋))) |
| 20 | 1, 13, 14, 15, 19 | syl13anc 1276 | . 2 ⊢ (𝜑 → (((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) · 𝑋) = ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋))) |
| 21 | 7, 18, 8, 11, 4, 14 | ringnegl 14126 | . . 3 ⊢ (𝜑 → ((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) = (𝑀‘𝑅)) |
| 22 | 21 | oveq1d 6043 | . 2 ⊢ (𝜑 → (((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) · 𝑋) = ((𝑀‘𝑅) · 𝑋)) |
| 23 | 16, 2, 17, 7 | lmodvscl 14381 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · 𝑋) ∈ 𝐵) |
| 24 | 1, 14, 15, 23 | syl3anc 1274 | . . 3 ⊢ (𝜑 → (𝑅 · 𝑋) ∈ 𝐵) |
| 25 | lmodvsneg.n | . . . 4 ⊢ 𝑁 = (invg‘𝑊) | |
| 26 | 16, 25, 2, 17, 8, 11 | lmodvneg1 14406 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑅 · 𝑋) ∈ 𝐵) → ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋)) = (𝑁‘(𝑅 · 𝑋))) |
| 27 | 1, 24, 26 | syl2anc 411 | . 2 ⊢ (𝜑 → ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋)) = (𝑁‘(𝑅 · 𝑋))) |
| 28 | 20, 22, 27 | 3eqtr3rd 2273 | 1 ⊢ (𝜑 → (𝑁‘(𝑅 · 𝑋)) = ((𝑀‘𝑅) · 𝑋)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2202 ‘cfv 5333 (class class class)co 6028 Basecbs 13143 .rcmulr 13222 Scalarcsca 13224 ·𝑠 cvsca 13225 Grpcgrp 13644 invgcminusg 13645 1rcur 14034 Ringcrg 14071 LModclmod 14363 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-addcom 8175 ax-addass 8177 ax-i2m1 8180 ax-0lt1 8181 ax-0id 8183 ax-rnegex 8184 ax-pre-ltirr 8187 ax-pre-ltadd 8191 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-pnf 8259 df-mnf 8260 df-ltxr 8262 df-inn 9187 df-2 9245 df-3 9246 df-4 9247 df-5 9248 df-6 9249 df-ndx 13146 df-slot 13147 df-base 13149 df-sets 13150 df-plusg 13234 df-mulr 13235 df-sca 13237 df-vsca 13238 df-0g 13402 df-mgm 13500 df-sgrp 13546 df-mnd 13561 df-grp 13647 df-minusg 13648 df-mgp 13996 df-ur 14035 df-ring 14073 df-lmod 14365 |
| This theorem is referenced by: lmodnegadd 14412 |
| Copyright terms: Public domain | W3C validator |