| 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 14315 | . . . . . 6 ⊢ (𝑊 ∈ LMod → 𝐹 ∈ Ring) |
| 4 | 1, 3 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ Ring) |
| 5 | ringgrp 14020 | . . . . 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 14039 | . . . . 5 ⊢ (𝐹 ∈ Ring → (1r‘𝐹) ∈ 𝐾) |
| 10 | 4, 9 | syl 14 | . . . 4 ⊢ (𝜑 → (1r‘𝐹) ∈ 𝐾) |
| 11 | lmodvsneg.m | . . . . 5 ⊢ 𝑀 = (invg‘𝐹) | |
| 12 | 7, 11 | grpinvcl 13636 | . . . 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 14333 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ ((𝑀‘(1r‘𝐹)) ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵)) → (((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) · 𝑋) = ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋))) |
| 20 | 1, 13, 14, 15, 19 | syl13anc 1275 | . 2 ⊢ (𝜑 → (((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) · 𝑋) = ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋))) |
| 21 | 7, 18, 8, 11, 4, 14 | ringnegl 14070 | . . 3 ⊢ (𝜑 → ((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) = (𝑀‘𝑅)) |
| 22 | 21 | oveq1d 6033 | . 2 ⊢ (𝜑 → (((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) · 𝑋) = ((𝑀‘𝑅) · 𝑋)) |
| 23 | 16, 2, 17, 7 | lmodvscl 14325 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · 𝑋) ∈ 𝐵) |
| 24 | 1, 14, 15, 23 | syl3anc 1273 | . . 3 ⊢ (𝜑 → (𝑅 · 𝑋) ∈ 𝐵) |
| 25 | lmodvsneg.n | . . . 4 ⊢ 𝑁 = (invg‘𝑊) | |
| 26 | 16, 25, 2, 17, 8, 11 | lmodvneg1 14350 | . . 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 1397 ∈ wcel 2202 ‘cfv 5326 (class class class)co 6018 Basecbs 13087 .rcmulr 13166 Scalarcsca 13168 ·𝑠 cvsca 13169 Grpcgrp 13588 invgcminusg 13589 1rcur 13978 Ringcrg 14015 LModclmod 14307 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-addcom 8132 ax-addass 8134 ax-i2m1 8137 ax-0lt1 8138 ax-0id 8140 ax-rnegex 8141 ax-pre-ltirr 8144 ax-pre-ltadd 8148 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-pnf 8216 df-mnf 8217 df-ltxr 8219 df-inn 9144 df-2 9202 df-3 9203 df-4 9204 df-5 9205 df-6 9206 df-ndx 13090 df-slot 13091 df-base 13093 df-sets 13094 df-plusg 13178 df-mulr 13179 df-sca 13181 df-vsca 13182 df-0g 13346 df-mgm 13444 df-sgrp 13490 df-mnd 13505 df-grp 13591 df-minusg 13592 df-mgp 13940 df-ur 13979 df-ring 14017 df-lmod 14309 |
| This theorem is referenced by: lmodnegadd 14356 |
| Copyright terms: Public domain | W3C validator |