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 2821 | . . 3 ⊢ (LSubSp‘𝑊) = (LSubSp‘𝑊) | |
2 | lspsn.n | . . 3 ⊢ 𝑁 = (LSpan‘𝑊) | |
3 | simpl 485 | . . 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 19729 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)} ∈ (LSubSp‘𝑊)) |
9 | eqid 2821 | . . . . . 6 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
10 | 5, 7, 9 | lmod1cl 19655 | . . . . 5 ⊢ (𝑊 ∈ LMod → (1r‘𝐹) ∈ 𝐾) |
11 | 4, 5, 6, 9 | lmodvs1 19656 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → ((1r‘𝐹) · 𝑋) = 𝑋) |
12 | 11 | eqcomd 2827 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → 𝑋 = ((1r‘𝐹) · 𝑋)) |
13 | oveq1 7157 | . . . . . 6 ⊢ (𝑘 = (1r‘𝐹) → (𝑘 · 𝑋) = ((1r‘𝐹) · 𝑋)) | |
14 | 13 | rspceeqv 3638 | . . . . 5 ⊢ (((1r‘𝐹) ∈ 𝐾 ∧ 𝑋 = ((1r‘𝐹) · 𝑋)) → ∃𝑘 ∈ 𝐾 𝑋 = (𝑘 · 𝑋)) |
15 | 10, 12, 14 | syl2an2r 683 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → ∃𝑘 ∈ 𝐾 𝑋 = (𝑘 · 𝑋)) |
16 | eqeq1 2825 | . . . . . . 7 ⊢ (𝑣 = 𝑋 → (𝑣 = (𝑘 · 𝑋) ↔ 𝑋 = (𝑘 · 𝑋))) | |
17 | 16 | rexbidv 3297 | . . . . . 6 ⊢ (𝑣 = 𝑋 → (∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋) ↔ ∃𝑘 ∈ 𝐾 𝑋 = (𝑘 · 𝑋))) |
18 | 17 | elabg 3666 | . . . . 5 ⊢ (𝑋 ∈ 𝑉 → (𝑋 ∈ {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)} ↔ ∃𝑘 ∈ 𝐾 𝑋 = (𝑘 · 𝑋))) |
19 | 18 | adantl 484 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑋 ∈ {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)} ↔ ∃𝑘 ∈ 𝐾 𝑋 = (𝑘 · 𝑋))) |
20 | 15, 19 | mpbird 259 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)}) |
21 | 1, 2, 3, 8, 20 | lspsnel5a 19762 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{𝑋}) ⊆ {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)}) |
22 | 3 | adantr 483 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → 𝑊 ∈ LMod) |
23 | 4, 1, 2 | lspsncl 19743 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{𝑋}) ∈ (LSubSp‘𝑊)) |
24 | 23 | adantr 483 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → (𝑁‘{𝑋}) ∈ (LSubSp‘𝑊)) |
25 | simpr 487 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → 𝑘 ∈ 𝐾) | |
26 | 4, 2 | lspsnid 19759 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ (𝑁‘{𝑋})) |
27 | 26 | adantr 483 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → 𝑋 ∈ (𝑁‘{𝑋})) |
28 | 5, 6, 7, 1 | lssvscl 19721 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ (𝑁‘{𝑋}) ∈ (LSubSp‘𝑊)) ∧ (𝑘 ∈ 𝐾 ∧ 𝑋 ∈ (𝑁‘{𝑋}))) → (𝑘 · 𝑋) ∈ (𝑁‘{𝑋})) |
29 | 22, 24, 25, 27, 28 | syl22anc 836 | . . . . 5 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → (𝑘 · 𝑋) ∈ (𝑁‘{𝑋})) |
30 | eleq1a 2908 | . . . . 5 ⊢ ((𝑘 · 𝑋) ∈ (𝑁‘{𝑋}) → (𝑣 = (𝑘 · 𝑋) → 𝑣 ∈ (𝑁‘{𝑋}))) | |
31 | 29, 30 | syl 17 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → (𝑣 = (𝑘 · 𝑋) → 𝑣 ∈ (𝑁‘{𝑋}))) |
32 | 31 | rexlimdva 3284 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋) → 𝑣 ∈ (𝑁‘{𝑋}))) |
33 | 32 | abssdv 4045 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)} ⊆ (𝑁‘{𝑋})) |
34 | 21, 33 | eqssd 3984 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{𝑋}) = {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 ∈ wcel 2110 {cab 2799 ∃wrex 3139 {csn 4561 ‘cfv 6350 (class class class)co 7150 Basecbs 16477 Scalarcsca 16562 ·𝑠 cvsca 16563 1rcur 19245 LModclmod 19628 LSubSpclss 19697 LSpanclspn 19737 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-rep 5183 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4833 df-int 4870 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-tr 5166 df-id 5455 df-eprel 5460 df-po 5469 df-so 5470 df-fr 5509 df-we 5511 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-pred 6143 df-ord 6189 df-on 6190 df-lim 6191 df-suc 6192 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-2 11694 df-ndx 16480 df-slot 16481 df-base 16483 df-sets 16484 df-plusg 16572 df-0g 16709 df-mgm 17846 df-sgrp 17895 df-mnd 17906 df-grp 18100 df-minusg 18101 df-sbg 18102 df-mgp 19234 df-ur 19246 df-ring 19293 df-lmod 19630 df-lss 19698 df-lsp 19738 |
This theorem is referenced by: lspsnel 19769 rnascl 20114 ldual1dim 36296 dia1dim2 38192 dib1dim2 38298 diclspsn 38324 dih1dimatlem 38459 rnasclg 39124 prjspeclsp 39255 |
Copyright terms: Public domain | W3C validator |