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 27576 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 18794 | . . . 4 ⊢ (𝑊 ∈ LMod → 𝑁 = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})) |
5 | 4 | fveq1d 6105 | . . 3 ⊢ (𝑊 ∈ LMod → (𝑁‘𝑈) = ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})‘𝑈)) |
6 | 5 | adantr 480 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑈) = ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})‘𝑈)) |
7 | simpr 476 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑈 ⊆ 𝑉) | |
8 | fvex 6113 | . . . . . 6 ⊢ (Base‘𝑊) ∈ V | |
9 | 1, 8 | eqeltri 2684 | . . . . 5 ⊢ 𝑉 ∈ V |
10 | 9 | elpw2 4755 | . . . 4 ⊢ (𝑈 ∈ 𝒫 𝑉 ↔ 𝑈 ⊆ 𝑉) |
11 | 7, 10 | sylibr 223 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑈 ∈ 𝒫 𝑉) |
12 | 1, 2 | lss1 18760 | . . . . 5 ⊢ (𝑊 ∈ LMod → 𝑉 ∈ 𝑆) |
13 | sseq2 3590 | . . . . . 6 ⊢ (𝑡 = 𝑉 → (𝑈 ⊆ 𝑡 ↔ 𝑈 ⊆ 𝑉)) | |
14 | 13 | rspcev 3282 | . . . . 5 ⊢ ((𝑉 ∈ 𝑆 ∧ 𝑈 ⊆ 𝑉) → ∃𝑡 ∈ 𝑆 𝑈 ⊆ 𝑡) |
15 | 12, 14 | sylan 487 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → ∃𝑡 ∈ 𝑆 𝑈 ⊆ 𝑡) |
16 | intexrab 4750 | . . . 4 ⊢ (∃𝑡 ∈ 𝑆 𝑈 ⊆ 𝑡 ↔ ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡} ∈ V) | |
17 | 15, 16 | sylib 207 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡} ∈ V) |
18 | sseq1 3589 | . . . . . 6 ⊢ (𝑠 = 𝑈 → (𝑠 ⊆ 𝑡 ↔ 𝑈 ⊆ 𝑡)) | |
19 | 18 | rabbidv 3164 | . . . . 5 ⊢ (𝑠 = 𝑈 → {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡} = {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
20 | 19 | inteqd 4415 | . . . 4 ⊢ (𝑠 = 𝑈 → ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡} = ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
21 | eqid 2610 | . . . 4 ⊢ (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}) = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}) | |
22 | 20, 21 | fvmptg 6189 | . . 3 ⊢ ((𝑈 ∈ 𝒫 𝑉 ∧ ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡} ∈ V) → ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})‘𝑈) = ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
23 | 11, 17, 22 | syl2anc 691 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})‘𝑈) = ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
24 | 6, 23 | eqtrd 2644 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑈) = ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ∃wrex 2897 {crab 2900 Vcvv 3173 ⊆ wss 3540 𝒫 cpw 4108 ∩ cint 4410 ↦ cmpt 4643 ‘cfv 5804 Basecbs 15695 LModclmod 18686 LSubSpclss 18753 LSpanclspn 18792 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-0g 15925 df-mgm 17065 df-sgrp 17107 df-mnd 17118 df-grp 17248 df-lmod 18688 df-lss 18754 df-lsp 18793 |
This theorem is referenced by: lspid 18803 lspss 18805 lspssid 18806 dochspss 35685 lcosslsp 42021 |
Copyright terms: Public domain | W3C validator |