| 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 4090 | . . . . 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 48438 | . . . . 5 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈)) ∧ 𝑠 ∈ 𝑆) → ((𝐼‘(𝑁‘(𝐹‘𝑋))) · (𝐹‘𝑠)) ∈ 𝐸) |
| 13 | 2, 12 | sylan2 593 | . . . 4 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈)) ∧ 𝑠 ∈ (𝑆 ∖ {𝑋})) → ((𝐼‘(𝑁‘(𝐹‘𝑋))) · (𝐹‘𝑠)) ∈ 𝐸) |
| 14 | 13 | fmpttd 7069 | . . 3 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈)) → (𝑠 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐼‘(𝑁‘(𝐹‘𝑋))) · (𝐹‘𝑠))):(𝑆 ∖ {𝑋})⟶𝐸) |
| 15 | 5 | fvexi 6854 | . . . 4 ⊢ 𝐸 ∈ V |
| 16 | difexg 5279 | . . . . . 6 ⊢ (𝑆 ∈ 𝒫 𝐵 → (𝑆 ∖ {𝑋}) ∈ V) | |
| 17 | 16 | 3ad2ant1 1133 | . . . . 5 ⊢ ((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) → (𝑆 ∖ {𝑋}) ∈ V) |
| 18 | 17 | adantr 480 | . . . 4 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈)) → (𝑆 ∖ {𝑋}) ∈ V) |
| 19 | elmapg 8789 | . . . 4 ⊢ ((𝐸 ∈ V ∧ (𝑆 ∖ {𝑋}) ∈ V) → ((𝑠 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐼‘(𝑁‘(𝐹‘𝑋))) · (𝐹‘𝑠))) ∈ (𝐸 ↑m (𝑆 ∖ {𝑋})) ↔ (𝑠 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐼‘(𝑁‘(𝐹‘𝑋))) · (𝐹‘𝑠))):(𝑆 ∖ {𝑋})⟶𝐸)) | |
| 20 | 15, 18, 19 | sylancr 587 | . . 3 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈)) → ((𝑠 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐼‘(𝑁‘(𝐹‘𝑋))) · (𝐹‘𝑠))) ∈ (𝐸 ↑m (𝑆 ∖ {𝑋})) ↔ (𝑠 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐼‘(𝑁‘(𝐹‘𝑋))) · (𝐹‘𝑠))):(𝑆 ∖ {𝑋})⟶𝐸)) |
| 21 | 14, 20 | mpbird 257 | . 2 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈)) → (𝑠 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐼‘(𝑁‘(𝐹‘𝑋))) · (𝐹‘𝑠))) ∈ (𝐸 ↑m (𝑆 ∖ {𝑋}))) |
| 22 | 1, 21 | eqeltrid 2832 | 1 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈)) → 𝐺 ∈ (𝐸 ↑m (𝑆 ∖ {𝑋}))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 Vcvv 3444 ∖ cdif 3908 𝒫 cpw 4559 {csn 4585 ↦ cmpt 5183 ⟶wf 6495 ‘cfv 6499 (class class class)co 7369 ↑m cmap 8776 Basecbs 17155 .rcmulr 17197 Scalarcsca 17199 0gc0g 17378 invgcminusg 18842 Unitcui 20240 invrcinvr 20272 LModclmod 20742 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-om 7823 df-1st 7947 df-2nd 7948 df-tpos 8182 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-er 8648 df-map 8778 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-nn 12163 df-2 12225 df-3 12226 df-sets 17110 df-slot 17128 df-ndx 17140 df-base 17156 df-ress 17177 df-plusg 17209 df-mulr 17210 df-0g 17380 df-mgm 18543 df-sgrp 18622 df-mnd 18638 df-grp 18844 df-minusg 18845 df-cmn 19688 df-abl 19689 df-mgp 20026 df-rng 20038 df-ur 20067 df-ring 20120 df-oppr 20222 df-dvdsr 20242 df-unit 20243 df-invr 20273 df-lmod 20744 |
| This theorem is referenced by: lincresunit3lem2 48442 lincresunit3 48443 isldepslvec2 48447 |
| Copyright terms: Public domain | W3C validator |