| 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 20851 | . . . . 5 ⊢ (𝑀 ∈ LMod → 0 ∈ 𝑅) |
| 5 | 4 | ad2antrr 727 | . . . 4 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝑉) → 0 ∈ 𝑅) |
| 6 | lincvalsc0.f | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ 0 ) | |
| 7 | 5, 6 | fmptd 7068 | . . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → 𝐹:𝑉⟶𝑅) |
| 8 | 2 | fvexi 6856 | . . . . 5 ⊢ 𝑅 ∈ V |
| 9 | 8 | a1i 11 | . . . 4 ⊢ (𝑀 ∈ LMod → 𝑅 ∈ V) |
| 10 | elmapg 8788 | . . . 4 ⊢ ((𝑅 ∈ V ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 ∈ (𝑅 ↑m 𝑉) ↔ 𝐹:𝑉⟶𝑅)) | |
| 11 | 9, 10 | sylan 581 | . . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 ∈ (𝑅 ↑m 𝑉) ↔ 𝐹:𝑉⟶𝑅)) |
| 12 | 7, 11 | mpbird 257 | . 2 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → 𝐹 ∈ (𝑅 ↑m 𝑉)) |
| 13 | eqidd 2738 | . . . . . . 7 ⊢ (𝑥 = 𝑣 → 0 = 0 ) | |
| 14 | 13 | cbvmptv 5204 | . . . . . 6 ⊢ (𝑥 ∈ 𝑉 ↦ 0 ) = (𝑣 ∈ 𝑉 ↦ 0 ) |
| 15 | 6, 14 | eqtri 2760 | . . . . 5 ⊢ 𝐹 = (𝑣 ∈ 𝑉 ↦ 0 ) |
| 16 | simpr 484 | . . . . 5 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → 𝑉 ∈ 𝒫 𝐵) | |
| 17 | 3 | fvexi 6856 | . . . . . 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 8139 | . . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 supp 0 ) = {𝑣 ∈ 𝑉 ∣ 0 ≠ 0 }) |
| 21 | neirr 2942 | . . . . . . . 8 ⊢ ¬ 0 ≠ 0 | |
| 22 | 21 | a1i 11 | . . . . . . 7 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → ¬ 0 ≠ 0 ) |
| 23 | 22 | ralrimivw 3134 | . . . . . 6 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → ∀𝑣 ∈ 𝑉 ¬ 0 ≠ 0 ) |
| 24 | rabeq0 4342 | . . . . . 6 ⊢ ({𝑣 ∈ 𝑉 ∣ 0 ≠ 0 } = ∅ ↔ ∀𝑣 ∈ 𝑉 ¬ 0 ≠ 0 ) | |
| 25 | 23, 24 | sylibr 234 | . . . . 5 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → {𝑣 ∈ 𝑉 ∣ 0 ≠ 0 } = ∅) |
| 26 | 0fi 8991 | . . . . . 6 ⊢ ∅ ∈ Fin | |
| 27 | 26 | a1i 11 | . . . . 5 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → ∅ ∈ Fin) |
| 28 | 25, 27 | eqeltrd 2837 | . . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → {𝑣 ∈ 𝑉 ∣ 0 ≠ 0 } ∈ Fin) |
| 29 | 20, 28 | eqeltrd 2837 | . . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 supp 0 ) ∈ Fin) |
| 30 | 6 | funmpt2 6539 | . . . . 5 ⊢ Fun 𝐹 |
| 31 | 30 | a1i 11 | . . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → Fun 𝐹) |
| 32 | funisfsupp 9282 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝐹 ∈ (𝑅 ↑m 𝑉) ∧ 0 ∈ V) → (𝐹 finSupp 0 ↔ (𝐹 supp 0 ) ∈ Fin)) | |
| 33 | 31, 12, 18, 32 | syl3anc 1374 | . . 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 48775 | . 2 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹( linC ‘𝑀)𝑉) = 𝑍) |
| 38 | 12, 34, 37 | 3jca 1129 | 1 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 ∈ (𝑅 ↑m 𝑉) ∧ 𝐹 finSupp 0 ∧ (𝐹( linC ‘𝑀)𝑉) = 𝑍)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∀wral 3052 {crab 3401 Vcvv 3442 ∅c0 4287 𝒫 cpw 4556 class class class wbr 5100 ↦ cmpt 5181 Fun wfun 6494 ⟶wf 6496 ‘cfv 6500 (class class class)co 7368 supp csupp 8112 ↑m cmap 8775 Fincfn 8895 finSupp cfsupp 9276 Basecbs 17148 Scalarcsca 17192 0gc0g 17371 LModclmod 20823 linC clinc 48758 |
| 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-pow 5312 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-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 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-om 7819 df-1st 7943 df-2nd 7944 df-supp 8113 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-map 8777 df-en 8896 df-fin 8899 df-fsupp 9277 df-seq 13937 df-0g 17373 df-gsum 17374 df-mgm 18577 df-sgrp 18656 df-mnd 18672 df-grp 18878 df-ring 20182 df-lmod 20825 df-linc 48760 |
| This theorem is referenced by: lcoel0 48782 |
| Copyright terms: Public domain | W3C validator |