| 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 2734 | . . 3 ⊢ (LSubSp‘𝑊) = (LSubSp‘𝑊) | |
| 2 | lspsn.n | . . 3 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 3 | simpl 482 | . . 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 20905 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)} ∈ (LSubSp‘𝑊)) |
| 9 | eqid 2734 | . . . . . 6 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
| 10 | 5, 7, 9 | lmod1cl 20831 | . . . . 5 ⊢ (𝑊 ∈ LMod → (1r‘𝐹) ∈ 𝐾) |
| 11 | 4, 5, 6, 9 | lmodvs1 20832 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → ((1r‘𝐹) · 𝑋) = 𝑋) |
| 12 | 11 | eqcomd 2740 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → 𝑋 = ((1r‘𝐹) · 𝑋)) |
| 13 | oveq1 7406 | . . . . . 6 ⊢ (𝑘 = (1r‘𝐹) → (𝑘 · 𝑋) = ((1r‘𝐹) · 𝑋)) | |
| 14 | 13 | rspceeqv 3622 | . . . . 5 ⊢ (((1r‘𝐹) ∈ 𝐾 ∧ 𝑋 = ((1r‘𝐹) · 𝑋)) → ∃𝑘 ∈ 𝐾 𝑋 = (𝑘 · 𝑋)) |
| 15 | 10, 12, 14 | syl2an2r 685 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → ∃𝑘 ∈ 𝐾 𝑋 = (𝑘 · 𝑋)) |
| 16 | eqeq1 2738 | . . . . . . 7 ⊢ (𝑣 = 𝑋 → (𝑣 = (𝑘 · 𝑋) ↔ 𝑋 = (𝑘 · 𝑋))) | |
| 17 | 16 | rexbidv 3162 | . . . . . 6 ⊢ (𝑣 = 𝑋 → (∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋) ↔ ∃𝑘 ∈ 𝐾 𝑋 = (𝑘 · 𝑋))) |
| 18 | 17 | elabg 3653 | . . . . 5 ⊢ (𝑋 ∈ 𝑉 → (𝑋 ∈ {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)} ↔ ∃𝑘 ∈ 𝐾 𝑋 = (𝑘 · 𝑋))) |
| 19 | 18 | adantl 481 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑋 ∈ {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)} ↔ ∃𝑘 ∈ 𝐾 𝑋 = (𝑘 · 𝑋))) |
| 20 | 15, 19 | mpbird 257 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)}) |
| 21 | 1, 2, 3, 8, 20 | ellspsn5 20938 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{𝑋}) ⊆ {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)}) |
| 22 | 3 | adantr 480 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → 𝑊 ∈ LMod) |
| 23 | 4, 1, 2 | lspsncl 20919 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{𝑋}) ∈ (LSubSp‘𝑊)) |
| 24 | 23 | adantr 480 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → (𝑁‘{𝑋}) ∈ (LSubSp‘𝑊)) |
| 25 | simpr 484 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → 𝑘 ∈ 𝐾) | |
| 26 | 4, 2 | lspsnid 20935 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ (𝑁‘{𝑋})) |
| 27 | 26 | adantr 480 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → 𝑋 ∈ (𝑁‘{𝑋})) |
| 28 | 5, 6, 7, 1 | lssvscl 20897 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ (𝑁‘{𝑋}) ∈ (LSubSp‘𝑊)) ∧ (𝑘 ∈ 𝐾 ∧ 𝑋 ∈ (𝑁‘{𝑋}))) → (𝑘 · 𝑋) ∈ (𝑁‘{𝑋})) |
| 29 | 22, 24, 25, 27, 28 | syl22anc 838 | . . . . 5 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → (𝑘 · 𝑋) ∈ (𝑁‘{𝑋})) |
| 30 | eleq1a 2828 | . . . . 5 ⊢ ((𝑘 · 𝑋) ∈ (𝑁‘{𝑋}) → (𝑣 = (𝑘 · 𝑋) → 𝑣 ∈ (𝑁‘{𝑋}))) | |
| 31 | 29, 30 | syl 17 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → (𝑣 = (𝑘 · 𝑋) → 𝑣 ∈ (𝑁‘{𝑋}))) |
| 32 | 31 | rexlimdva 3139 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋) → 𝑣 ∈ (𝑁‘{𝑋}))) |
| 33 | 32 | abssdv 4041 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)} ⊆ (𝑁‘{𝑋})) |
| 34 | 21, 33 | eqssd 3974 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{𝑋}) = {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1539 ∈ wcel 2107 {cab 2712 ∃wrex 3059 {csn 4599 ‘cfv 6527 (class class class)co 7399 Basecbs 17213 Scalarcsca 17259 ·𝑠 cvsca 17260 1rcur 20126 LModclmod 20802 LSubSpclss 20873 LSpanclspn 20913 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2706 ax-rep 5246 ax-sep 5263 ax-nul 5273 ax-pow 5332 ax-pr 5399 ax-un 7723 ax-cnex 11177 ax-resscn 11178 ax-1cn 11179 ax-icn 11180 ax-addcl 11181 ax-addrcl 11182 ax-mulcl 11183 ax-mulrcl 11184 ax-mulcom 11185 ax-addass 11186 ax-mulass 11187 ax-distr 11188 ax-i2m1 11189 ax-1ne0 11190 ax-1rid 11191 ax-rnegex 11192 ax-rrecex 11193 ax-cnre 11194 ax-pre-lttri 11195 ax-pre-lttrn 11196 ax-pre-ltadd 11197 ax-pre-mulgt0 11198 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2808 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3357 df-reu 3358 df-rab 3414 df-v 3459 df-sbc 3764 df-csb 3873 df-dif 3927 df-un 3929 df-in 3931 df-ss 3941 df-pss 3944 df-nul 4307 df-if 4499 df-pw 4575 df-sn 4600 df-pr 4602 df-op 4606 df-uni 4881 df-int 4920 df-iun 4966 df-br 5117 df-opab 5179 df-mpt 5199 df-tr 5227 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6287 df-ord 6352 df-on 6353 df-lim 6354 df-suc 6355 df-iota 6480 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-riota 7356 df-ov 7402 df-oprab 7403 df-mpo 7404 df-om 7856 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8379 df-rdg 8418 df-er 8713 df-en 8954 df-dom 8955 df-sdom 8956 df-pnf 11263 df-mnf 11264 df-xr 11265 df-ltxr 11266 df-le 11267 df-sub 11460 df-neg 11461 df-nn 12233 df-2 12295 df-sets 17168 df-slot 17186 df-ndx 17198 df-base 17214 df-plusg 17269 df-0g 17440 df-mgm 18603 df-sgrp 18682 df-mnd 18698 df-grp 18904 df-minusg 18905 df-sbg 18906 df-mgp 20086 df-ur 20127 df-ring 20180 df-lmod 20804 df-lss 20874 df-lsp 20914 |
| This theorem is referenced by: ellspsn 20945 rnascl 21836 ldual1dim 39105 dia1dim2 41002 dib1dim2 41108 diclspsn 41134 dih1dimatlem 41269 rnasclg 42447 prjspeclsp 42560 |
| Copyright terms: Public domain | W3C validator |