![]() |
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 13628 | . . . . . 6 ⊢ (𝑊 ∈ LMod → 𝐹 ∈ Ring) |
4 | 1, 3 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ Ring) |
5 | ringgrp 13372 | . . . . 5 ⊢ (𝐹 ∈ Ring → 𝐹 ∈ Grp) | |
6 | 4, 5 | syl 14 | . . . 4 ⊢ (𝜑 → 𝐹 ∈ Grp) |
7 | lmodvsneg.k | . . . . . 6 ⊢ 𝐾 = (Base‘𝐹) | |
8 | eqid 2189 | . . . . . 6 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
9 | 7, 8 | ringidcl 13391 | . . . . 5 ⊢ (𝐹 ∈ Ring → (1r‘𝐹) ∈ 𝐾) |
10 | 4, 9 | syl 14 | . . . 4 ⊢ (𝜑 → (1r‘𝐹) ∈ 𝐾) |
11 | lmodvsneg.m | . . . . 5 ⊢ 𝑀 = (invg‘𝐹) | |
12 | 7, 11 | grpinvcl 13007 | . . . 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 2189 | . . . 4 ⊢ (.r‘𝐹) = (.r‘𝐹) | |
19 | 16, 2, 17, 7, 18 | lmodvsass 13646 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ ((𝑀‘(1r‘𝐹)) ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵)) → (((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) · 𝑋) = ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋))) |
20 | 1, 13, 14, 15, 19 | syl13anc 1251 | . 2 ⊢ (𝜑 → (((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) · 𝑋) = ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋))) |
21 | 7, 18, 8, 11, 4, 14 | ringnegl 13420 | . . 3 ⊢ (𝜑 → ((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) = (𝑀‘𝑅)) |
22 | 21 | oveq1d 5912 | . 2 ⊢ (𝜑 → (((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) · 𝑋) = ((𝑀‘𝑅) · 𝑋)) |
23 | 16, 2, 17, 7 | lmodvscl 13638 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · 𝑋) ∈ 𝐵) |
24 | 1, 14, 15, 23 | syl3anc 1249 | . . 3 ⊢ (𝜑 → (𝑅 · 𝑋) ∈ 𝐵) |
25 | lmodvsneg.n | . . . 4 ⊢ 𝑁 = (invg‘𝑊) | |
26 | 16, 25, 2, 17, 8, 11 | lmodvneg1 13663 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑅 · 𝑋) ∈ 𝐵) → ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋)) = (𝑁‘(𝑅 · 𝑋))) |
27 | 1, 24, 26 | syl2anc 411 | . 2 ⊢ (𝜑 → ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋)) = (𝑁‘(𝑅 · 𝑋))) |
28 | 20, 22, 27 | 3eqtr3rd 2231 | 1 ⊢ (𝜑 → (𝑁‘(𝑅 · 𝑋)) = ((𝑀‘𝑅) · 𝑋)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1364 ∈ wcel 2160 ‘cfv 5235 (class class class)co 5897 Basecbs 12515 .rcmulr 12593 Scalarcsca 12595 ·𝑠 cvsca 12596 Grpcgrp 12960 invgcminusg 12961 1rcur 13330 Ringcrg 13367 LModclmod 13620 |
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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2162 ax-14 2163 ax-ext 2171 ax-coll 4133 ax-sep 4136 ax-pow 4192 ax-pr 4227 ax-un 4451 ax-setind 4554 ax-cnex 7933 ax-resscn 7934 ax-1cn 7935 ax-1re 7936 ax-icn 7937 ax-addcl 7938 ax-addrcl 7939 ax-mulcl 7940 ax-addcom 7942 ax-addass 7944 ax-i2m1 7947 ax-0lt1 7948 ax-0id 7950 ax-rnegex 7951 ax-pre-ltirr 7954 ax-pre-ltadd 7958 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ne 2361 df-nel 2456 df-ral 2473 df-rex 2474 df-reu 2475 df-rmo 2476 df-rab 2477 df-v 2754 df-sbc 2978 df-csb 3073 df-dif 3146 df-un 3148 df-in 3150 df-ss 3157 df-nul 3438 df-pw 3592 df-sn 3613 df-pr 3614 df-op 3616 df-uni 3825 df-int 3860 df-iun 3903 df-br 4019 df-opab 4080 df-mpt 4081 df-id 4311 df-xp 4650 df-rel 4651 df-cnv 4652 df-co 4653 df-dm 4654 df-rn 4655 df-res 4656 df-ima 4657 df-iota 5196 df-fun 5237 df-fn 5238 df-f 5239 df-f1 5240 df-fo 5241 df-f1o 5242 df-fv 5243 df-riota 5852 df-ov 5900 df-oprab 5901 df-mpo 5902 df-pnf 8025 df-mnf 8026 df-ltxr 8028 df-inn 8951 df-2 9009 df-3 9010 df-4 9011 df-5 9012 df-6 9013 df-ndx 12518 df-slot 12519 df-base 12521 df-sets 12522 df-plusg 12605 df-mulr 12606 df-sca 12608 df-vsca 12609 df-0g 12766 df-mgm 12835 df-sgrp 12880 df-mnd 12893 df-grp 12963 df-minusg 12964 df-mgp 13292 df-ur 13331 df-ring 13369 df-lmod 13622 |
This theorem is referenced by: lmodnegadd 13669 |
Copyright terms: Public domain | W3C validator |