| 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 20823 | . . . . 5 ⊢ (𝑀 ∈ LMod → 0 ∈ 𝑅) |
| 5 | 4 | ad2antrr 726 | . . . 4 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝑉) → 0 ∈ 𝑅) |
| 6 | lincvalsc0.f | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ 0 ) | |
| 7 | 5, 6 | fmptd 7053 | . . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → 𝐹:𝑉⟶𝑅) |
| 8 | 2 | fvexi 6842 | . . . . 5 ⊢ 𝑅 ∈ V |
| 9 | 8 | a1i 11 | . . . 4 ⊢ (𝑀 ∈ LMod → 𝑅 ∈ V) |
| 10 | elmapg 8769 | . . . 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 5197 | . . . . . 6 ⊢ (𝑥 ∈ 𝑉 ↦ 0 ) = (𝑣 ∈ 𝑉 ↦ 0 ) |
| 15 | 6, 14 | eqtri 2756 | . . . . 5 ⊢ 𝐹 = (𝑣 ∈ 𝑉 ↦ 0 ) |
| 16 | simpr 484 | . . . . 5 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → 𝑉 ∈ 𝒫 𝐵) | |
| 17 | 3 | fvexi 6842 | . . . . . 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 8123 | . . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 supp 0 ) = {𝑣 ∈ 𝑉 ∣ 0 ≠ 0 }) |
| 21 | neirr 2938 | . . . . . . . 8 ⊢ ¬ 0 ≠ 0 | |
| 22 | 21 | a1i 11 | . . . . . . 7 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → ¬ 0 ≠ 0 ) |
| 23 | 22 | ralrimivw 3129 | . . . . . 6 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → ∀𝑣 ∈ 𝑉 ¬ 0 ≠ 0 ) |
| 24 | rabeq0 4337 | . . . . . 6 ⊢ ({𝑣 ∈ 𝑉 ∣ 0 ≠ 0 } = ∅ ↔ ∀𝑣 ∈ 𝑉 ¬ 0 ≠ 0 ) | |
| 25 | 23, 24 | sylibr 234 | . . . . 5 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → {𝑣 ∈ 𝑉 ∣ 0 ≠ 0 } = ∅) |
| 26 | 0fi 8971 | . . . . . 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 6525 | . . . . 5 ⊢ Fun 𝐹 |
| 31 | 30 | a1i 11 | . . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → Fun 𝐹) |
| 32 | funisfsupp 9258 | . . . 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 48546 | . 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 2929 ∀wral 3048 {crab 3396 Vcvv 3437 ∅c0 4282 𝒫 cpw 4549 class class class wbr 5093 ↦ cmpt 5174 Fun wfun 6480 ⟶wf 6482 ‘cfv 6486 (class class class)co 7352 supp csupp 8096 ↑m cmap 8756 Fincfn 8875 finSupp cfsupp 9252 Basecbs 17122 Scalarcsca 17166 0gc0g 17345 LModclmod 20795 linC clinc 48529 |
| 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 5219 ax-sep 5236 ax-nul 5246 ax-pow 5305 ax-pr 5372 ax-un 7674 |
| 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 2882 df-ne 2930 df-ral 3049 df-rex 3058 df-rmo 3347 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-op 4582 df-uni 4859 df-iun 4943 df-br 5094 df-opab 5156 df-mpt 5175 df-tr 5201 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7309 df-ov 7355 df-oprab 7356 df-mpo 7357 df-om 7803 df-1st 7927 df-2nd 7928 df-supp 8097 df-frecs 8217 df-wrecs 8248 df-recs 8297 df-rdg 8335 df-map 8758 df-en 8876 df-fin 8879 df-fsupp 9253 df-seq 13911 df-0g 17347 df-gsum 17348 df-mgm 18550 df-sgrp 18629 df-mnd 18645 df-grp 18851 df-ring 20155 df-lmod 20797 df-linc 48531 |
| This theorem is referenced by: lcoel0 48553 |
| Copyright terms: Public domain | W3C validator |