| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lspval | GIF version | ||
| Description: The span of a set of vectors (in a left module). (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 14523 | . . . 4 ⊢ (𝑊 ∈ LMod → 𝑁 = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})) |
| 5 | 4 | fveq1d 5671 | . . 3 ⊢ (𝑊 ∈ LMod → (𝑁‘𝑈) = ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})‘𝑈)) |
| 6 | 5 | adantr 276 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑈) = ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})‘𝑈)) |
| 7 | eqid 2232 | . . 3 ⊢ (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}) = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}) | |
| 8 | sseq1 3260 | . . . . 5 ⊢ (𝑠 = 𝑈 → (𝑠 ⊆ 𝑡 ↔ 𝑈 ⊆ 𝑡)) | |
| 9 | 8 | rabbidv 2801 | . . . 4 ⊢ (𝑠 = 𝑈 → {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡} = {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
| 10 | 9 | inteqd 3953 | . . 3 ⊢ (𝑠 = 𝑈 → ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡} = ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
| 11 | simpr 110 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑈 ⊆ 𝑉) | |
| 12 | basfn 13260 | . . . . . . 7 ⊢ Base Fn V | |
| 13 | elex 2824 | . . . . . . . 8 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ V) | |
| 14 | 13 | adantr 276 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑊 ∈ V) |
| 15 | funfvex 5686 | . . . . . . . 8 ⊢ ((Fun Base ∧ 𝑊 ∈ dom Base) → (Base‘𝑊) ∈ V) | |
| 16 | 15 | funfni 5457 | . . . . . . 7 ⊢ ((Base Fn V ∧ 𝑊 ∈ V) → (Base‘𝑊) ∈ V) |
| 17 | 12, 14, 16 | sylancr 414 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → (Base‘𝑊) ∈ V) |
| 18 | 1, 17 | eqeltrid 2319 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑉 ∈ V) |
| 19 | elpw2g 4267 | . . . . 5 ⊢ (𝑉 ∈ V → (𝑈 ∈ 𝒫 𝑉 ↔ 𝑈 ⊆ 𝑉)) | |
| 20 | 18, 19 | syl 14 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → (𝑈 ∈ 𝒫 𝑉 ↔ 𝑈 ⊆ 𝑉)) |
| 21 | 11, 20 | mpbird 167 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑈 ∈ 𝒫 𝑉) |
| 22 | 1, 2 | lss1 14497 | . . . . 5 ⊢ (𝑊 ∈ LMod → 𝑉 ∈ 𝑆) |
| 23 | sseq2 3261 | . . . . . 6 ⊢ (𝑡 = 𝑉 → (𝑈 ⊆ 𝑡 ↔ 𝑈 ⊆ 𝑉)) | |
| 24 | 23 | rspcev 2920 | . . . . 5 ⊢ ((𝑉 ∈ 𝑆 ∧ 𝑈 ⊆ 𝑉) → ∃𝑡 ∈ 𝑆 𝑈 ⊆ 𝑡) |
| 25 | 22, 24 | sylan 283 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → ∃𝑡 ∈ 𝑆 𝑈 ⊆ 𝑡) |
| 26 | intexrabim 4264 | . . . 4 ⊢ (∃𝑡 ∈ 𝑆 𝑈 ⊆ 𝑡 → ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡} ∈ V) | |
| 27 | 25, 26 | syl 14 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡} ∈ V) |
| 28 | 7, 10, 21, 27 | fvmptd3 5770 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})‘𝑈) = ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
| 29 | 6, 28 | eqtrd 2265 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑈) = ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1398 ∈ wcel 2203 ∃wrex 2521 {crab 2524 Vcvv 2812 ⊆ wss 3210 𝒫 cpw 3668 ∩ cint 3948 ↦ cmpt 4170 Fn wfn 5346 ‘cfv 5351 Basecbs 13201 LModclmod 14422 LSubSpclss 14487 LSpanclspn 14521 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4224 ax-sep 4227 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-cnex 8214 ax-resscn 8215 ax-1re 8217 ax-addrcl 8220 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ral 2525 df-rex 2526 df-reu 2527 df-rmo 2528 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-un 3214 df-in 3216 df-ss 3223 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-int 3949 df-iun 3992 df-br 4109 df-opab 4171 df-mpt 4172 df-id 4413 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-riota 6002 df-ov 6052 df-inn 9234 df-2 9292 df-3 9293 df-4 9294 df-5 9295 df-6 9296 df-ndx 13204 df-slot 13205 df-base 13207 df-plusg 13292 df-mulr 13293 df-sca 13295 df-vsca 13296 df-0g 13460 df-mgm 13558 df-sgrp 13604 df-mnd 13619 df-grp 13705 df-lmod 14424 df-lssm 14488 df-lsp 14522 |
| This theorem is referenced by: lspid 14532 lspss 14534 lspssid 14535 |
| Copyright terms: Public domain | W3C validator |