| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lmodvscl | GIF version | ||
| Description: Closure of scalar product for a left module. (Contributed by NM, 8-Dec-2013.) (Revised by Mario Carneiro, 19-Jun-2014.) |
| Ref | Expression |
|---|---|
| lmodvscl.v | ⊢ 𝑉 = (Base‘𝑊) |
| lmodvscl.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| lmodvscl.s | ⊢ · = ( ·𝑠 ‘𝑊) |
| lmodvscl.k | ⊢ 𝐾 = (Base‘𝐹) |
| Ref | Expression |
|---|---|
| lmodvscl | ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉) → (𝑅 · 𝑋) ∈ 𝑉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | biid 171 | . 2 ⊢ (𝑊 ∈ LMod ↔ 𝑊 ∈ LMod) | |
| 2 | pm4.24 395 | . 2 ⊢ (𝑅 ∈ 𝐾 ↔ (𝑅 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) | |
| 3 | pm4.24 395 | . 2 ⊢ (𝑋 ∈ 𝑉 ↔ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) | |
| 4 | lmodvscl.v | . . . . 5 ⊢ 𝑉 = (Base‘𝑊) | |
| 5 | eqid 2234 | . . . . 5 ⊢ (+g‘𝑊) = (+g‘𝑊) | |
| 6 | lmodvscl.s | . . . . 5 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 7 | lmodvscl.f | . . . . 5 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 8 | lmodvscl.k | . . . . 5 ⊢ 𝐾 = (Base‘𝐹) | |
| 9 | eqid 2234 | . . . . 5 ⊢ (+g‘𝐹) = (+g‘𝐹) | |
| 10 | eqid 2234 | . . . . 5 ⊢ (.r‘𝐹) = (.r‘𝐹) | |
| 11 | eqid 2234 | . . . . 5 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
| 12 | 4, 5, 6, 7, 8, 9, 10, 11 | lmodlema 14489 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋(+g‘𝑊)𝑋)) = ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · 𝑋)) ∧ ((𝑅(+g‘𝐹)𝑅) · 𝑋) = ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · 𝑋))) ∧ (((𝑅(.r‘𝐹)𝑅) · 𝑋) = (𝑅 · (𝑅 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋))) |
| 13 | 12 | simpld 112 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋(+g‘𝑊)𝑋)) = ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · 𝑋)) ∧ ((𝑅(+g‘𝐹)𝑅) · 𝑋) = ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · 𝑋)))) |
| 14 | 13 | simp1d 1036 | . 2 ⊢ ((𝑊 ∈ LMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (𝑅 · 𝑋) ∈ 𝑉) |
| 15 | 1, 2, 3, 14 | syl3anb 1317 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉) → (𝑅 · 𝑋) ∈ 𝑉) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1005 = wceq 1398 ∈ wcel 2205 ‘cfv 5354 (class class class)co 6052 Basecbs 13233 +gcplusg 13311 .rcmulr 13312 Scalarcsca 13314 ·𝑠 cvsca 13315 1rcur 14124 LModclmod 14484 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-sep 4230 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-cnex 8223 ax-resscn 8224 ax-1re 8226 ax-addrcl 8229 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ral 2527 df-rex 2528 df-rab 2531 df-v 2817 df-sbc 3045 df-un 3217 df-in 3219 df-ss 3226 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-int 3952 df-br 4112 df-opab 4174 df-mpt 4175 df-id 4416 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-iota 5314 df-fun 5356 df-fn 5357 df-fv 5362 df-ov 6055 df-inn 9243 df-2 9301 df-3 9302 df-4 9303 df-5 9304 df-6 9305 df-ndx 13236 df-slot 13237 df-base 13239 df-plusg 13324 df-mulr 13325 df-sca 13327 df-vsca 13328 df-lmod 14486 |
| This theorem is referenced by: lmodscaf 14507 lmod0vs 14518 lmodvsmmulgdi 14520 lcomf 14524 lmodvneg1 14527 lmodvsneg 14528 lmodnegadd 14533 lmodsubvs 14540 lmodsubdi 14541 lmodsubdir 14542 lmodprop2d 14545 lss1 14559 lssvsubcl 14563 lssvscl 14572 lss1d 14580 |
| Copyright terms: Public domain | W3C validator |