| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > lincreslvec3 | Structured version Visualization version GIF version | ||
| Description: Property 3 of a specially modified restriction of a linear combination in a vector space. (Contributed by AV, 18-May-2019.) (Proof shortened by AV, 30-Jul-2019.) |
| Ref | Expression |
|---|---|
| lincresunit.b | ⊢ 𝐵 = (Base‘𝑀) |
| lincresunit.r | ⊢ 𝑅 = (Scalar‘𝑀) |
| lincresunit.e | ⊢ 𝐸 = (Base‘𝑅) |
| lincresunit.u | ⊢ 𝑈 = (Unit‘𝑅) |
| lincresunit.0 | ⊢ 0 = (0g‘𝑅) |
| lincresunit.z | ⊢ 𝑍 = (0g‘𝑀) |
| lincresunit.n | ⊢ 𝑁 = (invg‘𝑅) |
| lincresunit.i | ⊢ 𝐼 = (invr‘𝑅) |
| lincresunit.t | ⊢ · = (.r‘𝑅) |
| lincresunit.g | ⊢ 𝐺 = (𝑠 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐼‘(𝑁‘(𝐹‘𝑋))) · (𝐹‘𝑠))) |
| Ref | Expression |
|---|---|
| lincreslvec3 | ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LVec ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ≠ 0 ∧ 𝐹 finSupp 0 ) ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍) → (𝐺( linC ‘𝑀)(𝑆 ∖ {𝑋})) = 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lveclmod 21093 | . . . 4 ⊢ (𝑀 ∈ LVec → 𝑀 ∈ LMod) | |
| 2 | 1 | 3anim2i 1154 | . . 3 ⊢ ((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LVec ∧ 𝑋 ∈ 𝑆) → (𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆)) |
| 3 | 2 | 3ad2ant1 1134 | . 2 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LVec ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ≠ 0 ∧ 𝐹 finSupp 0 ) ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍) → (𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆)) |
| 4 | simp21 1208 | . 2 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LVec ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ≠ 0 ∧ 𝐹 finSupp 0 ) ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍) → 𝐹 ∈ (𝐸 ↑m 𝑆)) | |
| 5 | elmapi 8789 | . . . . . 6 ⊢ (𝐹 ∈ (𝐸 ↑m 𝑆) → 𝐹:𝑆⟶𝐸) | |
| 6 | 5 | 3ad2ant1 1134 | . . . . 5 ⊢ ((𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ≠ 0 ∧ 𝐹 finSupp 0 ) → 𝐹:𝑆⟶𝐸) |
| 7 | simp3 1139 | . . . . 5 ⊢ ((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LVec ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝑆) | |
| 8 | ffvelcdm 7027 | . . . . 5 ⊢ ((𝐹:𝑆⟶𝐸 ∧ 𝑋 ∈ 𝑆) → (𝐹‘𝑋) ∈ 𝐸) | |
| 9 | 6, 7, 8 | syl2anr 598 | . . . 4 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LVec ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ≠ 0 ∧ 𝐹 finSupp 0 )) → (𝐹‘𝑋) ∈ 𝐸) |
| 10 | simpr2 1197 | . . . 4 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LVec ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ≠ 0 ∧ 𝐹 finSupp 0 )) → (𝐹‘𝑋) ≠ 0 ) | |
| 11 | lincresunit.r | . . . . . . . 8 ⊢ 𝑅 = (Scalar‘𝑀) | |
| 12 | 11 | lvecdrng 21092 | . . . . . . 7 ⊢ (𝑀 ∈ LVec → 𝑅 ∈ DivRing) |
| 13 | 12 | 3ad2ant2 1135 | . . . . . 6 ⊢ ((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LVec ∧ 𝑋 ∈ 𝑆) → 𝑅 ∈ DivRing) |
| 14 | 13 | adantr 480 | . . . . 5 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LVec ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ≠ 0 ∧ 𝐹 finSupp 0 )) → 𝑅 ∈ DivRing) |
| 15 | lincresunit.e | . . . . . 6 ⊢ 𝐸 = (Base‘𝑅) | |
| 16 | lincresunit.u | . . . . . 6 ⊢ 𝑈 = (Unit‘𝑅) | |
| 17 | lincresunit.0 | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
| 18 | 15, 16, 17 | drngunit 20702 | . . . . 5 ⊢ (𝑅 ∈ DivRing → ((𝐹‘𝑋) ∈ 𝑈 ↔ ((𝐹‘𝑋) ∈ 𝐸 ∧ (𝐹‘𝑋) ≠ 0 ))) |
| 19 | 14, 18 | syl 17 | . . . 4 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LVec ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ≠ 0 ∧ 𝐹 finSupp 0 )) → ((𝐹‘𝑋) ∈ 𝑈 ↔ ((𝐹‘𝑋) ∈ 𝐸 ∧ (𝐹‘𝑋) ≠ 0 ))) |
| 20 | 9, 10, 19 | mpbir2and 714 | . . 3 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LVec ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ≠ 0 ∧ 𝐹 finSupp 0 )) → (𝐹‘𝑋) ∈ 𝑈) |
| 21 | 20 | 3adant3 1133 | . 2 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LVec ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ≠ 0 ∧ 𝐹 finSupp 0 ) ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍) → (𝐹‘𝑋) ∈ 𝑈) |
| 22 | simp3 1139 | . . 3 ⊢ ((𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ≠ 0 ∧ 𝐹 finSupp 0 ) → 𝐹 finSupp 0 ) | |
| 23 | 22 | 3ad2ant2 1135 | . 2 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LVec ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ≠ 0 ∧ 𝐹 finSupp 0 ) ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍) → 𝐹 finSupp 0 ) |
| 24 | simp3 1139 | . 2 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LVec ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ≠ 0 ∧ 𝐹 finSupp 0 ) ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍) → (𝐹( linC ‘𝑀)𝑆) = 𝑍) | |
| 25 | lincresunit.b | . . 3 ⊢ 𝐵 = (Base‘𝑀) | |
| 26 | lincresunit.z | . . 3 ⊢ 𝑍 = (0g‘𝑀) | |
| 27 | lincresunit.n | . . 3 ⊢ 𝑁 = (invg‘𝑅) | |
| 28 | lincresunit.i | . . 3 ⊢ 𝐼 = (invr‘𝑅) | |
| 29 | lincresunit.t | . . 3 ⊢ · = (.r‘𝑅) | |
| 30 | lincresunit.g | . . 3 ⊢ 𝐺 = (𝑠 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐼‘(𝑁‘(𝐹‘𝑋))) · (𝐹‘𝑠))) | |
| 31 | 25, 11, 15, 16, 17, 26, 27, 28, 29, 30 | lincresunit3 48969 | . 2 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 ) ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍) → (𝐺( linC ‘𝑀)(𝑆 ∖ {𝑋})) = 𝑋) |
| 32 | 3, 4, 21, 23, 24, 31 | syl131anc 1386 | 1 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LVec ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ≠ 0 ∧ 𝐹 finSupp 0 ) ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍) → (𝐺( linC ‘𝑀)(𝑆 ∖ {𝑋})) = 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∖ cdif 3887 𝒫 cpw 4542 {csn 4568 class class class wbr 5086 ↦ cmpt 5167 ⟶wf 6488 ‘cfv 6492 (class class class)co 7360 ↑m cmap 8766 finSupp cfsupp 9267 Basecbs 17170 .rcmulr 17212 Scalarcsca 17214 0gc0g 17393 invgcminusg 18901 Unitcui 20326 invrcinvr 20358 DivRingcdr 20697 LModclmod 20846 LVecclvec 21089 linC clinc 48892 |
| 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 5212 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| 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-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-iin 4937 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-se 5578 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-isom 6501 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-of 7624 df-om 7811 df-1st 7935 df-2nd 7936 df-supp 8104 df-tpos 8169 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-1o 8398 df-2o 8399 df-er 8636 df-map 8768 df-en 8887 df-dom 8888 df-sdom 8889 df-fin 8890 df-fsupp 9268 df-oi 9418 df-card 9854 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-2 12235 df-3 12236 df-n0 12429 df-z 12516 df-uz 12780 df-fz 13453 df-fzo 13600 df-seq 13955 df-hash 14284 df-sets 17125 df-slot 17143 df-ndx 17155 df-base 17171 df-ress 17192 df-plusg 17224 df-mulr 17225 df-0g 17395 df-gsum 17396 df-mre 17539 df-mrc 17540 df-acs 17542 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-mhm 18742 df-submnd 18743 df-grp 18903 df-minusg 18904 df-mulg 19035 df-ghm 19179 df-cntz 19283 df-cmn 19748 df-abl 19749 df-mgp 20113 df-rng 20125 df-ur 20154 df-ring 20207 df-oppr 20308 df-dvdsr 20328 df-unit 20329 df-invr 20359 df-drng 20699 df-lmod 20848 df-lvec 21090 df-linc 48894 |
| This theorem is referenced by: isldepslvec2 48973 |
| Copyright terms: Public domain | W3C validator |