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 2759 | . . 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 19804 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)} ∈ (LSubSp‘𝑊)) |
9 | eqid 2759 | . . . . . 6 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
10 | 5, 7, 9 | lmod1cl 19730 | . . . . 5 ⊢ (𝑊 ∈ LMod → (1r‘𝐹) ∈ 𝐾) |
11 | 4, 5, 6, 9 | lmodvs1 19731 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → ((1r‘𝐹) · 𝑋) = 𝑋) |
12 | 11 | eqcomd 2765 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → 𝑋 = ((1r‘𝐹) · 𝑋)) |
13 | oveq1 7158 | . . . . . 6 ⊢ (𝑘 = (1r‘𝐹) → (𝑘 · 𝑋) = ((1r‘𝐹) · 𝑋)) | |
14 | 13 | rspceeqv 3557 | . . . . 5 ⊢ (((1r‘𝐹) ∈ 𝐾 ∧ 𝑋 = ((1r‘𝐹) · 𝑋)) → ∃𝑘 ∈ 𝐾 𝑋 = (𝑘 · 𝑋)) |
15 | 10, 12, 14 | syl2an2r 685 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → ∃𝑘 ∈ 𝐾 𝑋 = (𝑘 · 𝑋)) |
16 | eqeq1 2763 | . . . . . . 7 ⊢ (𝑣 = 𝑋 → (𝑣 = (𝑘 · 𝑋) ↔ 𝑋 = (𝑘 · 𝑋))) | |
17 | 16 | rexbidv 3222 | . . . . . 6 ⊢ (𝑣 = 𝑋 → (∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋) ↔ ∃𝑘 ∈ 𝐾 𝑋 = (𝑘 · 𝑋))) |
18 | 17 | elabg 3588 | . . . . 5 ⊢ (𝑋 ∈ 𝑉 → (𝑋 ∈ {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)} ↔ ∃𝑘 ∈ 𝐾 𝑋 = (𝑘 · 𝑋))) |
19 | 18 | adantl 486 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑋 ∈ {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)} ↔ ∃𝑘 ∈ 𝐾 𝑋 = (𝑘 · 𝑋))) |
20 | 15, 19 | mpbird 260 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)}) |
21 | 1, 2, 3, 8, 20 | lspsnel5a 19837 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{𝑋}) ⊆ {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)}) |
22 | 3 | adantr 485 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → 𝑊 ∈ LMod) |
23 | 4, 1, 2 | lspsncl 19818 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{𝑋}) ∈ (LSubSp‘𝑊)) |
24 | 23 | adantr 485 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → (𝑁‘{𝑋}) ∈ (LSubSp‘𝑊)) |
25 | simpr 489 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → 𝑘 ∈ 𝐾) | |
26 | 4, 2 | lspsnid 19834 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ (𝑁‘{𝑋})) |
27 | 26 | adantr 485 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → 𝑋 ∈ (𝑁‘{𝑋})) |
28 | 5, 6, 7, 1 | lssvscl 19796 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ (𝑁‘{𝑋}) ∈ (LSubSp‘𝑊)) ∧ (𝑘 ∈ 𝐾 ∧ 𝑋 ∈ (𝑁‘{𝑋}))) → (𝑘 · 𝑋) ∈ (𝑁‘{𝑋})) |
29 | 22, 24, 25, 27, 28 | syl22anc 838 | . . . . 5 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → (𝑘 · 𝑋) ∈ (𝑁‘{𝑋})) |
30 | eleq1a 2848 | . . . . 5 ⊢ ((𝑘 · 𝑋) ∈ (𝑁‘{𝑋}) → (𝑣 = (𝑘 · 𝑋) → 𝑣 ∈ (𝑁‘{𝑋}))) | |
31 | 29, 30 | syl 17 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) ∧ 𝑘 ∈ 𝐾) → (𝑣 = (𝑘 · 𝑋) → 𝑣 ∈ (𝑁‘{𝑋}))) |
32 | 31 | rexlimdva 3209 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋) → 𝑣 ∈ (𝑁‘{𝑋}))) |
33 | 32 | abssdv 3974 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)} ⊆ (𝑁‘{𝑋})) |
34 | 21, 33 | eqssd 3910 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{𝑋}) = {𝑣 ∣ ∃𝑘 ∈ 𝐾 𝑣 = (𝑘 · 𝑋)}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1539 ∈ wcel 2112 {cab 2736 ∃wrex 3072 {csn 4523 ‘cfv 6336 (class class class)co 7151 Basecbs 16542 Scalarcsca 16627 ·𝑠 cvsca 16628 1rcur 19320 LModclmod 19703 LSubSpclss 19772 LSpanclspn 19812 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1912 ax-6 1971 ax-7 2016 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2159 ax-12 2176 ax-ext 2730 ax-rep 5157 ax-sep 5170 ax-nul 5177 ax-pow 5235 ax-pr 5299 ax-un 7460 ax-cnex 10632 ax-resscn 10633 ax-1cn 10634 ax-icn 10635 ax-addcl 10636 ax-addrcl 10637 ax-mulcl 10638 ax-mulrcl 10639 ax-mulcom 10640 ax-addass 10641 ax-mulass 10642 ax-distr 10643 ax-i2m1 10644 ax-1ne0 10645 ax-1rid 10646 ax-rnegex 10647 ax-rrecex 10648 ax-cnre 10649 ax-pre-lttri 10650 ax-pre-lttrn 10651 ax-pre-ltadd 10652 ax-pre-mulgt0 10653 |
This theorem depends on definitions: df-bi 210 df-an 401 df-or 846 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2071 df-mo 2558 df-eu 2589 df-clab 2737 df-cleq 2751 df-clel 2831 df-nfc 2902 df-ne 2953 df-nel 3057 df-ral 3076 df-rex 3077 df-reu 3078 df-rmo 3079 df-rab 3080 df-v 3412 df-sbc 3698 df-csb 3807 df-dif 3862 df-un 3864 df-in 3866 df-ss 3876 df-pss 3878 df-nul 4227 df-if 4422 df-pw 4497 df-sn 4524 df-pr 4526 df-tp 4528 df-op 4530 df-uni 4800 df-int 4840 df-iun 4886 df-br 5034 df-opab 5096 df-mpt 5114 df-tr 5140 df-id 5431 df-eprel 5436 df-po 5444 df-so 5445 df-fr 5484 df-we 5486 df-xp 5531 df-rel 5532 df-cnv 5533 df-co 5534 df-dm 5535 df-rn 5536 df-res 5537 df-ima 5538 df-pred 6127 df-ord 6173 df-on 6174 df-lim 6175 df-suc 6176 df-iota 6295 df-fun 6338 df-fn 6339 df-f 6340 df-f1 6341 df-fo 6342 df-f1o 6343 df-fv 6344 df-riota 7109 df-ov 7154 df-oprab 7155 df-mpo 7156 df-om 7581 df-1st 7694 df-2nd 7695 df-wrecs 7958 df-recs 8019 df-rdg 8057 df-er 8300 df-en 8529 df-dom 8530 df-sdom 8531 df-pnf 10716 df-mnf 10717 df-xr 10718 df-ltxr 10719 df-le 10720 df-sub 10911 df-neg 10912 df-nn 11676 df-2 11738 df-ndx 16545 df-slot 16546 df-base 16548 df-sets 16549 df-plusg 16637 df-0g 16774 df-mgm 17919 df-sgrp 17968 df-mnd 17979 df-grp 18173 df-minusg 18174 df-sbg 18175 df-mgp 19309 df-ur 19321 df-ring 19368 df-lmod 19705 df-lss 19773 df-lsp 19813 |
This theorem is referenced by: lspsnel 19844 rnascl 20655 ldual1dim 36743 dia1dim2 38639 dib1dim2 38745 diclspsn 38771 dih1dimatlem 38906 rnasclg 39731 prjspeclsp 39949 |
Copyright terms: Public domain | W3C validator |