| 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 9284 | . . 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 20864 | . . . 4 ⊢ (𝜑 → (𝐺 ∘f · 𝐻):𝐼⟶𝐵) |
| 12 | eldifi 4085 | . . . . . 6 ⊢ (𝑥 ∈ (𝐼 ∖ (𝐺 supp 𝑌)) → 𝑥 ∈ 𝐼) | |
| 13 | 8 | ffnd 6671 | . . . . . . . 8 ⊢ (𝜑 → 𝐺 Fn 𝐼) |
| 14 | 13 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐺 Fn 𝐼) |
| 15 | 9 | ffnd 6671 | . . . . . . . 8 ⊢ (𝜑 → 𝐻 Fn 𝐼) |
| 16 | 15 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐻 Fn 𝐼) |
| 17 | 10 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐼 ∈ 𝑉) |
| 18 | simpr 484 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑥 ∈ 𝐼) | |
| 19 | fnfvof 7649 | . . . . . . 7 ⊢ (((𝐺 Fn 𝐼 ∧ 𝐻 Fn 𝐼) ∧ (𝐼 ∈ 𝑉 ∧ 𝑥 ∈ 𝐼)) → ((𝐺 ∘f · 𝐻)‘𝑥) = ((𝐺‘𝑥) · (𝐻‘𝑥))) | |
| 20 | 14, 16, 17, 18, 19 | syl22anc 839 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → ((𝐺 ∘f · 𝐻)‘𝑥) = ((𝐺‘𝑥) · (𝐻‘𝑥))) |
| 21 | 12, 20 | sylan2 594 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐼 ∖ (𝐺 supp 𝑌))) → ((𝐺 ∘f · 𝐻)‘𝑥) = ((𝐺‘𝑥) · (𝐻‘𝑥))) |
| 22 | ssidd 3959 | . . . . . . 7 ⊢ (𝜑 → (𝐺 supp 𝑌) ⊆ (𝐺 supp 𝑌)) | |
| 23 | lcomfsupp.y | . . . . . . . . 9 ⊢ 𝑌 = (0g‘𝐹) | |
| 24 | 23 | fvexi 6856 | . . . . . . . 8 ⊢ 𝑌 ∈ V |
| 25 | 24 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ V) |
| 26 | 8, 22, 10, 25 | suppssr 8147 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐼 ∖ (𝐺 supp 𝑌))) → (𝐺‘𝑥) = 𝑌) |
| 27 | 26 | oveq1d 7383 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐼 ∖ (𝐺 supp 𝑌))) → ((𝐺‘𝑥) · (𝐻‘𝑥)) = (𝑌 · (𝐻‘𝑥))) |
| 28 | 9 | ffvelcdmda 7038 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝐻‘𝑥) ∈ 𝐵) |
| 29 | lcomfsupp.z | . . . . . . . 8 ⊢ 0 = (0g‘𝑊) | |
| 30 | 6, 3, 5, 23, 29 | lmod0vs 20858 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ (𝐻‘𝑥) ∈ 𝐵) → (𝑌 · (𝐻‘𝑥)) = 0 ) |
| 31 | 7, 28, 30 | syl2an2r 686 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑌 · (𝐻‘𝑥)) = 0 ) |
| 32 | 12, 31 | sylan2 594 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐼 ∖ (𝐺 supp 𝑌))) → (𝑌 · (𝐻‘𝑥)) = 0 ) |
| 33 | 21, 27, 32 | 3eqtrd 2776 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐼 ∖ (𝐺 supp 𝑌))) → ((𝐺 ∘f · 𝐻)‘𝑥) = 0 ) |
| 34 | 11, 33 | suppss 8146 | . . 3 ⊢ (𝜑 → ((𝐺 ∘f · 𝐻) supp 0 ) ⊆ (𝐺 supp 𝑌)) |
| 35 | 2, 34 | ssfid 9181 | . 2 ⊢ (𝜑 → ((𝐺 ∘f · 𝐻) supp 0 ) ∈ Fin) |
| 36 | 13, 15, 10, 10 | offun 7646 | . . 3 ⊢ (𝜑 → Fun (𝐺 ∘f · 𝐻)) |
| 37 | ovexd 7403 | . . 3 ⊢ (𝜑 → (𝐺 ∘f · 𝐻) ∈ V) | |
| 38 | 29 | fvexi 6856 | . . . 4 ⊢ 0 ∈ V |
| 39 | 38 | a1i 11 | . . 3 ⊢ (𝜑 → 0 ∈ V) |
| 40 | funisfsupp 9282 | . . 3 ⊢ ((Fun (𝐺 ∘f · 𝐻) ∧ (𝐺 ∘f · 𝐻) ∈ V ∧ 0 ∈ V) → ((𝐺 ∘f · 𝐻) finSupp 0 ↔ ((𝐺 ∘f · 𝐻) supp 0 ) ∈ Fin)) | |
| 41 | 36, 37, 39, 40 | syl3anc 1374 | . 2 ⊢ (𝜑 → ((𝐺 ∘f · 𝐻) finSupp 0 ↔ ((𝐺 ∘f · 𝐻) supp 0 ) ∈ Fin)) |
| 42 | 35, 41 | mpbird 257 | 1 ⊢ (𝜑 → (𝐺 ∘f · 𝐻) finSupp 0 ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3442 ∖ cdif 3900 class class class wbr 5100 Fun wfun 6494 Fn wfn 6495 ⟶wf 6496 ‘cfv 6500 (class class class)co 7368 ∘f cof 7630 supp csupp 8112 Fincfn 8895 finSupp cfsupp 9276 Basecbs 17148 Scalarcsca 17192 ·𝑠 cvsca 17193 0gc0g 17371 LModclmod 20823 |
| 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 5226 ax-sep 5243 ax-nul 5253 ax-pr 5379 ax-un 7690 |
| 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-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-of 7632 df-om 7819 df-supp 8113 df-1o 8407 df-en 8896 df-fin 8899 df-fsupp 9277 df-0g 17373 df-mgm 18577 df-sgrp 18656 df-mnd 18672 df-grp 18878 df-ring 20182 df-lmod 20825 |
| This theorem is referenced by: islindf4 21805 fedgmullem2 33807 |
| Copyright terms: Public domain | W3C validator |