| 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 14665 | . . . 4 ⊢ (𝑊 ∈ LMod → 𝑁 = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})) |
| 5 | 4 | fveq1d 5677 | . . 3 ⊢ (𝑊 ∈ LMod → (𝑁‘𝑈) = ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})‘𝑈)) |
| 6 | 5 | adantr 276 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑈) = ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})‘𝑈)) |
| 7 | eqid 2234 | . . 3 ⊢ (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}) = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}) | |
| 8 | sseq1 3265 | . . . . 5 ⊢ (𝑠 = 𝑈 → (𝑠 ⊆ 𝑡 ↔ 𝑈 ⊆ 𝑡)) | |
| 9 | 8 | rabbidv 2804 | . . . 4 ⊢ (𝑠 = 𝑈 → {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡} = {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
| 10 | 9 | inteqd 3959 | . . 3 ⊢ (𝑠 = 𝑈 → ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡} = ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
| 11 | simpr 110 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑈 ⊆ 𝑉) | |
| 12 | basfn 13358 | . . . . . . 7 ⊢ Base Fn V | |
| 13 | elex 2827 | . . . . . . . 8 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ V) | |
| 14 | 13 | adantr 276 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑊 ∈ V) |
| 15 | funfvex 5692 | . . . . . . . 8 ⊢ ((Fun Base ∧ 𝑊 ∈ dom Base) → (Base‘𝑊) ∈ V) | |
| 16 | 15 | funfni 5463 | . . . . . . 7 ⊢ ((Base Fn V ∧ 𝑊 ∈ V) → (Base‘𝑊) ∈ V) |
| 17 | 12, 14, 16 | sylancr 414 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → (Base‘𝑊) ∈ V) |
| 18 | 1, 17 | eqeltrid 2321 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑉 ∈ V) |
| 19 | elpw2g 4273 | . . . . 5 ⊢ (𝑉 ∈ V → (𝑈 ∈ 𝒫 𝑉 ↔ 𝑈 ⊆ 𝑉)) | |
| 20 | 18, 19 | syl 14 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → (𝑈 ∈ 𝒫 𝑉 ↔ 𝑈 ⊆ 𝑉)) |
| 21 | 11, 20 | mpbird 167 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑈 ∈ 𝒫 𝑉) |
| 22 | 1, 2 | lss1 14639 | . . . . 5 ⊢ (𝑊 ∈ LMod → 𝑉 ∈ 𝑆) |
| 23 | sseq2 3266 | . . . . . 6 ⊢ (𝑡 = 𝑉 → (𝑈 ⊆ 𝑡 ↔ 𝑈 ⊆ 𝑉)) | |
| 24 | 23 | rspcev 2923 | . . . . 5 ⊢ ((𝑉 ∈ 𝑆 ∧ 𝑈 ⊆ 𝑉) → ∃𝑡 ∈ 𝑆 𝑈 ⊆ 𝑡) |
| 25 | 22, 24 | sylan 283 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → ∃𝑡 ∈ 𝑆 𝑈 ⊆ 𝑡) |
| 26 | intexrabim 4270 | . . . 4 ⊢ (∃𝑡 ∈ 𝑆 𝑈 ⊆ 𝑡 → ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡} ∈ V) | |
| 27 | 25, 26 | syl 14 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡} ∈ V) |
| 28 | 7, 10, 21, 27 | fvmptd3 5776 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})‘𝑈) = ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
| 29 | 6, 28 | eqtrd 2267 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑈) = ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1398 ∈ wcel 2205 ∃wrex 2523 {crab 2526 Vcvv 2815 ⊆ wss 3214 𝒫 cpw 3674 ∩ cint 3954 ↦ cmpt 4176 Fn wfn 5352 ‘cfv 5357 Basecbs 13299 LModclmod 14564 LSubSpclss 14629 LSpanclspn 14663 |
| 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 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-cnex 8234 ax-resscn 8235 ax-1re 8237 ax-addrcl 8240 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-un 3218 df-in 3220 df-ss 3227 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-id 4419 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-riota 6011 df-ov 6061 df-inn 9258 df-2 9316 df-3 9317 df-4 9318 df-5 9319 df-6 9320 df-ndx 13302 df-slot 13303 df-base 13305 df-plusg 13390 df-mulr 13391 df-sca 13393 df-vsca 13394 df-0g 13558 df-mgm 13622 df-sgrp 13668 df-mnd 13681 df-grp 13761 df-lmod 14566 df-lssm 14630 df-lsp 14664 |
| This theorem is referenced by: lspid 14674 lspss 14676 lspssid 14677 |
| Copyright terms: Public domain | W3C validator |