| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > lcoc0 | Structured version Visualization version GIF version | ||
| Description: Properties of a linear combination where all scalars are 0. (Contributed by AV, 12-Apr-2019.) (Revised by AV, 28-Jul-2019.) |
| Ref | Expression |
|---|---|
| lincvalsc0.b | ⊢ 𝐵 = (Base‘𝑀) |
| lincvalsc0.s | ⊢ 𝑆 = (Scalar‘𝑀) |
| lincvalsc0.0 | ⊢ 0 = (0g‘𝑆) |
| lincvalsc0.z | ⊢ 𝑍 = (0g‘𝑀) |
| lincvalsc0.f | ⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ 0 ) |
| lcoc0.r | ⊢ 𝑅 = (Base‘𝑆) |
| Ref | Expression |
|---|---|
| lcoc0 | ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 ∈ (𝑅 ↑m 𝑉) ∧ 𝐹 finSupp 0 ∧ (𝐹( linC ‘𝑀)𝑉) = 𝑍)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lincvalsc0.s | . . . . . 6 ⊢ 𝑆 = (Scalar‘𝑀) | |
| 2 | lcoc0.r | . . . . . 6 ⊢ 𝑅 = (Base‘𝑆) | |
| 3 | lincvalsc0.0 | . . . . . 6 ⊢ 0 = (0g‘𝑆) | |
| 4 | 1, 2, 3 | lmod0cl 20831 | . . . . 5 ⊢ (𝑀 ∈ LMod → 0 ∈ 𝑅) |
| 5 | 4 | ad2antrr 726 | . . . 4 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝑉) → 0 ∈ 𝑅) |
| 6 | lincvalsc0.f | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ 0 ) | |
| 7 | 5, 6 | fmptd 7056 | . . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → 𝐹:𝑉⟶𝑅) |
| 8 | 2 | fvexi 6845 | . . . . 5 ⊢ 𝑅 ∈ V |
| 9 | 8 | a1i 11 | . . . 4 ⊢ (𝑀 ∈ LMod → 𝑅 ∈ V) |
| 10 | elmapg 8772 | . . . 4 ⊢ ((𝑅 ∈ V ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 ∈ (𝑅 ↑m 𝑉) ↔ 𝐹:𝑉⟶𝑅)) | |
| 11 | 9, 10 | sylan 580 | . . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 ∈ (𝑅 ↑m 𝑉) ↔ 𝐹:𝑉⟶𝑅)) |
| 12 | 7, 11 | mpbird 257 | . 2 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → 𝐹 ∈ (𝑅 ↑m 𝑉)) |
| 13 | eqidd 2734 | . . . . . . 7 ⊢ (𝑥 = 𝑣 → 0 = 0 ) | |
| 14 | 13 | cbvmptv 5199 | . . . . . 6 ⊢ (𝑥 ∈ 𝑉 ↦ 0 ) = (𝑣 ∈ 𝑉 ↦ 0 ) |
| 15 | 6, 14 | eqtri 2756 | . . . . 5 ⊢ 𝐹 = (𝑣 ∈ 𝑉 ↦ 0 ) |
| 16 | simpr 484 | . . . . 5 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → 𝑉 ∈ 𝒫 𝐵) | |
| 17 | 3 | fvexi 6845 | . . . . . 6 ⊢ 0 ∈ V |
| 18 | 17 | a1i 11 | . . . . 5 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → 0 ∈ V) |
| 19 | 17 | a1i 11 | . . . . 5 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) ∧ 𝑣 ∈ 𝑉) → 0 ∈ V) |
| 20 | 15, 16, 18, 19 | mptsuppd 8126 | . . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 supp 0 ) = {𝑣 ∈ 𝑉 ∣ 0 ≠ 0 }) |
| 21 | neirr 2939 | . . . . . . . 8 ⊢ ¬ 0 ≠ 0 | |
| 22 | 21 | a1i 11 | . . . . . . 7 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → ¬ 0 ≠ 0 ) |
| 23 | 22 | ralrimivw 3130 | . . . . . 6 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → ∀𝑣 ∈ 𝑉 ¬ 0 ≠ 0 ) |
| 24 | rabeq0 4339 | . . . . . 6 ⊢ ({𝑣 ∈ 𝑉 ∣ 0 ≠ 0 } = ∅ ↔ ∀𝑣 ∈ 𝑉 ¬ 0 ≠ 0 ) | |
| 25 | 23, 24 | sylibr 234 | . . . . 5 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → {𝑣 ∈ 𝑉 ∣ 0 ≠ 0 } = ∅) |
| 26 | 0fi 8974 | . . . . . 6 ⊢ ∅ ∈ Fin | |
| 27 | 26 | a1i 11 | . . . . 5 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → ∅ ∈ Fin) |
| 28 | 25, 27 | eqeltrd 2833 | . . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → {𝑣 ∈ 𝑉 ∣ 0 ≠ 0 } ∈ Fin) |
| 29 | 20, 28 | eqeltrd 2833 | . . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 supp 0 ) ∈ Fin) |
| 30 | 6 | funmpt2 6528 | . . . . 5 ⊢ Fun 𝐹 |
| 31 | 30 | a1i 11 | . . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → Fun 𝐹) |
| 32 | funisfsupp 9261 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝐹 ∈ (𝑅 ↑m 𝑉) ∧ 0 ∈ V) → (𝐹 finSupp 0 ↔ (𝐹 supp 0 ) ∈ Fin)) | |
| 33 | 31, 12, 18, 32 | syl3anc 1373 | . . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 finSupp 0 ↔ (𝐹 supp 0 ) ∈ Fin)) |
| 34 | 29, 33 | mpbird 257 | . 2 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → 𝐹 finSupp 0 ) |
| 35 | lincvalsc0.b | . . 3 ⊢ 𝐵 = (Base‘𝑀) | |
| 36 | lincvalsc0.z | . . 3 ⊢ 𝑍 = (0g‘𝑀) | |
| 37 | 35, 1, 3, 36, 6 | lincvalsc0 48536 | . 2 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹( linC ‘𝑀)𝑉) = 𝑍) |
| 38 | 12, 34, 37 | 3jca 1128 | 1 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 ∈ (𝑅 ↑m 𝑉) ∧ 𝐹 finSupp 0 ∧ (𝐹( linC ‘𝑀)𝑉) = 𝑍)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ≠ wne 2930 ∀wral 3049 {crab 3397 Vcvv 3438 ∅c0 4284 𝒫 cpw 4551 class class class wbr 5095 ↦ cmpt 5176 Fun wfun 6483 ⟶wf 6485 ‘cfv 6489 (class class class)co 7355 supp csupp 8099 ↑m cmap 8759 Fincfn 8878 finSupp cfsupp 9255 Basecbs 17130 Scalarcsca 17174 0gc0g 17353 LModclmod 20803 linC clinc 48519 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-iun 4945 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7312 df-ov 7358 df-oprab 7359 df-mpo 7360 df-om 7806 df-1st 7930 df-2nd 7931 df-supp 8100 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-map 8761 df-en 8879 df-fin 8882 df-fsupp 9256 df-seq 13919 df-0g 17355 df-gsum 17356 df-mgm 18558 df-sgrp 18637 df-mnd 18653 df-grp 18859 df-ring 20163 df-lmod 20805 df-linc 48521 |
| This theorem is referenced by: lcoel0 48543 |
| Copyright terms: Public domain | W3C validator |