![]() |
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 19653 | . . . . 5 ⊢ (𝑀 ∈ LMod → 0 ∈ 𝑅) |
5 | 4 | ad2antrr 725 | . . . 4 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝑉) → 0 ∈ 𝑅) |
6 | lincvalsc0.f | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ 0 ) | |
7 | 5, 6 | fmptd 6855 | . . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → 𝐹:𝑉⟶𝑅) |
8 | 2 | fvexi 6659 | . . . . 5 ⊢ 𝑅 ∈ V |
9 | 8 | a1i 11 | . . . 4 ⊢ (𝑀 ∈ LMod → 𝑅 ∈ V) |
10 | elmapg 8402 | . . . 4 ⊢ ((𝑅 ∈ V ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 ∈ (𝑅 ↑m 𝑉) ↔ 𝐹:𝑉⟶𝑅)) | |
11 | 9, 10 | sylan 583 | . . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 ∈ (𝑅 ↑m 𝑉) ↔ 𝐹:𝑉⟶𝑅)) |
12 | 7, 11 | mpbird 260 | . 2 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → 𝐹 ∈ (𝑅 ↑m 𝑉)) |
13 | eqidd 2799 | . . . . . . 7 ⊢ (𝑥 = 𝑣 → 0 = 0 ) | |
14 | 13 | cbvmptv 5133 | . . . . . 6 ⊢ (𝑥 ∈ 𝑉 ↦ 0 ) = (𝑣 ∈ 𝑉 ↦ 0 ) |
15 | 6, 14 | eqtri 2821 | . . . . 5 ⊢ 𝐹 = (𝑣 ∈ 𝑉 ↦ 0 ) |
16 | simpr 488 | . . . . 5 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → 𝑉 ∈ 𝒫 𝐵) | |
17 | 3 | fvexi 6659 | . . . . . 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 7836 | . . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 supp 0 ) = {𝑣 ∈ 𝑉 ∣ 0 ≠ 0 }) |
21 | neirr 2996 | . . . . . . . 8 ⊢ ¬ 0 ≠ 0 | |
22 | 21 | a1i 11 | . . . . . . 7 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → ¬ 0 ≠ 0 ) |
23 | 22 | ralrimivw 3150 | . . . . . 6 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → ∀𝑣 ∈ 𝑉 ¬ 0 ≠ 0 ) |
24 | rabeq0 4292 | . . . . . 6 ⊢ ({𝑣 ∈ 𝑉 ∣ 0 ≠ 0 } = ∅ ↔ ∀𝑣 ∈ 𝑉 ¬ 0 ≠ 0 ) | |
25 | 23, 24 | sylibr 237 | . . . . 5 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → {𝑣 ∈ 𝑉 ∣ 0 ≠ 0 } = ∅) |
26 | 0fin 8730 | . . . . . 6 ⊢ ∅ ∈ Fin | |
27 | 26 | a1i 11 | . . . . 5 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → ∅ ∈ Fin) |
28 | 25, 27 | eqeltrd 2890 | . . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → {𝑣 ∈ 𝑉 ∣ 0 ≠ 0 } ∈ Fin) |
29 | 20, 28 | eqeltrd 2890 | . . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 supp 0 ) ∈ Fin) |
30 | 6 | funmpt2 6363 | . . . . 5 ⊢ Fun 𝐹 |
31 | 30 | a1i 11 | . . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → Fun 𝐹) |
32 | funisfsupp 8822 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝐹 ∈ (𝑅 ↑m 𝑉) ∧ 0 ∈ V) → (𝐹 finSupp 0 ↔ (𝐹 supp 0 ) ∈ Fin)) | |
33 | 31, 12, 18, 32 | syl3anc 1368 | . . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 finSupp 0 ↔ (𝐹 supp 0 ) ∈ Fin)) |
34 | 29, 33 | mpbird 260 | . 2 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → 𝐹 finSupp 0 ) |
35 | lincvalsc0.b | . . 3 ⊢ 𝐵 = (Base‘𝑀) | |
36 | lincvalsc0.z | . . 3 ⊢ 𝑍 = (0g‘𝑀) | |
37 | 35, 1, 3, 36, 6 | lincvalsc0 44830 | . 2 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹( linC ‘𝑀)𝑉) = 𝑍) |
38 | 12, 34, 37 | 3jca 1125 | 1 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 ∈ (𝑅 ↑m 𝑉) ∧ 𝐹 finSupp 0 ∧ (𝐹( linC ‘𝑀)𝑉) = 𝑍)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 ∀wral 3106 {crab 3110 Vcvv 3441 ∅c0 4243 𝒫 cpw 4497 class class class wbr 5030 ↦ cmpt 5110 Fun wfun 6318 ⟶wf 6320 ‘cfv 6324 (class class class)co 7135 supp csupp 7813 ↑m cmap 8389 Fincfn 8492 finSupp cfsupp 8817 Basecbs 16475 Scalarcsca 16560 0gc0g 16705 LModclmod 19627 linC clinc 44813 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-supp 7814 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-map 8391 df-en 8493 df-fin 8496 df-fsupp 8818 df-seq 13365 df-0g 16707 df-gsum 16708 df-mgm 17844 df-sgrp 17893 df-mnd 17904 df-grp 18098 df-ring 19292 df-lmod 19629 df-linc 44815 |
This theorem is referenced by: lcoel0 44837 |
Copyright terms: Public domain | W3C validator |