| 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 14317 | . . . 4 ⊢ (𝑊 ∈ LMod → 𝑁 = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})) |
| 5 | 4 | fveq1d 5605 | . . 3 ⊢ (𝑊 ∈ LMod → (𝑁‘𝑈) = ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})‘𝑈)) |
| 6 | 5 | adantr 276 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑈) = ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})‘𝑈)) |
| 7 | eqid 2209 | . . 3 ⊢ (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}) = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}) | |
| 8 | sseq1 3227 | . . . . 5 ⊢ (𝑠 = 𝑈 → (𝑠 ⊆ 𝑡 ↔ 𝑈 ⊆ 𝑡)) | |
| 9 | 8 | rabbidv 2768 | . . . 4 ⊢ (𝑠 = 𝑈 → {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡} = {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
| 10 | 9 | inteqd 3907 | . . 3 ⊢ (𝑠 = 𝑈 → ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡} = ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
| 11 | simpr 110 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑈 ⊆ 𝑉) | |
| 12 | basfn 13057 | . . . . . . 7 ⊢ Base Fn V | |
| 13 | elex 2791 | . . . . . . . 8 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ V) | |
| 14 | 13 | adantr 276 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑊 ∈ V) |
| 15 | funfvex 5620 | . . . . . . . 8 ⊢ ((Fun Base ∧ 𝑊 ∈ dom Base) → (Base‘𝑊) ∈ V) | |
| 16 | 15 | funfni 5399 | . . . . . . 7 ⊢ ((Base Fn V ∧ 𝑊 ∈ V) → (Base‘𝑊) ∈ V) |
| 17 | 12, 14, 16 | sylancr 414 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → (Base‘𝑊) ∈ V) |
| 18 | 1, 17 | eqeltrid 2296 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑉 ∈ V) |
| 19 | elpw2g 4219 | . . . . 5 ⊢ (𝑉 ∈ V → (𝑈 ∈ 𝒫 𝑉 ↔ 𝑈 ⊆ 𝑉)) | |
| 20 | 18, 19 | syl 14 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → (𝑈 ∈ 𝒫 𝑉 ↔ 𝑈 ⊆ 𝑉)) |
| 21 | 11, 20 | mpbird 167 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑈 ∈ 𝒫 𝑉) |
| 22 | 1, 2 | lss1 14291 | . . . . 5 ⊢ (𝑊 ∈ LMod → 𝑉 ∈ 𝑆) |
| 23 | sseq2 3228 | . . . . . 6 ⊢ (𝑡 = 𝑉 → (𝑈 ⊆ 𝑡 ↔ 𝑈 ⊆ 𝑉)) | |
| 24 | 23 | rspcev 2887 | . . . . 5 ⊢ ((𝑉 ∈ 𝑆 ∧ 𝑈 ⊆ 𝑉) → ∃𝑡 ∈ 𝑆 𝑈 ⊆ 𝑡) |
| 25 | 22, 24 | sylan 283 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → ∃𝑡 ∈ 𝑆 𝑈 ⊆ 𝑡) |
| 26 | intexrabim 4216 | . . . 4 ⊢ (∃𝑡 ∈ 𝑆 𝑈 ⊆ 𝑡 → ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡} ∈ V) | |
| 27 | 25, 26 | syl 14 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡} ∈ V) |
| 28 | 7, 10, 21, 27 | fvmptd3 5701 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})‘𝑈) = ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
| 29 | 6, 28 | eqtrd 2242 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑈) = ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1375 ∈ wcel 2180 ∃wrex 2489 {crab 2492 Vcvv 2779 ⊆ wss 3177 𝒫 cpw 3629 ∩ cint 3902 ↦ cmpt 4124 Fn wfn 5289 ‘cfv 5294 Basecbs 12998 LModclmod 14216 LSubSpclss 14281 LSpanclspn 14315 |
| 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 713 ax-5 1473 ax-7 1474 ax-gen 1475 ax-ie1 1519 ax-ie2 1520 ax-8 1530 ax-10 1531 ax-11 1532 ax-i12 1533 ax-bndl 1535 ax-4 1536 ax-17 1552 ax-i9 1556 ax-ial 1560 ax-i5r 1561 ax-13 2182 ax-14 2183 ax-ext 2191 ax-coll 4178 ax-sep 4181 ax-pow 4237 ax-pr 4272 ax-un 4501 ax-cnex 8058 ax-resscn 8059 ax-1re 8061 ax-addrcl 8064 |
| This theorem depends on definitions: df-bi 117 df-3an 985 df-tru 1378 df-nf 1487 df-sb 1789 df-eu 2060 df-mo 2061 df-clab 2196 df-cleq 2202 df-clel 2205 df-nfc 2341 df-ral 2493 df-rex 2494 df-reu 2495 df-rmo 2496 df-rab 2497 df-v 2781 df-sbc 3009 df-csb 3105 df-un 3181 df-in 3183 df-ss 3190 df-pw 3631 df-sn 3652 df-pr 3653 df-op 3655 df-uni 3868 df-int 3903 df-iun 3946 df-br 4063 df-opab 4125 df-mpt 4126 df-id 4361 df-xp 4702 df-rel 4703 df-cnv 4704 df-co 4705 df-dm 4706 df-rn 4707 df-res 4708 df-ima 4709 df-iota 5254 df-fun 5296 df-fn 5297 df-f 5298 df-f1 5299 df-fo 5300 df-f1o 5301 df-fv 5302 df-riota 5927 df-ov 5977 df-inn 9079 df-2 9137 df-3 9138 df-4 9139 df-5 9140 df-6 9141 df-ndx 13001 df-slot 13002 df-base 13004 df-plusg 13089 df-mulr 13090 df-sca 13092 df-vsca 13093 df-0g 13257 df-mgm 13355 df-sgrp 13401 df-mnd 13416 df-grp 13502 df-lmod 14218 df-lssm 14282 df-lsp 14316 |
| This theorem is referenced by: lspid 14326 lspss 14328 lspssid 14329 |
| Copyright terms: Public domain | W3C validator |