| 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 21790 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 21790 | . 2 ⊢ (𝜑 → (𝑋 ∈ (𝑁‘(𝐹 “ 𝐼)) ↔ ∃𝑓 ∈ (𝐾 ↑m 𝐼)(𝑓 finSupp 0 ∧ 𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹))))) |
| 11 | elmapi 8787 | . . . . . 6 ⊢ (𝑓 ∈ (𝐾 ↑m 𝐼) → 𝑓:𝐼⟶𝐾) | |
| 12 | 11 | adantl 481 | . . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐾 ↑m 𝐼)) → 𝑓:𝐼⟶𝐾) |
| 13 | 9 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐾 ↑m 𝐼)) → 𝐼 ∈ Fin) |
| 14 | 5 | fvexi 6846 | . . . . . 6 ⊢ 0 ∈ V |
| 15 | 14 | a1i 11 | . . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐾 ↑m 𝐼)) → 0 ∈ V) |
| 16 | 12, 13, 15 | fdmfifsupp 9279 | . . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐾 ↑m 𝐼)) → 𝑓 finSupp 0 ) |
| 17 | 16 | biantrurd 532 | . . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐾 ↑m 𝐼)) → (𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹)) ↔ (𝑓 finSupp 0 ∧ 𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹))))) |
| 18 | 17 | rexbidva 3160 | . 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 1542 ∈ wcel 2114 ∃wrex 3062 Vcvv 3430 class class class wbr 5086 “ cima 5625 ⟶wf 6486 ‘cfv 6490 (class class class)co 7358 ∘f cof 7620 ↑m cmap 8764 Fincfn 8884 finSupp cfsupp 9265 Basecbs 17168 Scalarcsca 17212 ·𝑠 cvsca 17213 0gc0g 17391 Σg cgsu 17392 LModclmod 20844 LSpanclspn 20955 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5368 ax-un 7680 ax-cnex 11083 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-addrcl 11088 ax-mulcl 11089 ax-mulrcl 11090 ax-mulcom 11091 ax-addass 11092 ax-mulass 11093 ax-distr 11094 ax-i2m1 11095 ax-1ne0 11096 ax-1rid 11097 ax-rnegex 11098 ax-rrecex 11099 ax-cnre 11100 ax-pre-lttri 11101 ax-pre-lttrn 11102 ax-pre-ltadd 11103 ax-pre-mulgt0 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-iin 4937 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-se 5576 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-isom 6499 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-of 7622 df-om 7809 df-1st 7933 df-2nd 7934 df-supp 8102 df-frecs 8222 df-wrecs 8253 df-recs 8302 df-rdg 8340 df-1o 8396 df-2o 8397 df-er 8634 df-map 8766 df-ixp 8837 df-en 8885 df-dom 8886 df-sdom 8887 df-fin 8888 df-fsupp 9266 df-sup 9346 df-oi 9416 df-card 9852 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-nn 12164 df-2 12233 df-3 12234 df-4 12235 df-5 12236 df-6 12237 df-7 12238 df-8 12239 df-9 12240 df-n0 12427 df-z 12514 df-dec 12634 df-uz 12778 df-fz 13451 df-fzo 13598 df-seq 13953 df-hash 14282 df-struct 17106 df-sets 17123 df-slot 17141 df-ndx 17153 df-base 17169 df-ress 17190 df-plusg 17222 df-mulr 17223 df-sca 17225 df-vsca 17226 df-ip 17227 df-tset 17228 df-ple 17229 df-ds 17231 df-hom 17233 df-cco 17234 df-0g 17393 df-gsum 17394 df-prds 17399 df-pws 17401 df-mre 17537 df-mrc 17538 df-acs 17540 df-mgm 18597 df-sgrp 18676 df-mnd 18692 df-mhm 18740 df-submnd 18741 df-grp 18901 df-minusg 18902 df-sbg 18903 df-mulg 19033 df-subg 19088 df-ghm 19177 df-cntz 19281 df-cmn 19746 df-abl 19747 df-mgp 20111 df-rng 20123 df-ur 20152 df-ring 20205 df-nzr 20479 df-subrg 20536 df-lmod 20846 df-lss 20916 df-lsp 20956 df-lmhm 21007 df-lbs 21060 df-sra 21158 df-rgmod 21159 df-dsmm 21720 df-frlm 21735 df-uvc 21771 |
| This theorem is referenced by: matunitlindflem2 37949 |
| Copyright terms: Public domain | W3C validator |