![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > lmodvsdir | GIF version |
Description: Distributive law for scalar product (right-distributivity). (Contributed by NM, 10-Jan-2014.) (Revised by Mario Carneiro, 22-Sep-2015.) |
Ref | Expression |
---|---|
lmodvsdir.v | ⊢ 𝑉 = (Base‘𝑊) |
lmodvsdir.a | ⊢ + = (+g‘𝑊) |
lmodvsdir.f | ⊢ 𝐹 = (Scalar‘𝑊) |
lmodvsdir.s | ⊢ · = ( ·𝑠 ‘𝑊) |
lmodvsdir.k | ⊢ 𝐾 = (Base‘𝐹) |
lmodvsdir.p | ⊢ ⨣ = (+g‘𝐹) |
Ref | Expression |
---|---|
lmodvsdir | ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | lmodvsdir.v | . . . . . . . 8 ⊢ 𝑉 = (Base‘𝑊) | |
2 | lmodvsdir.a | . . . . . . . 8 ⊢ + = (+g‘𝑊) | |
3 | lmodvsdir.s | . . . . . . . 8 ⊢ · = ( ·𝑠 ‘𝑊) | |
4 | lmodvsdir.f | . . . . . . . 8 ⊢ 𝐹 = (Scalar‘𝑊) | |
5 | lmodvsdir.k | . . . . . . . 8 ⊢ 𝐾 = (Base‘𝐹) | |
6 | lmodvsdir.p | . . . . . . . 8 ⊢ ⨣ = (+g‘𝐹) | |
7 | eqid 2193 | . . . . . . . 8 ⊢ (.r‘𝐹) = (.r‘𝐹) | |
8 | eqid 2193 | . . . . . . . 8 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
9 | 1, 2, 3, 4, 5, 6, 7, 8 | lmodlema 13791 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋 + 𝑋)) = ((𝑅 · 𝑋) + (𝑅 · 𝑋)) ∧ ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) ∧ (((𝑄(.r‘𝐹)𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋))) |
10 | 9 | simpld 112 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋 + 𝑋)) = ((𝑅 · 𝑋) + (𝑅 · 𝑋)) ∧ ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋)))) |
11 | 10 | simp3d 1013 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) |
12 | 11 | 3expa 1205 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) |
13 | 12 | anabsan2 584 | . . 3 ⊢ (((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ 𝑋 ∈ 𝑉) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) |
14 | 13 | exp42 371 | . 2 ⊢ (𝑊 ∈ LMod → (𝑄 ∈ 𝐾 → (𝑅 ∈ 𝐾 → (𝑋 ∈ 𝑉 → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋)))))) |
15 | 14 | 3imp2 1224 | 1 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 980 = wceq 1364 ∈ wcel 2164 ‘cfv 5255 (class class class)co 5919 Basecbs 12621 +gcplusg 12698 .rcmulr 12699 Scalarcsca 12701 ·𝑠 cvsca 12702 1rcur 13458 LModclmod 13786 |
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-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 2166 ax-14 2167 ax-ext 2175 ax-sep 4148 ax-pow 4204 ax-pr 4239 ax-un 4465 ax-cnex 7965 ax-resscn 7966 ax-1re 7968 ax-addrcl 7971 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ral 2477 df-rex 2478 df-rab 2481 df-v 2762 df-sbc 2987 df-un 3158 df-in 3160 df-ss 3167 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-int 3872 df-br 4031 df-opab 4092 df-mpt 4093 df-id 4325 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-res 4672 df-iota 5216 df-fun 5257 df-fn 5258 df-fv 5263 df-ov 5922 df-inn 8985 df-2 9043 df-3 9044 df-4 9045 df-5 9046 df-6 9047 df-ndx 12624 df-slot 12625 df-base 12627 df-plusg 12711 df-mulr 12712 df-sca 12714 df-vsca 12715 df-lmod 13788 |
This theorem is referenced by: lmod0vs 13820 lmodvsmmulgdi 13822 lmodvneg1 13829 lmodcom 13832 lmodsubdir 13844 islss3 13878 lss1d 13882 |
Copyright terms: Public domain | W3C validator |