| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lmodvsdi | GIF version | ||
| Description: Distributive law for scalar product (left-distributivity). (Contributed by NM, 10-Jan-2014.) (Revised by Mario Carneiro, 22-Sep-2015.) |
| Ref | Expression |
|---|---|
| lmodvsdi.v | ⊢ 𝑉 = (Base‘𝑊) |
| lmodvsdi.a | ⊢ + = (+g‘𝑊) |
| lmodvsdi.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| lmodvsdi.s | ⊢ · = ( ·𝑠 ‘𝑊) |
| lmodvsdi.k | ⊢ 𝐾 = (Base‘𝐹) |
| Ref | Expression |
|---|---|
| lmodvsdi | ⊢ ((𝑊 ∈ LMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lmodvsdi.v | . . . . . . . . 9 ⊢ 𝑉 = (Base‘𝑊) | |
| 2 | lmodvsdi.a | . . . . . . . . 9 ⊢ + = (+g‘𝑊) | |
| 3 | lmodvsdi.s | . . . . . . . . 9 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 4 | lmodvsdi.f | . . . . . . . . 9 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 5 | lmodvsdi.k | . . . . . . . . 9 ⊢ 𝐾 = (Base‘𝐹) | |
| 6 | eqid 2207 | . . . . . . . . 9 ⊢ (+g‘𝐹) = (+g‘𝐹) | |
| 7 | eqid 2207 | . . . . . . . . 9 ⊢ (.r‘𝐹) = (.r‘𝐹) | |
| 8 | eqid 2207 | . . . . . . . . 9 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
| 9 | 1, 2, 3, 4, 5, 6, 7, 8 | lmodlema 14169 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑌 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌)) ∧ ((𝑅(+g‘𝐹)𝑅) · 𝑋) = ((𝑅 · 𝑋) + (𝑅 · 𝑋))) ∧ (((𝑅(.r‘𝐹)𝑅) · 𝑋) = (𝑅 · (𝑅 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋))) |
| 10 | 9 | simpld 112 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑌 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌)) ∧ ((𝑅(+g‘𝐹)𝑅) · 𝑋) = ((𝑅 · 𝑋) + (𝑅 · 𝑋)))) |
| 11 | 10 | simp2d 1013 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑌 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌))) |
| 12 | 11 | 3expia 1208 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) → ((𝑌 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉) → (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌)))) |
| 13 | 12 | anabsan2 584 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾) → ((𝑌 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉) → (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌)))) |
| 14 | 13 | exp4b 367 | . . 3 ⊢ (𝑊 ∈ LMod → (𝑅 ∈ 𝐾 → (𝑌 ∈ 𝑉 → (𝑋 ∈ 𝑉 → (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌)))))) |
| 15 | 14 | com34 83 | . 2 ⊢ (𝑊 ∈ LMod → (𝑅 ∈ 𝐾 → (𝑋 ∈ 𝑉 → (𝑌 ∈ 𝑉 → (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌)))))) |
| 16 | 15 | 3imp2 1225 | 1 ⊢ ((𝑊 ∈ LMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 981 = wceq 1373 ∈ wcel 2178 ‘cfv 5290 (class class class)co 5967 Basecbs 12947 +gcplusg 13024 .rcmulr 13025 Scalarcsca 13027 ·𝑠 cvsca 13028 1rcur 13836 LModclmod 14164 |
| 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 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2180 ax-14 2181 ax-ext 2189 ax-sep 4178 ax-pow 4234 ax-pr 4269 ax-un 4498 ax-cnex 8051 ax-resscn 8052 ax-1re 8054 ax-addrcl 8057 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ral 2491 df-rex 2492 df-rab 2495 df-v 2778 df-sbc 3006 df-un 3178 df-in 3180 df-ss 3187 df-pw 3628 df-sn 3649 df-pr 3650 df-op 3652 df-uni 3865 df-int 3900 df-br 4060 df-opab 4122 df-mpt 4123 df-id 4358 df-xp 4699 df-rel 4700 df-cnv 4701 df-co 4702 df-dm 4703 df-rn 4704 df-res 4705 df-iota 5251 df-fun 5292 df-fn 5293 df-fv 5298 df-ov 5970 df-inn 9072 df-2 9130 df-3 9131 df-4 9132 df-5 9133 df-6 9134 df-ndx 12950 df-slot 12951 df-base 12953 df-plusg 13037 df-mulr 13038 df-sca 13040 df-vsca 13041 df-lmod 14166 |
| This theorem is referenced by: lmodcom 14210 lmodsubdi 14221 islss3 14256 |
| Copyright terms: Public domain | W3C validator |