| 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 2196 | . . . . . . . 8 ⊢ (.r‘𝐹) = (.r‘𝐹) | |
| 8 | eqid 2196 | . . . . . . . 8 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
| 9 | 1, 2, 3, 4, 5, 6, 7, 8 | lmodlema 13924 | . . . . . . 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 2167 ‘cfv 5259 (class class class)co 5925 Basecbs 12703 +gcplusg 12780 .rcmulr 12781 Scalarcsca 12783 ·𝑠 cvsca 12784 1rcur 13591 LModclmod 13919 |
| 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 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-sep 4152 ax-pow 4208 ax-pr 4243 ax-un 4469 ax-cnex 7987 ax-resscn 7988 ax-1re 7990 ax-addrcl 7993 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ral 2480 df-rex 2481 df-rab 2484 df-v 2765 df-sbc 2990 df-un 3161 df-in 3163 df-ss 3170 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-uni 3841 df-int 3876 df-br 4035 df-opab 4096 df-mpt 4097 df-id 4329 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-rn 4675 df-res 4676 df-iota 5220 df-fun 5261 df-fn 5262 df-fv 5267 df-ov 5928 df-inn 9008 df-2 9066 df-3 9067 df-4 9068 df-5 9069 df-6 9070 df-ndx 12706 df-slot 12707 df-base 12709 df-plusg 12793 df-mulr 12794 df-sca 12796 df-vsca 12797 df-lmod 13921 |
| This theorem is referenced by: lmod0vs 13953 lmodvsmmulgdi 13955 lmodvneg1 13962 lmodcom 13965 lmodsubdir 13977 islss3 14011 lss1d 14015 |
| Copyright terms: Public domain | W3C validator |