Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > lspval | Structured version Visualization version GIF version |
Description: The span of a set of vectors (in a left module). (spanval 29116 analog.) (Contributed by NM, 8-Dec-2013.) (Revised by Mario Carneiro, 19-Jun-2014.) |
Ref | Expression |
---|---|
lspval.v | ⊢ 𝑉 = (Base‘𝑊) |
lspval.s | ⊢ 𝑆 = (LSubSp‘𝑊) |
lspval.n | ⊢ 𝑁 = (LSpan‘𝑊) |
Ref | Expression |
---|---|
lspval | ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑈) = ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | lspval.v | . . . . 5 ⊢ 𝑉 = (Base‘𝑊) | |
2 | lspval.s | . . . . 5 ⊢ 𝑆 = (LSubSp‘𝑊) | |
3 | lspval.n | . . . . 5 ⊢ 𝑁 = (LSpan‘𝑊) | |
4 | 1, 2, 3 | lspfval 19738 | . . . 4 ⊢ (𝑊 ∈ LMod → 𝑁 = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})) |
5 | 4 | fveq1d 6647 | . . 3 ⊢ (𝑊 ∈ LMod → (𝑁‘𝑈) = ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})‘𝑈)) |
6 | 5 | adantr 484 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑈) = ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})‘𝑈)) |
7 | eqid 2798 | . . 3 ⊢ (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}) = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}) | |
8 | sseq1 3940 | . . . . 5 ⊢ (𝑠 = 𝑈 → (𝑠 ⊆ 𝑡 ↔ 𝑈 ⊆ 𝑡)) | |
9 | 8 | rabbidv 3427 | . . . 4 ⊢ (𝑠 = 𝑈 → {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡} = {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
10 | 9 | inteqd 4843 | . . 3 ⊢ (𝑠 = 𝑈 → ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡} = ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
11 | simpr 488 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑈 ⊆ 𝑉) | |
12 | 1 | fvexi 6659 | . . . . 5 ⊢ 𝑉 ∈ V |
13 | 12 | elpw2 5212 | . . . 4 ⊢ (𝑈 ∈ 𝒫 𝑉 ↔ 𝑈 ⊆ 𝑉) |
14 | 11, 13 | sylibr 237 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑈 ∈ 𝒫 𝑉) |
15 | 1, 2 | lss1 19703 | . . . . 5 ⊢ (𝑊 ∈ LMod → 𝑉 ∈ 𝑆) |
16 | sseq2 3941 | . . . . . 6 ⊢ (𝑡 = 𝑉 → (𝑈 ⊆ 𝑡 ↔ 𝑈 ⊆ 𝑉)) | |
17 | 16 | rspcev 3571 | . . . . 5 ⊢ ((𝑉 ∈ 𝑆 ∧ 𝑈 ⊆ 𝑉) → ∃𝑡 ∈ 𝑆 𝑈 ⊆ 𝑡) |
18 | 15, 17 | sylan 583 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → ∃𝑡 ∈ 𝑆 𝑈 ⊆ 𝑡) |
19 | intexrab 5207 | . . . 4 ⊢ (∃𝑡 ∈ 𝑆 𝑈 ⊆ 𝑡 ↔ ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡} ∈ V) | |
20 | 18, 19 | sylib 221 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡} ∈ V) |
21 | 7, 10, 14, 20 | fvmptd3 6768 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})‘𝑈) = ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
22 | 6, 21 | eqtrd 2833 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑈) = ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ∃wrex 3107 {crab 3110 Vcvv 3441 ⊆ wss 3881 𝒫 cpw 4497 ∩ cint 4838 ↦ cmpt 5110 ‘cfv 6324 Basecbs 16475 LModclmod 19627 LSubSpclss 19696 LSpanclspn 19736 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-0g 16707 df-mgm 17844 df-sgrp 17893 df-mnd 17904 df-grp 18098 df-lmod 19629 df-lss 19697 df-lsp 19737 |
This theorem is referenced by: lspid 19747 lspss 19749 lspssid 19750 dochspss 38674 lcosslsp 44847 |
Copyright terms: Public domain | W3C validator |