| 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 14405 | . . . 4 ⊢ (𝑊 ∈ LMod → 𝑁 = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})) |
| 5 | 4 | fveq1d 5641 | . . 3 ⊢ (𝑊 ∈ LMod → (𝑁‘𝑈) = ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})‘𝑈)) |
| 6 | 5 | adantr 276 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑈) = ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})‘𝑈)) |
| 7 | eqid 2231 | . . 3 ⊢ (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}) = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}) | |
| 8 | sseq1 3250 | . . . . 5 ⊢ (𝑠 = 𝑈 → (𝑠 ⊆ 𝑡 ↔ 𝑈 ⊆ 𝑡)) | |
| 9 | 8 | rabbidv 2791 | . . . 4 ⊢ (𝑠 = 𝑈 → {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡} = {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
| 10 | 9 | inteqd 3933 | . . 3 ⊢ (𝑠 = 𝑈 → ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡} = ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
| 11 | simpr 110 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑈 ⊆ 𝑉) | |
| 12 | basfn 13143 | . . . . . . 7 ⊢ Base Fn V | |
| 13 | elex 2814 | . . . . . . . 8 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ V) | |
| 14 | 13 | adantr 276 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑊 ∈ V) |
| 15 | funfvex 5656 | . . . . . . . 8 ⊢ ((Fun Base ∧ 𝑊 ∈ dom Base) → (Base‘𝑊) ∈ V) | |
| 16 | 15 | funfni 5432 | . . . . . . 7 ⊢ ((Base Fn V ∧ 𝑊 ∈ V) → (Base‘𝑊) ∈ V) |
| 17 | 12, 14, 16 | sylancr 414 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → (Base‘𝑊) ∈ V) |
| 18 | 1, 17 | eqeltrid 2318 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑉 ∈ V) |
| 19 | elpw2g 4246 | . . . . 5 ⊢ (𝑉 ∈ V → (𝑈 ∈ 𝒫 𝑉 ↔ 𝑈 ⊆ 𝑉)) | |
| 20 | 18, 19 | syl 14 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → (𝑈 ∈ 𝒫 𝑉 ↔ 𝑈 ⊆ 𝑉)) |
| 21 | 11, 20 | mpbird 167 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑈 ∈ 𝒫 𝑉) |
| 22 | 1, 2 | lss1 14379 | . . . . 5 ⊢ (𝑊 ∈ LMod → 𝑉 ∈ 𝑆) |
| 23 | sseq2 3251 | . . . . . 6 ⊢ (𝑡 = 𝑉 → (𝑈 ⊆ 𝑡 ↔ 𝑈 ⊆ 𝑉)) | |
| 24 | 23 | rspcev 2910 | . . . . 5 ⊢ ((𝑉 ∈ 𝑆 ∧ 𝑈 ⊆ 𝑉) → ∃𝑡 ∈ 𝑆 𝑈 ⊆ 𝑡) |
| 25 | 22, 24 | sylan 283 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → ∃𝑡 ∈ 𝑆 𝑈 ⊆ 𝑡) |
| 26 | intexrabim 4243 | . . . 4 ⊢ (∃𝑡 ∈ 𝑆 𝑈 ⊆ 𝑡 → ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡} ∈ V) | |
| 27 | 25, 26 | syl 14 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡} ∈ V) |
| 28 | 7, 10, 21, 27 | fvmptd3 5740 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})‘𝑈) = ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
| 29 | 6, 28 | eqtrd 2264 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑈) = ∩ {𝑡 ∈ 𝑆 ∣ 𝑈 ⊆ 𝑡}) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1397 ∈ wcel 2202 ∃wrex 2511 {crab 2514 Vcvv 2802 ⊆ wss 3200 𝒫 cpw 3652 ∩ cint 3928 ↦ cmpt 4150 Fn wfn 5321 ‘cfv 5326 Basecbs 13084 LModclmod 14304 LSubSpclss 14369 LSpanclspn 14403 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-cnex 8123 ax-resscn 8124 ax-1re 8126 ax-addrcl 8129 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5971 df-ov 6021 df-inn 9144 df-2 9202 df-3 9203 df-4 9204 df-5 9205 df-6 9206 df-ndx 13087 df-slot 13088 df-base 13090 df-plusg 13175 df-mulr 13176 df-sca 13178 df-vsca 13179 df-0g 13343 df-mgm 13441 df-sgrp 13487 df-mnd 13502 df-grp 13588 df-lmod 14306 df-lssm 14370 df-lsp 14404 |
| This theorem is referenced by: lspid 14414 lspss 14416 lspssid 14417 |
| Copyright terms: Public domain | W3C validator |