| 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 21827 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 21827 | . 2 ⊢ (𝜑 → (𝑋 ∈ (𝑁‘(𝐹 “ 𝐼)) ↔ ∃𝑓 ∈ (𝐾 ↑m 𝐼)(𝑓 finSupp 0 ∧ 𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹))))) |
| 11 | elmapi 8819 | . . . . . 6 ⊢ (𝑓 ∈ (𝐾 ↑m 𝐼) → 𝑓:𝐼⟶𝐾) | |
| 12 | 11 | adantl 484 | . . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐾 ↑m 𝐼)) → 𝑓:𝐼⟶𝐾) |
| 13 | 9 | adantr 483 | . . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐾 ↑m 𝐼)) → 𝐼 ∈ Fin) |
| 14 | 5 | fvexi 6870 | . . . . . 6 ⊢ 0 ∈ V |
| 15 | 14 | a1i 11 | . . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐾 ↑m 𝐼)) → 0 ∈ V) |
| 16 | 12, 13, 15 | fdmfifsupp 9311 | . . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐾 ↑m 𝐼)) → 𝑓 finSupp 0 ) |
| 17 | 16 | biantrurd 539 | . . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐾 ↑m 𝐼)) → (𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹)) ↔ (𝑓 finSupp 0 ∧ 𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹))))) |
| 18 | 17 | rexbidva 3178 | . 2 ⊢ (𝜑 → (∃𝑓 ∈ (𝐾 ↑m 𝐼)𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹)) ↔ ∃𝑓 ∈ (𝐾 ↑m 𝐼)(𝑓 finSupp 0 ∧ 𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹))))) |
| 19 | 10, 18 | bitr4d 284 | 1 ⊢ (𝜑 → (𝑋 ∈ (𝑁‘(𝐹 “ 𝐼)) ↔ ∃𝑓 ∈ (𝐾 ↑m 𝐼)𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1554 ∈ wcel 2136 ∃wrex 3080 Vcvv 3448 class class class wbr 5094 “ cima 5643 ⟶wf 6506 ‘cfv 6510 (class class class)co 7385 ∘f cof 7647 ↑m cmap 8796 Fincfn 8916 finSupp cfsupp 9297 Basecbs 17221 Scalarcsca 17265 ·𝑠 cvsca 17266 0gc0g 17444 Σg cgsu 17445 LModclmod 20900 LSpanclspn 21011 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-10 2169 ax-11 2185 ax-12 2206 ax-ext 2728 ax-rep 5221 ax-sep 5240 ax-nul 5250 ax-pow 5316 ax-pr 5384 ax-un 7707 ax-cnex 11119 ax-resscn 11120 ax-1cn 11121 ax-icn 11122 ax-addcl 11123 ax-addrcl 11124 ax-mulcl 11125 ax-mulrcl 11126 ax-mulcom 11127 ax-addass 11128 ax-mulass 11129 ax-distr 11130 ax-i2m1 11131 ax-1ne0 11132 ax-1rid 11133 ax-rnegex 11134 ax-rrecex 11135 ax-cnre 11136 ax-pre-lttri 11137 ax-pre-lttrn 11138 ax-pre-ltadd 11139 ax-pre-mulgt0 11140 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-nf 1798 df-sb 2085 df-mo 2560 df-eu 2590 df-clab 2735 df-cleq 2748 df-clel 2831 df-nfc 2905 df-ne 2952 df-nel 3056 df-ral 3071 df-rex 3081 df-rmo 3361 df-reu 3362 df-rab 3409 df-v 3450 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4281 df-if 4475 df-pw 4551 df-sn 4577 df-pr 4579 df-tp 4581 df-op 4583 df-uni 4860 df-int 4900 df-iun 4945 df-iin 4946 df-br 5095 df-opab 5157 df-mpt 5176 df-tr 5202 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-se 5594 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6466 df-fun 6512 df-fn 6513 df-f 6514 df-f1 6515 df-fo 6516 df-f1o 6517 df-fv 6518 df-isom 6519 df-riota 7342 df-ov 7388 df-oprab 7389 df-mpo 7390 df-of 7649 df-om 7836 df-1st 7959 df-2nd 7960 df-supp 8129 df-frecs 8250 df-wrecs 8281 df-recs 8330 df-rdg 8369 df-1o 8425 df-2o 8426 df-er 8666 df-map 8798 df-ixp 8869 df-en 8917 df-dom 8918 df-sdom 8919 df-fin 8920 df-fsupp 9298 df-sup 9378 df-oi 9448 df-card 9887 df-pnf 11208 df-mnf 11209 df-xr 11210 df-ltxr 11211 df-le 11212 df-sub 11406 df-neg 11407 df-nn 12201 df-2 12270 df-3 12271 df-4 12272 df-5 12273 df-6 12274 df-7 12275 df-8 12276 df-9 12277 df-n0 12472 df-z 12559 df-dec 12679 df-uz 12830 df-fz 13503 df-fzo 13650 df-seq 14005 df-hash 14334 df-struct 17159 df-sets 17176 df-slot 17194 df-ndx 17206 df-base 17222 df-ress 17243 df-plusg 17275 df-mulr 17276 df-sca 17278 df-vsca 17279 df-ip 17280 df-tset 17281 df-ple 17282 df-ds 17284 df-hom 17286 df-cco 17287 df-0g 17446 df-gsum 17447 df-prds 17452 df-pws 17454 df-mre 17590 df-mrc 17591 df-acs 17593 df-mgm 18650 df-sgrp 18729 df-mnd 18745 df-mhm 18793 df-submnd 18794 df-grp 18954 df-minusg 18955 df-sbg 18956 df-mulg 19086 df-subg 19141 df-ghm 19230 df-cntz 19333 df-cmn 19798 df-abl 19799 df-mgp 20163 df-rng 20175 df-ur 20204 df-ring 20257 df-nzr 20535 df-subrg 20592 df-lmod 20902 df-lss 20972 df-lsp 21012 df-lmhm 21062 df-lbs 21115 df-sra 21213 df-rgmod 21214 df-dsmm 21757 df-frlm 21772 df-uvc 21808 |
| This theorem is referenced by: matunitlindflem2 38064 |
| Copyright terms: Public domain | W3C validator |