| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elfilspd | Structured version Visualization version GIF version | ||
| Description: Simplified version of ellspd 21762 when the spanning set is finite: all linear combinations are then acceptable. (Contributed by Stefan O'Rear, 7-Feb-2015.) (Proof shortened by AV, 21-Jul-2019.) |
| Ref | Expression |
|---|---|
| ellspd.n | ⊢ 𝑁 = (LSpan‘𝑀) |
| ellspd.v | ⊢ 𝐵 = (Base‘𝑀) |
| ellspd.k | ⊢ 𝐾 = (Base‘𝑆) |
| ellspd.s | ⊢ 𝑆 = (Scalar‘𝑀) |
| ellspd.z | ⊢ 0 = (0g‘𝑆) |
| ellspd.t | ⊢ · = ( ·𝑠 ‘𝑀) |
| elfilspd.f | ⊢ (𝜑 → 𝐹:𝐼⟶𝐵) |
| elfilspd.m | ⊢ (𝜑 → 𝑀 ∈ LMod) |
| elfilspd.i | ⊢ (𝜑 → 𝐼 ∈ Fin) |
| Ref | Expression |
|---|---|
| elfilspd | ⊢ (𝜑 → (𝑋 ∈ (𝑁‘(𝐹 “ 𝐼)) ↔ ∃𝑓 ∈ (𝐾 ↑m 𝐼)𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ellspd.n | . . 3 ⊢ 𝑁 = (LSpan‘𝑀) | |
| 2 | ellspd.v | . . 3 ⊢ 𝐵 = (Base‘𝑀) | |
| 3 | ellspd.k | . . 3 ⊢ 𝐾 = (Base‘𝑆) | |
| 4 | ellspd.s | . . 3 ⊢ 𝑆 = (Scalar‘𝑀) | |
| 5 | ellspd.z | . . 3 ⊢ 0 = (0g‘𝑆) | |
| 6 | ellspd.t | . . 3 ⊢ · = ( ·𝑠 ‘𝑀) | |
| 7 | elfilspd.f | . . 3 ⊢ (𝜑 → 𝐹:𝐼⟶𝐵) | |
| 8 | elfilspd.m | . . 3 ⊢ (𝜑 → 𝑀 ∈ LMod) | |
| 9 | elfilspd.i | . . 3 ⊢ (𝜑 → 𝐼 ∈ Fin) | |
| 10 | 1, 2, 3, 4, 5, 6, 7, 8, 9 | ellspd 21762 | . 2 ⊢ (𝜑 → (𝑋 ∈ (𝑁‘(𝐹 “ 𝐼)) ↔ ∃𝑓 ∈ (𝐾 ↑m 𝐼)(𝑓 finSupp 0 ∧ 𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹))))) |
| 11 | elmapi 8863 | . . . . . 6 ⊢ (𝑓 ∈ (𝐾 ↑m 𝐼) → 𝑓:𝐼⟶𝐾) | |
| 12 | 11 | adantl 481 | . . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐾 ↑m 𝐼)) → 𝑓:𝐼⟶𝐾) |
| 13 | 9 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐾 ↑m 𝐼)) → 𝐼 ∈ Fin) |
| 14 | 5 | fvexi 6890 | . . . . . 6 ⊢ 0 ∈ V |
| 15 | 14 | a1i 11 | . . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐾 ↑m 𝐼)) → 0 ∈ V) |
| 16 | 12, 13, 15 | fdmfifsupp 9387 | . . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐾 ↑m 𝐼)) → 𝑓 finSupp 0 ) |
| 17 | 16 | biantrurd 532 | . . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐾 ↑m 𝐼)) → (𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹)) ↔ (𝑓 finSupp 0 ∧ 𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹))))) |
| 18 | 17 | rexbidva 3162 | . 2 ⊢ (𝜑 → (∃𝑓 ∈ (𝐾 ↑m 𝐼)𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹)) ↔ ∃𝑓 ∈ (𝐾 ↑m 𝐼)(𝑓 finSupp 0 ∧ 𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹))))) |
| 19 | 10, 18 | bitr4d 282 | 1 ⊢ (𝜑 → (𝑋 ∈ (𝑁‘(𝐹 “ 𝐼)) ↔ ∃𝑓 ∈ (𝐾 ↑m 𝐼)𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2108 ∃wrex 3060 Vcvv 3459 class class class wbr 5119 “ cima 5657 ⟶wf 6527 ‘cfv 6531 (class class class)co 7405 ∘f cof 7669 ↑m cmap 8840 Fincfn 8959 finSupp cfsupp 9373 Basecbs 17228 Scalarcsca 17274 ·𝑠 cvsca 17275 0gc0g 17453 Σg cgsu 17454 LModclmod 20817 LSpanclspn 20928 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-rep 5249 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 ax-cnex 11185 ax-resscn 11186 ax-1cn 11187 ax-icn 11188 ax-addcl 11189 ax-addrcl 11190 ax-mulcl 11191 ax-mulrcl 11192 ax-mulcom 11193 ax-addass 11194 ax-mulass 11195 ax-distr 11196 ax-i2m1 11197 ax-1ne0 11198 ax-1rid 11199 ax-rnegex 11200 ax-rrecex 11201 ax-cnre 11202 ax-pre-lttri 11203 ax-pre-lttrn 11204 ax-pre-ltadd 11205 ax-pre-mulgt0 11206 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-tp 4606 df-op 4608 df-uni 4884 df-int 4923 df-iun 4969 df-iin 4970 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-se 5607 df-we 5608 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6290 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-isom 6540 df-riota 7362 df-ov 7408 df-oprab 7409 df-mpo 7410 df-of 7671 df-om 7862 df-1st 7988 df-2nd 7989 df-supp 8160 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-1o 8480 df-2o 8481 df-er 8719 df-map 8842 df-ixp 8912 df-en 8960 df-dom 8961 df-sdom 8962 df-fin 8963 df-fsupp 9374 df-sup 9454 df-oi 9524 df-card 9953 df-pnf 11271 df-mnf 11272 df-xr 11273 df-ltxr 11274 df-le 11275 df-sub 11468 df-neg 11469 df-nn 12241 df-2 12303 df-3 12304 df-4 12305 df-5 12306 df-6 12307 df-7 12308 df-8 12309 df-9 12310 df-n0 12502 df-z 12589 df-dec 12709 df-uz 12853 df-fz 13525 df-fzo 13672 df-seq 14020 df-hash 14349 df-struct 17166 df-sets 17183 df-slot 17201 df-ndx 17213 df-base 17229 df-ress 17252 df-plusg 17284 df-mulr 17285 df-sca 17287 df-vsca 17288 df-ip 17289 df-tset 17290 df-ple 17291 df-ds 17293 df-hom 17295 df-cco 17296 df-0g 17455 df-gsum 17456 df-prds 17461 df-pws 17463 df-mre 17598 df-mrc 17599 df-acs 17601 df-mgm 18618 df-sgrp 18697 df-mnd 18713 df-mhm 18761 df-submnd 18762 df-grp 18919 df-minusg 18920 df-sbg 18921 df-mulg 19051 df-subg 19106 df-ghm 19196 df-cntz 19300 df-cmn 19763 df-abl 19764 df-mgp 20101 df-rng 20113 df-ur 20142 df-ring 20195 df-nzr 20473 df-subrg 20530 df-lmod 20819 df-lss 20889 df-lsp 20929 df-lmhm 20980 df-lbs 21033 df-sra 21131 df-rgmod 21132 df-dsmm 21692 df-frlm 21707 df-uvc 21743 |
| This theorem is referenced by: matunitlindflem2 37641 |
| Copyright terms: Public domain | W3C validator |