| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > lincresunit1 | Structured version Visualization version GIF version | ||
| Description: Property 1 of a specially modified restriction of a linear combination containing a unit as scalar. (Contributed by AV, 18-May-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 |
|---|---|
| lincresunit1 | ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈)) → 𝐺 ∈ (𝐸 ↑m (𝑆 ∖ {𝑋}))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lincresunit.g | . 2 ⊢ 𝐺 = (𝑠 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐼‘(𝑁‘(𝐹‘𝑋))) · (𝐹‘𝑠))) | |
| 2 | eldifi 4084 | . . . . 5 ⊢ (𝑠 ∈ (𝑆 ∖ {𝑋}) → 𝑠 ∈ 𝑆) | |
| 3 | lincresunit.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑀) | |
| 4 | lincresunit.r | . . . . . 6 ⊢ 𝑅 = (Scalar‘𝑀) | |
| 5 | lincresunit.e | . . . . . 6 ⊢ 𝐸 = (Base‘𝑅) | |
| 6 | lincresunit.u | . . . . . 6 ⊢ 𝑈 = (Unit‘𝑅) | |
| 7 | lincresunit.0 | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
| 8 | lincresunit.z | . . . . . 6 ⊢ 𝑍 = (0g‘𝑀) | |
| 9 | lincresunit.n | . . . . . 6 ⊢ 𝑁 = (invg‘𝑅) | |
| 10 | lincresunit.i | . . . . . 6 ⊢ 𝐼 = (invr‘𝑅) | |
| 11 | lincresunit.t | . . . . . 6 ⊢ · = (.r‘𝑅) | |
| 12 | 3, 4, 5, 6, 7, 8, 9, 10, 11, 1 | lincresunitlem2 49095 | . . . . 5 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈)) ∧ 𝑠 ∈ 𝑆) → ((𝐼‘(𝑁‘(𝐹‘𝑋))) · (𝐹‘𝑠)) ∈ 𝐸) |
| 13 | 2, 12 | sylan2 602 | . . . 4 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈)) ∧ 𝑠 ∈ (𝑆 ∖ {𝑋})) → ((𝐼‘(𝑁‘(𝐹‘𝑋))) · (𝐹‘𝑠)) ∈ 𝐸) |
| 14 | 13 | fmpttd 7096 | . . 3 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈)) → (𝑠 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐼‘(𝑁‘(𝐹‘𝑋))) · (𝐹‘𝑠))):(𝑆 ∖ {𝑋})⟶𝐸) |
| 15 | 5 | fvexi 6881 | . . . 4 ⊢ 𝐸 ∈ V |
| 16 | difexg 5285 | . . . . . 6 ⊢ (𝑆 ∈ 𝒫 𝐵 → (𝑆 ∖ {𝑋}) ∈ V) | |
| 17 | 16 | 3ad2ant1 1146 | . . . . 5 ⊢ ((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) → (𝑆 ∖ {𝑋}) ∈ V) |
| 18 | 17 | adantr 484 | . . . 4 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈)) → (𝑆 ∖ {𝑋}) ∈ V) |
| 19 | elmapg 8820 | . . . 4 ⊢ ((𝐸 ∈ V ∧ (𝑆 ∖ {𝑋}) ∈ V) → ((𝑠 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐼‘(𝑁‘(𝐹‘𝑋))) · (𝐹‘𝑠))) ∈ (𝐸 ↑m (𝑆 ∖ {𝑋})) ↔ (𝑠 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐼‘(𝑁‘(𝐹‘𝑋))) · (𝐹‘𝑠))):(𝑆 ∖ {𝑋})⟶𝐸)) | |
| 20 | 15, 18, 19 | sylancr 596 | . . 3 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈)) → ((𝑠 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐼‘(𝑁‘(𝐹‘𝑋))) · (𝐹‘𝑠))) ∈ (𝐸 ↑m (𝑆 ∖ {𝑋})) ↔ (𝑠 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐼‘(𝑁‘(𝐹‘𝑋))) · (𝐹‘𝑠))):(𝑆 ∖ {𝑋})⟶𝐸)) |
| 21 | 14, 20 | mpbird 259 | . 2 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈)) → (𝑠 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐼‘(𝑁‘(𝐹‘𝑋))) · (𝐹‘𝑠))) ∈ (𝐸 ↑m (𝑆 ∖ {𝑋}))) |
| 22 | 1, 21 | eqeltrid 2866 | 1 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈)) → 𝐺 ∈ (𝐸 ↑m (𝑆 ∖ {𝑋}))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1098 = wceq 1560 ∈ wcel 2142 Vcvv 3454 ∖ cdif 3901 𝒫 cpw 4555 {csn 4582 ↦ cmpt 5181 ⟶wf 6517 ‘cfv 6521 (class class class)co 7396 ↑m cmap 8808 Basecbs 17245 .rcmulr 17287 Scalarcsca 17289 0gc0g 17468 invgcminusg 18976 Unitcui 20400 invrcinvr 20432 LModclmod 20924 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5227 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-cnex 11129 ax-resscn 11130 ax-1cn 11131 ax-icn 11132 ax-addcl 11133 ax-addrcl 11134 ax-mulcl 11135 ax-mulrcl 11136 ax-mulcom 11137 ax-addass 11138 ax-mulass 11139 ax-distr 11140 ax-i2m1 11141 ax-1ne0 11142 ax-1rid 11143 ax-rnegex 11144 ax-rrecex 11145 ax-cnre 11146 ax-pre-lttri 11147 ax-pre-lttrn 11148 ax-pre-ltadd 11149 ax-pre-mulgt0 11150 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3456 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 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-1st 7970 df-2nd 7971 df-tpos 8206 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-er 8678 df-map 8810 df-en 8928 df-dom 8929 df-sdom 8930 df-pnf 11218 df-mnf 11219 df-xr 11220 df-ltxr 11221 df-le 11222 df-sub 11416 df-neg 11417 df-nn 12211 df-2 12280 df-3 12281 df-sets 17200 df-slot 17218 df-ndx 17230 df-base 17246 df-ress 17267 df-plusg 17299 df-mulr 17300 df-0g 17470 df-mgm 18674 df-sgrp 18753 df-mnd 18769 df-grp 18978 df-minusg 18979 df-cmn 19822 df-abl 19823 df-mgp 20187 df-rng 20199 df-ur 20228 df-ring 20281 df-oppr 20382 df-dvdsr 20402 df-unit 20403 df-invr 20433 df-lmod 20926 |
| This theorem is referenced by: lincresunit3lem2 49099 lincresunit3 49100 isldepslvec2 49104 |
| Copyright terms: Public domain | W3C validator |