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 29110 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 19745 | . . . 4 ⊢ (𝑊 ∈ LMod → 𝑁 = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})) |
5 | 4 | fveq1d 6672 | . . 3 ⊢ (𝑊 ∈ LMod → (𝑁‘𝑈) = ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})‘𝑈)) |
6 | 5 | adantr 483 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑈) = ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})‘𝑈)) |
7 | eqid 2821 | . . 3 ⊢ (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}) = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}) | |
8 | sseq1 3992 | . . . . 5 ⊢ (𝑠 = 𝑈 → (𝑠 ⊆ 𝑡 ↔ 𝑈 ⊆ 𝑡)) | |
9 | 8 | rabbidv 3480 | . . . 4 ⊢ (𝑠 = 𝑈 → {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡} = {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
10 | 9 | inteqd 4881 | . . 3 ⊢ (𝑠 = 𝑈 → ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡} = ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
11 | simpr 487 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑈 ⊆ 𝑉) | |
12 | 1 | fvexi 6684 | . . . . 5 ⊢ 𝑉 ∈ V |
13 | 12 | elpw2 5248 | . . . 4 ⊢ (𝑈 ∈ 𝒫 𝑉 ↔ 𝑈 ⊆ 𝑉) |
14 | 11, 13 | sylibr 236 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑈 ∈ 𝒫 𝑉) |
15 | 1, 2 | lss1 19710 | . . . . 5 ⊢ (𝑊 ∈ LMod → 𝑉 ∈ 𝑆) |
16 | sseq2 3993 | . . . . . 6 ⊢ (𝑡 = 𝑉 → (𝑈 ⊆ 𝑡 ↔ 𝑈 ⊆ 𝑉)) | |
17 | 16 | rspcev 3623 | . . . . 5 ⊢ ((𝑉 ∈ 𝑆 ∧ 𝑈 ⊆ 𝑉) → ∃𝑡 ∈ 𝑆 𝑈 ⊆ 𝑡) |
18 | 15, 17 | sylan 582 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → ∃𝑡 ∈ 𝑆 𝑈 ⊆ 𝑡) |
19 | intexrab 5243 | . . . 4 ⊢ (∃𝑡 ∈ 𝑆 𝑈 ⊆ 𝑡 ↔ ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡} ∈ V) | |
20 | 18, 19 | sylib 220 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡} ∈ V) |
21 | 7, 10, 14, 20 | fvmptd3 6791 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})‘𝑈) = ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
22 | 6, 21 | eqtrd 2856 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑈) = ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ∃wrex 3139 {crab 3142 Vcvv 3494 ⊆ wss 3936 𝒫 cpw 4539 ∩ cint 4876 ↦ cmpt 5146 ‘cfv 6355 Basecbs 16483 LModclmod 19634 LSubSpclss 19703 LSpanclspn 19743 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-int 4877 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-0g 16715 df-mgm 17852 df-sgrp 17901 df-mnd 17912 df-grp 18106 df-lmod 19636 df-lss 19704 df-lsp 19744 |
This theorem is referenced by: lspid 19754 lspss 19756 lspssid 19757 dochspss 38529 lcosslsp 44513 |
Copyright terms: Public domain | W3C validator |