| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lcomfsupp | Structured version Visualization version GIF version | ||
| Description: A linear-combination sum is finitely supported if the coefficients are. (Contributed by Stefan O'Rear, 28-Feb-2015.) (Revised by AV, 15-Jul-2019.) |
| Ref | Expression |
|---|---|
| lcomf.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| lcomf.k | ⊢ 𝐾 = (Base‘𝐹) |
| lcomf.s | ⊢ · = ( ·𝑠 ‘𝑊) |
| lcomf.b | ⊢ 𝐵 = (Base‘𝑊) |
| lcomf.w | ⊢ (𝜑 → 𝑊 ∈ LMod) |
| lcomf.g | ⊢ (𝜑 → 𝐺:𝐼⟶𝐾) |
| lcomf.h | ⊢ (𝜑 → 𝐻:𝐼⟶𝐵) |
| lcomf.i | ⊢ (𝜑 → 𝐼 ∈ 𝑉) |
| lcomfsupp.z | ⊢ 0 = (0g‘𝑊) |
| lcomfsupp.y | ⊢ 𝑌 = (0g‘𝐹) |
| lcomfsupp.j | ⊢ (𝜑 → 𝐺 finSupp 𝑌) |
| Ref | Expression |
|---|---|
| lcomfsupp | ⊢ (𝜑 → (𝐺 ∘f · 𝐻) finSupp 0 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lcomfsupp.j | . . . 4 ⊢ (𝜑 → 𝐺 finSupp 𝑌) | |
| 2 | 1 | fsuppimpd 9332 | . . 3 ⊢ (𝜑 → (𝐺 supp 𝑌) ∈ Fin) |
| 3 | lcomf.f | . . . . 5 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 4 | lcomf.k | . . . . 5 ⊢ 𝐾 = (Base‘𝐹) | |
| 5 | lcomf.s | . . . . 5 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 6 | lcomf.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑊) | |
| 7 | lcomf.w | . . . . 5 ⊢ (𝜑 → 𝑊 ∈ LMod) | |
| 8 | lcomf.g | . . . . 5 ⊢ (𝜑 → 𝐺:𝐼⟶𝐾) | |
| 9 | lcomf.h | . . . . 5 ⊢ (𝜑 → 𝐻:𝐼⟶𝐵) | |
| 10 | lcomf.i | . . . . 5 ⊢ (𝜑 → 𝐼 ∈ 𝑉) | |
| 11 | 3, 4, 5, 6, 7, 8, 9, 10 | lcomf 21051 | . . . 4 ⊢ (𝜑 → (𝐺 ∘f · 𝐻):𝐼⟶𝐵) |
| 12 | eldifi 4085 | . . . . . 6 ⊢ (𝑥 ∈ (𝐼 ∖ (𝐺 supp 𝑌)) → 𝑥 ∈ 𝐼) | |
| 13 | 8 | ffnd 6710 | . . . . . . . 8 ⊢ (𝜑 → 𝐺 Fn 𝐼) |
| 14 | 13 | adantr 486 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐺 Fn 𝐼) |
| 15 | 9 | ffnd 6710 | . . . . . . . 8 ⊢ (𝜑 → 𝐻 Fn 𝐼) |
| 16 | 15 | adantr 486 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐻 Fn 𝐼) |
| 17 | 10 | adantr 486 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐼 ∈ 𝑉) |
| 18 | simpr 490 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑥 ∈ 𝐼) | |
| 19 | fnfvof 7697 | . . . . . . 7 ⊢ (((𝐺 Fn 𝐼 ∧ 𝐻 Fn 𝐼) ∧ (𝐼 ∈ 𝑉 ∧ 𝑥 ∈ 𝐼)) → ((𝐺 ∘f · 𝐻)‘𝑥) = ((𝐺‘𝑥) · (𝐻‘𝑥))) | |
| 20 | 14, 16, 17, 18, 19 | syl22anc 852 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → ((𝐺 ∘f · 𝐻)‘𝑥) = ((𝐺‘𝑥) · (𝐻‘𝑥))) |
| 21 | 12, 20 | sylan2 605 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐼 ∖ (𝐺 supp 𝑌))) → ((𝐺 ∘f · 𝐻)‘𝑥) = ((𝐺‘𝑥) · (𝐻‘𝑥))) |
| 22 | ssidd 3961 | . . . . . . 7 ⊢ (𝜑 → (𝐺 supp 𝑌) ⊆ (𝐺 supp 𝑌)) | |
| 23 | lcomfsupp.y | . . . . . . . . 9 ⊢ 𝑌 = (0g‘𝐹) | |
| 24 | 23 | fvexi 6899 | . . . . . . . 8 ⊢ 𝑌 ∈ V |
| 25 | 24 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ V) |
| 26 | 8, 22, 10, 25 | suppssr 8193 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐼 ∖ (𝐺 supp 𝑌))) → (𝐺‘𝑥) = 𝑌) |
| 27 | 26 | oveq1d 7431 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐼 ∖ (𝐺 supp 𝑌))) → ((𝐺‘𝑥) · (𝐻‘𝑥)) = (𝑌 · (𝐻‘𝑥))) |
| 28 | 9 | ffvelcdmda 7083 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝐻‘𝑥) ∈ 𝐵) |
| 29 | lcomfsupp.z | . . . . . . . 8 ⊢ 0 = (0g‘𝑊) | |
| 30 | 6, 3, 5, 23, 29 | lmod0vs 21045 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ (𝐻‘𝑥) ∈ 𝐵) → (𝑌 · (𝐻‘𝑥)) = 0 ) |
| 31 | 7, 28, 30 | syl2an2r 698 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑌 · (𝐻‘𝑥)) = 0 ) |
| 32 | 12, 31 | sylan2 605 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐼 ∖ (𝐺 supp 𝑌))) → (𝑌 · (𝐻‘𝑥)) = 0 ) |
| 33 | 21, 27, 32 | 3eqtrd 2804 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐼 ∖ (𝐺 supp 𝑌))) → ((𝐺 ∘f · 𝐻)‘𝑥) = 0 ) |
| 34 | 11, 33 | suppss 8192 | . . 3 ⊢ (𝜑 → ((𝐺 ∘f · 𝐻) supp 0 ) ⊆ (𝐺 supp 𝑌)) |
| 35 | 2, 34 | ssfid 9232 | . 2 ⊢ (𝜑 → ((𝐺 ∘f · 𝐻) supp 0 ) ∈ Fin) |
| 36 | 13, 15, 10, 10 | offun 7694 | . . 3 ⊢ (𝜑 → Fun (𝐺 ∘f · 𝐻)) |
| 37 | ovexd 7451 | . . 3 ⊢ (𝜑 → (𝐺 ∘f · 𝐻) ∈ V) | |
| 38 | 29 | fvexi 6899 | . . . 4 ⊢ 0 ∈ V |
| 39 | 38 | a1i 11 | . . 3 ⊢ (𝜑 → 0 ∈ V) |
| 40 | funisfsupp 9330 | . . 3 ⊢ ((Fun (𝐺 ∘f · 𝐻) ∧ (𝐺 ∘f · 𝐻) ∈ V ∧ 0 ∈ V) → ((𝐺 ∘f · 𝐻) finSupp 0 ↔ ((𝐺 ∘f · 𝐻) supp 0 ) ∈ Fin)) | |
| 41 | 36, 37, 39, 40 | syl3anc 1398 | . 2 ⊢ (𝜑 → ((𝐺 ∘f · 𝐻) finSupp 0 ↔ ((𝐺 ∘f · 𝐻) supp 0 ) ∈ Fin)) |
| 42 | 35, 41 | mpbird 260 | 1 ⊢ (𝜑 → (𝐺 ∘f · 𝐻) finSupp 0 ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 Vcvv 3457 ∖ cdif 3903 class class class wbr 5111 Fun wfun 6534 Fn wfn 6535 ⟶wf 6536 ‘cfv 6540 (class class class)co 7416 ∘f cof 7678 supp csupp 8158 Fincfn 8945 finSupp cfsupp 9324 Basecbs 17286 Scalarcsca 17330 ·𝑠 cvsca 17331 0gc0g 17509 LModclmod 21010 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pr 5406 ax-un 7738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-of 7680 df-om 7865 df-supp 8159 df-1o 8455 df-en 8946 df-fin 8949 df-fsupp 9325 df-0g 17511 df-mgm 18715 df-sgrp 18798 df-mnd 18814 df-grp 19026 df-ring 20340 df-lmod 21012 |
| This theorem is used by: islindf4 22017 fedgmullem2 34043 |
| Copyright terms: Public domain | W3C validator |