| 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 2206 | . . . . . . . 8 ⊢ (.r‘𝐹) = (.r‘𝐹) | |
| 8 | eqid 2206 | . . . . . . . 8 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
| 9 | 1, 2, 3, 4, 5, 6, 7, 8 | lmodlema 14098 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋 + 𝑋)) = ((𝑅 · 𝑋) + (𝑅 · 𝑋)) ∧ ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) ∧ (((𝑄(.r‘𝐹)𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋))) |
| 10 | 9 | simpld 112 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋 + 𝑋)) = ((𝑅 · 𝑋) + (𝑅 · 𝑋)) ∧ ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋)))) |
| 11 | 10 | simp3d 1014 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) |
| 12 | 11 | 3expa 1206 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) |
| 13 | 12 | anabsan2 584 | . . 3 ⊢ (((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ 𝑋 ∈ 𝑉) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) |
| 14 | 13 | exp42 371 | . 2 ⊢ (𝑊 ∈ LMod → (𝑄 ∈ 𝐾 → (𝑅 ∈ 𝐾 → (𝑋 ∈ 𝑉 → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋)))))) |
| 15 | 14 | 3imp2 1225 | 1 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 981 = wceq 1373 ∈ wcel 2177 ‘cfv 5276 (class class class)co 5951 Basecbs 12876 +gcplusg 12953 .rcmulr 12954 Scalarcsca 12956 ·𝑠 cvsca 12957 1rcur 13765 LModclmod 14093 |
| 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 2179 ax-14 2180 ax-ext 2188 ax-sep 4166 ax-pow 4222 ax-pr 4257 ax-un 4484 ax-cnex 8023 ax-resscn 8024 ax-1re 8026 ax-addrcl 8029 |
| 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 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ral 2490 df-rex 2491 df-rab 2494 df-v 2775 df-sbc 3000 df-un 3171 df-in 3173 df-ss 3180 df-pw 3619 df-sn 3640 df-pr 3641 df-op 3643 df-uni 3853 df-int 3888 df-br 4048 df-opab 4110 df-mpt 4111 df-id 4344 df-xp 4685 df-rel 4686 df-cnv 4687 df-co 4688 df-dm 4689 df-rn 4690 df-res 4691 df-iota 5237 df-fun 5278 df-fn 5279 df-fv 5284 df-ov 5954 df-inn 9044 df-2 9102 df-3 9103 df-4 9104 df-5 9105 df-6 9106 df-ndx 12879 df-slot 12880 df-base 12882 df-plusg 12966 df-mulr 12967 df-sca 12969 df-vsca 12970 df-lmod 14095 |
| This theorem is referenced by: lmod0vs 14127 lmodvsmmulgdi 14129 lmodvneg1 14136 lmodcom 14139 lmodsubdir 14151 islss3 14185 lss1d 14189 |
| Copyright terms: Public domain | W3C validator |