| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lssvscl | GIF version | ||
| Description: Closure of scalar product in a subspace. (Contributed by NM, 11-Jan-2014.) (Revised by Mario Carneiro, 19-Jun-2014.) |
| Ref | Expression |
|---|---|
| lssvscl.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| lssvscl.t | ⊢ · = ( ·𝑠 ‘𝑊) |
| lssvscl.b | ⊢ 𝐵 = (Base‘𝐹) |
| lssvscl.s | ⊢ 𝑆 = (LSubSp‘𝑊) |
| Ref | Expression |
|---|---|
| lssvscl | ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈)) → (𝑋 · 𝑌) ∈ 𝑈) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpll 527 | . . 3 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈)) → 𝑊 ∈ LMod) | |
| 2 | simprl 531 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈)) → 𝑋 ∈ 𝐵) | |
| 3 | simplr 529 | . . . . 5 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈)) → 𝑈 ∈ 𝑆) | |
| 4 | simprr 533 | . . . . 5 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈)) → 𝑌 ∈ 𝑈) | |
| 5 | eqid 2232 | . . . . . 6 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
| 6 | lssvscl.s | . . . . . 6 ⊢ 𝑆 = (LSubSp‘𝑊) | |
| 7 | 5, 6 | lsselg 14509 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆 ∧ 𝑌 ∈ 𝑈) → 𝑌 ∈ (Base‘𝑊)) |
| 8 | 1, 3, 4, 7 | syl3anc 1274 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈)) → 𝑌 ∈ (Base‘𝑊)) |
| 9 | lssvscl.f | . . . . 5 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 10 | lssvscl.t | . . . . 5 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 11 | lssvscl.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐹) | |
| 12 | 5, 9, 10, 11 | lmodvscl 14453 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ (Base‘𝑊)) → (𝑋 · 𝑌) ∈ (Base‘𝑊)) |
| 13 | 1, 2, 8, 12 | syl3anc 1274 | . . 3 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈)) → (𝑋 · 𝑌) ∈ (Base‘𝑊)) |
| 14 | eqid 2232 | . . . 4 ⊢ (+g‘𝑊) = (+g‘𝑊) | |
| 15 | eqid 2232 | . . . 4 ⊢ (0g‘𝑊) = (0g‘𝑊) | |
| 16 | 5, 14, 15 | lmod0vrid 14467 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑋 · 𝑌) ∈ (Base‘𝑊)) → ((𝑋 · 𝑌)(+g‘𝑊)(0g‘𝑊)) = (𝑋 · 𝑌)) |
| 17 | 1, 13, 16 | syl2anc 411 | . 2 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈)) → ((𝑋 · 𝑌)(+g‘𝑊)(0g‘𝑊)) = (𝑋 · 𝑌)) |
| 18 | 15, 6 | lss0cl 14517 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → (0g‘𝑊) ∈ 𝑈) |
| 19 | 18 | adantr 276 | . . 3 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈)) → (0g‘𝑊) ∈ 𝑈) |
| 20 | 9, 11, 14, 10, 6 | lssclg 14512 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈 ∧ (0g‘𝑊) ∈ 𝑈)) → ((𝑋 · 𝑌)(+g‘𝑊)(0g‘𝑊)) ∈ 𝑈) |
| 21 | 1, 3, 2, 4, 19, 20 | syl113anc 1286 | . 2 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈)) → ((𝑋 · 𝑌)(+g‘𝑊)(0g‘𝑊)) ∈ 𝑈) |
| 22 | 17, 21 | eqeltrrd 2310 | 1 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈)) → (𝑋 · 𝑌) ∈ 𝑈) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2203 ‘cfv 5352 (class class class)co 6050 Basecbs 13212 +gcplusg 13290 Scalarcsca 13293 ·𝑠 cvsca 13294 0gc0g 13469 LModclmod 14435 LSubSpclss 14500 |
| 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-in1 619 ax-in2 620 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 2205 ax-14 2206 ax-ext 2214 ax-coll 4225 ax-sep 4228 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-cnex 8218 ax-resscn 8219 ax-1cn 8220 ax-1re 8221 ax-icn 8222 ax-addcl 8223 ax-addrcl 8224 ax-mulcl 8225 ax-addcom 8227 ax-addass 8229 ax-i2m1 8232 ax-0lt1 8233 ax-0id 8235 ax-rnegex 8236 ax-pre-ltirr 8239 ax-pre-ltadd 8243 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rmo 2528 df-rab 2529 df-v 2815 df-sbc 3043 df-csb 3139 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-nul 3509 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-int 3950 df-iun 3993 df-br 4110 df-opab 4172 df-mpt 4173 df-id 4414 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-rn 4760 df-res 4761 df-ima 4762 df-iota 5312 df-fun 5354 df-fn 5355 df-f 5356 df-f1 5357 df-fo 5358 df-f1o 5359 df-fv 5360 df-riota 6003 df-ov 6053 df-oprab 6054 df-mpo 6055 df-1st 6334 df-2nd 6335 df-pnf 8310 df-mnf 8311 df-ltxr 8313 df-inn 9238 df-2 9296 df-3 9297 df-4 9298 df-5 9299 df-6 9300 df-ndx 13215 df-slot 13216 df-base 13218 df-sets 13219 df-plusg 13303 df-mulr 13304 df-sca 13306 df-vsca 13307 df-0g 13471 df-mgm 13569 df-sgrp 13615 df-mnd 13630 df-grp 13716 df-minusg 13717 df-sbg 13718 df-mgp 14065 df-ur 14104 df-ring 14142 df-lmod 14437 df-lssm 14501 |
| This theorem is referenced by: lssvnegcl 14524 islss3 14527 islss4 14530 lspsneli 14563 lspsn 14564 |
| Copyright terms: Public domain | W3C validator |