| 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 20935 | . . . . 5 ⊢ (𝑀 ∈ LMod → 0 ∈ 𝑅) |
| 5 | 4 | ad2antrr 736 | . . . 4 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝑉) → 0 ∈ 𝑅) |
| 6 | lincvalsc0.f | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ 0 ) | |
| 7 | 5, 6 | fmptd 7091 | . . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → 𝐹:𝑉⟶𝑅) |
| 8 | 2 | fvexi 6877 | . . . . 5 ⊢ 𝑅 ∈ V |
| 9 | 8 | a1i 11 | . . . 4 ⊢ (𝑀 ∈ LMod → 𝑅 ∈ V) |
| 10 | elmapg 8816 | . . . 4 ⊢ ((𝑅 ∈ V ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 ∈ (𝑅 ↑m 𝑉) ↔ 𝐹:𝑉⟶𝑅)) | |
| 11 | 9, 10 | sylan 589 | . . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 ∈ (𝑅 ↑m 𝑉) ↔ 𝐹:𝑉⟶𝑅)) |
| 12 | 7, 11 | mpbird 259 | . 2 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → 𝐹 ∈ (𝑅 ↑m 𝑉)) |
| 13 | eqidd 2762 | . . . . . . 7 ⊢ (𝑥 = 𝑣 → 0 = 0 ) | |
| 14 | 13 | cbvmptv 5203 | . . . . . 6 ⊢ (𝑥 ∈ 𝑉 ↦ 0 ) = (𝑣 ∈ 𝑉 ↦ 0 ) |
| 15 | 6, 14 | eqtri 2784 | . . . . 5 ⊢ 𝐹 = (𝑣 ∈ 𝑉 ↦ 0 ) |
| 16 | simpr 488 | . . . . 5 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → 𝑉 ∈ 𝒫 𝐵) | |
| 17 | 3 | fvexi 6877 | . . . . . 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 8162 | . . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 supp 0 ) = {𝑣 ∈ 𝑉 ∣ 0 ≠ 0 }) |
| 21 | neirr 2965 | . . . . . . . 8 ⊢ ¬ 0 ≠ 0 | |
| 22 | 21 | a1i 11 | . . . . . . 7 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → ¬ 0 ≠ 0 ) |
| 23 | 22 | ralrimivw 3157 | . . . . . 6 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → ∀𝑣 ∈ 𝑉 ¬ 0 ≠ 0 ) |
| 24 | rabeq0 4341 | . . . . . 6 ⊢ ({𝑣 ∈ 𝑉 ∣ 0 ≠ 0 } = ∅ ↔ ∀𝑣 ∈ 𝑉 ¬ 0 ≠ 0 ) | |
| 25 | 23, 24 | sylibr 236 | . . . . 5 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → {𝑣 ∈ 𝑉 ∣ 0 ≠ 0 } = ∅) |
| 26 | 0fi 9019 | . . . . . 6 ⊢ ∅ ∈ Fin | |
| 27 | 26 | a1i 11 | . . . . 5 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → ∅ ∈ Fin) |
| 28 | 25, 27 | eqeltrd 2861 | . . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → {𝑣 ∈ 𝑉 ∣ 0 ≠ 0 } ∈ Fin) |
| 29 | 20, 28 | eqeltrd 2861 | . . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 supp 0 ) ∈ Fin) |
| 30 | 6 | funmpt2 6556 | . . . . 5 ⊢ Fun 𝐹 |
| 31 | 30 | a1i 11 | . . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → Fun 𝐹) |
| 32 | funisfsupp 9310 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝐹 ∈ (𝑅 ↑m 𝑉) ∧ 0 ∈ V) → (𝐹 finSupp 0 ↔ (𝐹 supp 0 ) ∈ Fin)) | |
| 33 | 31, 12, 18, 32 | syl3anc 1389 | . . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 finSupp 0 ↔ (𝐹 supp 0 ) ∈ Fin)) |
| 34 | 29, 33 | mpbird 259 | . 2 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → 𝐹 finSupp 0 ) |
| 35 | lincvalsc0.b | . . 3 ⊢ 𝐵 = (Base‘𝑀) | |
| 36 | lincvalsc0.z | . . 3 ⊢ 𝑍 = (0g‘𝑀) | |
| 37 | 35, 1, 3, 36, 6 | lincvalsc0 49007 | . 2 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹( linC ‘𝑀)𝑉) = 𝑍) |
| 38 | 12, 34, 37 | 3jca 1140 | 1 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 ∈ (𝑅 ↑m 𝑉) ∧ 𝐹 finSupp 0 ∧ (𝐹( linC ‘𝑀)𝑉) = 𝑍)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 ≠ wne 2956 ∀wral 3075 {crab 3413 Vcvv 3453 ∅c0 4285 𝒫 cpw 4554 class class class wbr 5099 ↦ cmpt 5180 Fun wfun 6511 ⟶wf 6513 ‘cfv 6517 (class class class)co 7392 supp csupp 8135 ↑m cmap 8803 Fincfn 8923 finSupp cfsupp 9304 Basecbs 17228 Scalarcsca 17272 0gc0g 17451 LModclmod 20907 linC clinc 48990 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6284 df-ord 6345 df-on 6346 df-lim 6347 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-riota 7349 df-ov 7395 df-oprab 7396 df-mpo 7397 df-om 7843 df-1st 7966 df-2nd 7967 df-supp 8136 df-frecs 8257 df-wrecs 8288 df-recs 8337 df-rdg 8376 df-map 8805 df-en 8924 df-fin 8927 df-fsupp 9305 df-seq 14012 df-0g 17453 df-gsum 17454 df-mgm 18657 df-sgrp 18736 df-mnd 18752 df-grp 18961 df-ring 20264 df-lmod 20909 df-linc 48992 |
| This theorem is referenced by: lcoel0 49014 |
| Copyright terms: Public domain | W3C validator |