![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ellspd | Structured version Visualization version GIF version |
Description: The elements of the span of an indexed collection of basic vectors are those vectors which can be written as finite linear combinations of basic vectors. (Contributed by Stefan O'Rear, 7-Feb-2015.) (Revised by AV, 24-Jun-2019.) (Revised by AV, 11-Apr-2024.) |
Ref | Expression |
---|---|
ellspd.n | ⊢ 𝑁 = (LSpan‘𝑀) |
ellspd.v | ⊢ 𝐵 = (Base‘𝑀) |
ellspd.k | ⊢ 𝐾 = (Base‘𝑆) |
ellspd.s | ⊢ 𝑆 = (Scalar‘𝑀) |
ellspd.z | ⊢ 0 = (0g‘𝑆) |
ellspd.t | ⊢ · = ( ·𝑠 ‘𝑀) |
ellspd.f | ⊢ (𝜑 → 𝐹:𝐼⟶𝐵) |
ellspd.m | ⊢ (𝜑 → 𝑀 ∈ LMod) |
ellspd.i | ⊢ (𝜑 → 𝐼 ∈ 𝑉) |
Ref | Expression |
---|---|
ellspd | ⊢ (𝜑 → (𝑋 ∈ (𝑁‘(𝐹 “ 𝐼)) ↔ ∃𝑓 ∈ (𝐾 ↑m 𝐼)(𝑓 finSupp 0 ∧ 𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹))))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ellspd.f | . . . . . 6 ⊢ (𝜑 → 𝐹:𝐼⟶𝐵) | |
2 | ffn 6737 | . . . . . 6 ⊢ (𝐹:𝐼⟶𝐵 → 𝐹 Fn 𝐼) | |
3 | fnima 6699 | . . . . . 6 ⊢ (𝐹 Fn 𝐼 → (𝐹 “ 𝐼) = ran 𝐹) | |
4 | 1, 2, 3 | 3syl 18 | . . . . 5 ⊢ (𝜑 → (𝐹 “ 𝐼) = ran 𝐹) |
5 | 4 | fveq2d 6911 | . . . 4 ⊢ (𝜑 → (𝑁‘(𝐹 “ 𝐼)) = (𝑁‘ran 𝐹)) |
6 | eqid 2735 | . . . . . 6 ⊢ (𝑓 ∈ (Base‘(𝑆 freeLMod 𝐼)) ↦ (𝑀 Σg (𝑓 ∘f · 𝐹))) = (𝑓 ∈ (Base‘(𝑆 freeLMod 𝐼)) ↦ (𝑀 Σg (𝑓 ∘f · 𝐹))) | |
7 | 6 | rnmpt 5971 | . . . . 5 ⊢ ran (𝑓 ∈ (Base‘(𝑆 freeLMod 𝐼)) ↦ (𝑀 Σg (𝑓 ∘f · 𝐹))) = {𝑎 ∣ ∃𝑓 ∈ (Base‘(𝑆 freeLMod 𝐼))𝑎 = (𝑀 Σg (𝑓 ∘f · 𝐹))} |
8 | eqid 2735 | . . . . . 6 ⊢ (𝑆 freeLMod 𝐼) = (𝑆 freeLMod 𝐼) | |
9 | eqid 2735 | . . . . . 6 ⊢ (Base‘(𝑆 freeLMod 𝐼)) = (Base‘(𝑆 freeLMod 𝐼)) | |
10 | ellspd.v | . . . . . 6 ⊢ 𝐵 = (Base‘𝑀) | |
11 | ellspd.t | . . . . . 6 ⊢ · = ( ·𝑠 ‘𝑀) | |
12 | ellspd.m | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ LMod) | |
13 | ellspd.i | . . . . . 6 ⊢ (𝜑 → 𝐼 ∈ 𝑉) | |
14 | ellspd.s | . . . . . . 7 ⊢ 𝑆 = (Scalar‘𝑀) | |
15 | 14 | a1i 11 | . . . . . 6 ⊢ (𝜑 → 𝑆 = (Scalar‘𝑀)) |
16 | ellspd.n | . . . . . 6 ⊢ 𝑁 = (LSpan‘𝑀) | |
17 | 8, 9, 10, 11, 6, 12, 13, 15, 1, 16 | frlmup3 21838 | . . . . 5 ⊢ (𝜑 → ran (𝑓 ∈ (Base‘(𝑆 freeLMod 𝐼)) ↦ (𝑀 Σg (𝑓 ∘f · 𝐹))) = (𝑁‘ran 𝐹)) |
18 | 7, 17 | eqtr3id 2789 | . . . 4 ⊢ (𝜑 → {𝑎 ∣ ∃𝑓 ∈ (Base‘(𝑆 freeLMod 𝐼))𝑎 = (𝑀 Σg (𝑓 ∘f · 𝐹))} = (𝑁‘ran 𝐹)) |
19 | 5, 18 | eqtr4d 2778 | . . 3 ⊢ (𝜑 → (𝑁‘(𝐹 “ 𝐼)) = {𝑎 ∣ ∃𝑓 ∈ (Base‘(𝑆 freeLMod 𝐼))𝑎 = (𝑀 Σg (𝑓 ∘f · 𝐹))}) |
20 | 19 | eleq2d 2825 | . 2 ⊢ (𝜑 → (𝑋 ∈ (𝑁‘(𝐹 “ 𝐼)) ↔ 𝑋 ∈ {𝑎 ∣ ∃𝑓 ∈ (Base‘(𝑆 freeLMod 𝐼))𝑎 = (𝑀 Σg (𝑓 ∘f · 𝐹))})) |
21 | ovex 7464 | . . . . . 6 ⊢ (𝑀 Σg (𝑓 ∘f · 𝐹)) ∈ V | |
22 | eleq1 2827 | . . . . . 6 ⊢ (𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹)) → (𝑋 ∈ V ↔ (𝑀 Σg (𝑓 ∘f · 𝐹)) ∈ V)) | |
23 | 21, 22 | mpbiri 258 | . . . . 5 ⊢ (𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹)) → 𝑋 ∈ V) |
24 | 23 | rexlimivw 3149 | . . . 4 ⊢ (∃𝑓 ∈ (Base‘(𝑆 freeLMod 𝐼))𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹)) → 𝑋 ∈ V) |
25 | eqeq1 2739 | . . . . 5 ⊢ (𝑎 = 𝑋 → (𝑎 = (𝑀 Σg (𝑓 ∘f · 𝐹)) ↔ 𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹)))) | |
26 | 25 | rexbidv 3177 | . . . 4 ⊢ (𝑎 = 𝑋 → (∃𝑓 ∈ (Base‘(𝑆 freeLMod 𝐼))𝑎 = (𝑀 Σg (𝑓 ∘f · 𝐹)) ↔ ∃𝑓 ∈ (Base‘(𝑆 freeLMod 𝐼))𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹)))) |
27 | 24, 26 | elab3 3689 | . . 3 ⊢ (𝑋 ∈ {𝑎 ∣ ∃𝑓 ∈ (Base‘(𝑆 freeLMod 𝐼))𝑎 = (𝑀 Σg (𝑓 ∘f · 𝐹))} ↔ ∃𝑓 ∈ (Base‘(𝑆 freeLMod 𝐼))𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹))) |
28 | 14 | fvexi 6921 | . . . . . . 7 ⊢ 𝑆 ∈ V |
29 | ellspd.k | . . . . . . . 8 ⊢ 𝐾 = (Base‘𝑆) | |
30 | ellspd.z | . . . . . . . 8 ⊢ 0 = (0g‘𝑆) | |
31 | eqid 2735 | . . . . . . . 8 ⊢ {𝑎 ∈ (𝐾 ↑m 𝐼) ∣ 𝑎 finSupp 0 } = {𝑎 ∈ (𝐾 ↑m 𝐼) ∣ 𝑎 finSupp 0 } | |
32 | 8, 29, 30, 31 | frlmbas 21793 | . . . . . . 7 ⊢ ((𝑆 ∈ V ∧ 𝐼 ∈ 𝑉) → {𝑎 ∈ (𝐾 ↑m 𝐼) ∣ 𝑎 finSupp 0 } = (Base‘(𝑆 freeLMod 𝐼))) |
33 | 28, 13, 32 | sylancr 587 | . . . . . 6 ⊢ (𝜑 → {𝑎 ∈ (𝐾 ↑m 𝐼) ∣ 𝑎 finSupp 0 } = (Base‘(𝑆 freeLMod 𝐼))) |
34 | 33 | eqcomd 2741 | . . . . 5 ⊢ (𝜑 → (Base‘(𝑆 freeLMod 𝐼)) = {𝑎 ∈ (𝐾 ↑m 𝐼) ∣ 𝑎 finSupp 0 }) |
35 | 34 | rexeqdv 3325 | . . . 4 ⊢ (𝜑 → (∃𝑓 ∈ (Base‘(𝑆 freeLMod 𝐼))𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹)) ↔ ∃𝑓 ∈ {𝑎 ∈ (𝐾 ↑m 𝐼) ∣ 𝑎 finSupp 0 }𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹)))) |
36 | breq1 5151 | . . . . 5 ⊢ (𝑎 = 𝑓 → (𝑎 finSupp 0 ↔ 𝑓 finSupp 0 )) | |
37 | 36 | rexrab 3705 | . . . 4 ⊢ (∃𝑓 ∈ {𝑎 ∈ (𝐾 ↑m 𝐼) ∣ 𝑎 finSupp 0 }𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹)) ↔ ∃𝑓 ∈ (𝐾 ↑m 𝐼)(𝑓 finSupp 0 ∧ 𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹)))) |
38 | 35, 37 | bitrdi 287 | . . 3 ⊢ (𝜑 → (∃𝑓 ∈ (Base‘(𝑆 freeLMod 𝐼))𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹)) ↔ ∃𝑓 ∈ (𝐾 ↑m 𝐼)(𝑓 finSupp 0 ∧ 𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹))))) |
39 | 27, 38 | bitrid 283 | . 2 ⊢ (𝜑 → (𝑋 ∈ {𝑎 ∣ ∃𝑓 ∈ (Base‘(𝑆 freeLMod 𝐼))𝑎 = (𝑀 Σg (𝑓 ∘f · 𝐹))} ↔ ∃𝑓 ∈ (𝐾 ↑m 𝐼)(𝑓 finSupp 0 ∧ 𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹))))) |
40 | 20, 39 | bitrd 279 | 1 ⊢ (𝜑 → (𝑋 ∈ (𝑁‘(𝐹 “ 𝐼)) ↔ ∃𝑓 ∈ (𝐾 ↑m 𝐼)(𝑓 finSupp 0 ∧ 𝑋 = (𝑀 Σg (𝑓 ∘f · 𝐹))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2106 {cab 2712 ∃wrex 3068 {crab 3433 Vcvv 3478 class class class wbr 5148 ↦ cmpt 5231 ran crn 5690 “ cima 5692 Fn wfn 6558 ⟶wf 6559 ‘cfv 6563 (class class class)co 7431 ∘f cof 7695 ↑m cmap 8865 finSupp cfsupp 9399 Basecbs 17245 Scalarcsca 17301 ·𝑠 cvsca 17302 0gc0g 17486 Σg cgsu 17487 LModclmod 20875 LSpanclspn 20987 freeLMod cfrlm 21784 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-tp 4636 df-op 4638 df-uni 4913 df-int 4952 df-iun 4998 df-iin 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-se 5642 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-isom 6572 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-of 7697 df-om 7888 df-1st 8013 df-2nd 8014 df-supp 8185 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-2o 8506 df-er 8744 df-map 8867 df-ixp 8937 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-fsupp 9400 df-sup 9480 df-oi 9548 df-card 9977 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-nn 12265 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-7 12332 df-8 12333 df-9 12334 df-n0 12525 df-z 12612 df-dec 12732 df-uz 12877 df-fz 13545 df-fzo 13692 df-seq 14040 df-hash 14367 df-struct 17181 df-sets 17198 df-slot 17216 df-ndx 17228 df-base 17246 df-ress 17275 df-plusg 17311 df-mulr 17312 df-sca 17314 df-vsca 17315 df-ip 17316 df-tset 17317 df-ple 17318 df-ds 17320 df-hom 17322 df-cco 17323 df-0g 17488 df-gsum 17489 df-prds 17494 df-pws 17496 df-mre 17631 df-mrc 17632 df-acs 17634 df-mgm 18666 df-sgrp 18745 df-mnd 18761 df-mhm 18809 df-submnd 18810 df-grp 18967 df-minusg 18968 df-sbg 18969 df-mulg 19099 df-subg 19154 df-ghm 19244 df-cntz 19348 df-cmn 19815 df-abl 19816 df-mgp 20153 df-rng 20171 df-ur 20200 df-ring 20253 df-nzr 20530 df-subrg 20587 df-lmod 20877 df-lss 20948 df-lsp 20988 df-lmhm 21039 df-lbs 21092 df-sra 21190 df-rgmod 21191 df-dsmm 21770 df-frlm 21785 df-uvc 21821 |
This theorem is referenced by: elfilspd 21841 islindf4 21876 ellspds 33376 ply1degltdimlem 33650 fedgmul 33659 |
Copyright terms: Public domain | W3C validator |