| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lspsn | Structured version Visualization version GIF version | ||
| Description: Span of the singleton of a vector. (Contributed by NM, 14-Jan-2014.) (Proof shortened by Mario Carneiro, 19-Jun-2014.) |
| Ref | Expression |
|---|---|
| lspsn.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| lspsn.k | ⊢ 𝐾 = (Base‘𝐹) |
| lspsn.v | ⊢ 𝑉 = (Base‘𝑊) |
| lspsn.t | ⊢ · = ( ·𝑠 ‘𝑊) |
| lspsn.n | ⊢ 𝑁 = (LSpan‘𝑊) |
| Ref | Expression |
|---|---|
| lspsn | ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{𝑋}) = {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2765 | . . 3 ⊢ (LSubSp‘𝑊) = (LSubSp‘𝑊) | |
| 2 | lspsn.n | . . 3 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 3 | simpl 487 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → 𝑊 ∈ LMod) | |
| 4 | lspsn.v | . . . 4 ⊢ 𝑉 = (Base‘𝑊) | |
| 5 | lspsn.f | . . . 4 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 6 | lspsn.t | . . . 4 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 7 | lspsn.k | . . . 4 ⊢ 𝐾 = (Base‘𝐹) | |
| 8 | 4, 5, 6, 7, 1 | lss1d 21053 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)} ∈ (LSubSp‘𝑊)) |
| 9 | eqid 2765 | . . . . . 6 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
| 10 | 5, 7, 9 | lmod1cl 20979 | . . . . 5 ⊢ (𝑊 ∈ LMod → (1r‘𝐹) ∈ 𝐾) |
| 11 | 4, 5, 6, 9 | lmodvs1 20980 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → ((1r‘𝐹) · 𝑋) = 𝑋) |
| 12 | 11 | eqcomd 2771 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → 𝑋 = ((1r‘𝐹) · 𝑋)) |
| 13 | oveq1 7407 | . . . . . 6 ⊢ (𝑘 = (1r‘𝐹) → (𝑘 · 𝑋) = ((1r‘𝐹) · 𝑋)) | |
| 14 | 13 | rspceeqv 3607 | . . . . 5 ⊢ (((1r‘𝐹) ∈ 𝐾 ∧ 𝑋 = ((1r‘𝐹) · 𝑋)) → ∃𝑘 ∈ 𝐾 𝑋 = (𝑘 · 𝑋)) |
| 15 | 10, 12, 14 | syl2an2r 697 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → ∃𝑘 ∈ 𝐾 𝑋 = (𝑘 · 𝑋)) |
| 16 | eqeq1 2769 | . . . . . . 7 ⊢ (𝑣 = 𝑋 → (𝑣 = (𝑘 · 𝑋) ↔ 𝑋 = (𝑘 · 𝑋))) | |
| 17 | 16 | rexbidv 3189 | . . . . . 6 ⊢ (𝑣 = 𝑋 → (∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋) ↔ ∃𝑘 ∈ 𝐾 𝑋 = (𝑘 · 𝑋))) |
| 18 | 17 | elabg 3638 | . . . . 5 ⊢ (𝑋 ∈ 𝑉 → (𝑋 ∈ {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)} ↔ ∃𝑘 ∈ 𝐾 𝑋 = (𝑘 · 𝑋))) |
| 19 | 18 | adantl 486 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑋 ∈ {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)} ↔ ∃𝑘 ∈ 𝐾 𝑋 = (𝑘 · 𝑋))) |
| 20 | 15, 19 | mpbird 260 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)}) |
| 21 | 1, 2, 3, 8, 20 | ellspsn5 21086 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{𝑋}) ⊆ {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)}) |
| 22 | 3 | adantr 485 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → 𝑊 ∈ LMod) |
| 23 | 4, 1, 2 | lspsncl 21067 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{𝑋}) ∈ (LSubSp‘𝑊)) |
| 24 | 23 | adantr 485 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → (𝑁‘{𝑋}) ∈ (LSubSp‘𝑊)) |
| 25 | simpr 489 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → 𝑘 ∈ 𝐾) | |
| 26 | 4, 2 | lspsnid 21083 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ (𝑁‘{𝑋})) |
| 27 | 26 | adantr 485 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → 𝑋 ∈ (𝑁‘{𝑋})) |
| 28 | 5, 6, 7, 1 | lssvscl 21045 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ (𝑁‘{𝑋}) ∈ (LSubSp‘𝑊)) ∧ (𝑘 ∈ 𝐾 ∧ 𝑋 ∈ (𝑁‘{𝑋}))) → (𝑘 · 𝑋) ∈ (𝑁‘{𝑋})) |
| 29 | 22, 24, 25, 27, 28 | syl22anc 851 | . . . . 5 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → (𝑘 · 𝑋) ∈ (𝑁‘{𝑋})) |
| 30 | eleq1a 2860 | . . . . 5 ⊢ ((𝑘 · 𝑋) ∈ (𝑁‘{𝑋}) → (𝑣 = (𝑘 · 𝑋) → 𝑣 ∈ (𝑁‘{𝑋}))) | |
| 31 | 29, 30 | syl 18 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → (𝑣 = (𝑘 · 𝑋) → 𝑣 ∈ (𝑁‘{𝑋}))) |
| 32 | 31 | rexlimdva 3166 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋) → 𝑣 ∈ (𝑁‘{𝑋}))) |
| 33 | 32 | abssdv 4023 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)} ⊆ (𝑁‘{𝑋})) |
| 34 | 21, 33 | eqssd 3956 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{𝑋}) = {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1563 ∈ wcel 2145 {cab 2743 ∃wrex 3089 {csn 4585 ‘cfv 6525 (class class class)co 7400 Basecbs 17259 Scalarcsca 17303 ·𝑠 cvsca 17304 1rcur 20254 LModclmod 20950 LSubSpclss 21021 LSpanclspn 21061 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-int 4909 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-nn 12225 df-2 12294 df-sets 17214 df-slot 17232 df-ndx 17244 df-base 17260 df-plusg 17313 df-0g 17484 df-mgm 18688 df-sgrp 18767 df-mnd 18783 df-grp 18993 df-minusg 18994 df-sbg 18995 df-mgp 20208 df-ur 20255 df-ring 20308 df-lmod 20952 df-lss 21022 df-lsp 21062 |
| This theorem is referenced by: ellspsn 21093 rnascl 22001 ldual1dim 39802 dia1dim2 41698 dib1dim2 41804 diclspsn 41830 dih1dimatlem 41965 rnasclg 43133 prjspeclsp 43206 |
| Copyright terms: Public domain | W3C validator |