| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lmodsca | Structured version Visualization version GIF version | ||
| Description: The set of scalars of a constructed left vector space. (Contributed by Mario Carneiro, 2-Oct-2013.) (Revised by Mario Carneiro, 29-Aug-2015.) |
| Ref | Expression |
|---|---|
| lmodstr.w | ⊢ 𝑊 = ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(Scalar‘ndx), 𝐹〉} ∪ {〈( ·𝑠 ‘ndx), · 〉}) |
| Ref | Expression |
|---|---|
| lmodsca | ⊢ (𝐹 ∈ 𝑋 → 𝐹 = (Scalar‘𝑊)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lmodstr.w | . . 3 ⊢ 𝑊 = ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(Scalar‘ndx), 𝐹〉} ∪ {〈( ·𝑠 ‘ndx), · 〉}) | |
| 2 | 1 | lmodstr 17413 | . 2 ⊢ 𝑊 Struct 〈1, 6〉 |
| 3 | scaid 17403 | . 2 ⊢ Scalar = Slot (Scalar‘ndx) | |
| 4 | snsstp3 4779 | . . 3 ⊢ {〈(Scalar‘ndx), 𝐹〉} ⊆ {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(Scalar‘ndx), 𝐹〉} | |
| 5 | ssun1 4124 | . . . 4 ⊢ {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(Scalar‘ndx), 𝐹〉} ⊆ ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(Scalar‘ndx), 𝐹〉} ∪ {〈( ·𝑠 ‘ndx), · 〉}) | |
| 6 | 5, 1 | sseqtrri 3980 | . . 3 ⊢ {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(Scalar‘ndx), 𝐹〉} ⊆ 𝑊 |
| 7 | 4, 6 | sstri 3940 | . 2 ⊢ {〈(Scalar‘ndx), 𝐹〉} ⊆ 𝑊 |
| 8 | 2, 3, 7 | strfv 17298 | 1 ⊢ (𝐹 ∈ 𝑋 → 𝐹 = (Scalar‘𝑊)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ∪ cun 3897 {csn 4584 {ctp 4588 〈cop 4590 ‘cfv 6533 1c1 11128 6c6 12326 ndxcnx 17288 Basecbs 17304 +gcplusg 17345 Scalarcsca 17348 ·𝑠 cvsca 17349 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-1o 8458 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-nn 12261 df-2 12330 df-3 12331 df-4 12332 df-5 12333 df-6 12334 df-n0 12532 df-z 12619 df-uz 12891 df-fz 13565 df-struct 17242 df-slot 17277 df-ndx 17289 df-base 17305 df-plusg 17358 df-sca 17361 df-vsca 17362 |
| This theorem is used by: cnlmodlem3 25369 cnstrcvs 25372 ldualsca 40008 dvasca 41882 dvhsca 41958 lmod1lem3 49422 lmod1lem4 49423 lmod1lem5 49424 lmod1 49425 lmod1zrnlvec 49427 |
| Copyright terms: Public domain | W3C validator |