| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lssvancl1 | Structured version Visualization version GIF version | ||
| Description: Non-closure: if one vector belongs to a subspace but another does not, their sum does not belong. Useful for obtaining a new vector not in a subspace. TODO: notice similarity to lspindp3 21238. Can it be used along with lspsnne1 21219, lspsnne2 21220 to shorten this proof? (Contributed by NM, 14-May-2015.) |
| Ref | Expression |
|---|---|
| lssvancl.v | ⊢ 𝑉 = (Base‘𝑊) |
| lssvancl.p | ⊢ + = (+g‘𝑊) |
| lssvancl.s | ⊢ 𝑆 = (LSubSp‘𝑊) |
| lssvancl.w | ⊢ (𝜑 → 𝑊 ∈ LMod) |
| lssvancl.u | ⊢ (𝜑 → 𝑈 ∈ 𝑆) |
| lssvancl.x | ⊢ (𝜑 → 𝑋 ∈ 𝑈) |
| lssvancl.y | ⊢ (𝜑 → 𝑌 ∈ 𝑉) |
| lssvancl.n | ⊢ (𝜑 → ¬ 𝑌 ∈ 𝑈) |
| Ref | Expression |
|---|---|
| lssvancl1 | ⊢ (𝜑 → ¬ (𝑋 + 𝑌) ∈ 𝑈) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lssvancl.n | . 2 ⊢ (𝜑 → ¬ 𝑌 ∈ 𝑈) | |
| 2 | lssvancl.w | . . . . . 6 ⊢ (𝜑 → 𝑊 ∈ LMod) | |
| 3 | lmodabl 21008 | . . . . . 6 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ Abel) | |
| 4 | 2, 3 | syl 18 | . . . . 5 ⊢ (𝜑 → 𝑊 ∈ Abel) |
| 5 | lssvancl.u | . . . . . 6 ⊢ (𝜑 → 𝑈 ∈ 𝑆) | |
| 6 | lssvancl.x | . . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝑈) | |
| 7 | lssvancl.v | . . . . . . 7 ⊢ 𝑉 = (Base‘𝑊) | |
| 8 | lssvancl.s | . . . . . . 7 ⊢ 𝑆 = (LSubSp‘𝑊) | |
| 9 | 7, 8 | lssel 21036 | . . . . . 6 ⊢ ((𝑈 ∈ 𝑆 ∧ 𝑋 ∈ 𝑈) → 𝑋 ∈ 𝑉) |
| 10 | 5, 6, 9 | syl2anc 595 | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
| 11 | lssvancl.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
| 12 | lssvancl.p | . . . . . 6 ⊢ + = (+g‘𝑊) | |
| 13 | eqid 2769 | . . . . . 6 ⊢ (-g‘𝑊) = (-g‘𝑊) | |
| 14 | 7, 12, 13 | ablpncan2 19885 | . . . . 5 ⊢ ((𝑊 ∈ Abel ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((𝑋 + 𝑌)(-g‘𝑊)𝑋) = 𝑌) |
| 15 | 4, 10, 11, 14 | syl3anc 1396 | . . . 4 ⊢ (𝜑 → ((𝑋 + 𝑌)(-g‘𝑊)𝑋) = 𝑌) |
| 16 | 15 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) ∈ 𝑈) → ((𝑋 + 𝑌)(-g‘𝑊)𝑋) = 𝑌) |
| 17 | 2 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) ∈ 𝑈) → 𝑊 ∈ LMod) |
| 18 | 5 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) ∈ 𝑈) → 𝑈 ∈ 𝑆) |
| 19 | simpr 489 | . . . 4 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) ∈ 𝑈) → (𝑋 + 𝑌) ∈ 𝑈) | |
| 20 | 6 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) ∈ 𝑈) → 𝑋 ∈ 𝑈) |
| 21 | 13, 8 | lssvsubcl 21043 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ ((𝑋 + 𝑌) ∈ 𝑈 ∧ 𝑋 ∈ 𝑈)) → ((𝑋 + 𝑌)(-g‘𝑊)𝑋) ∈ 𝑈) |
| 22 | 17, 18, 19, 20, 21 | syl22anc 851 | . . 3 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) ∈ 𝑈) → ((𝑋 + 𝑌)(-g‘𝑊)𝑋) ∈ 𝑈) |
| 23 | 16, 22 | eqeltrrd 2870 | . 2 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) ∈ 𝑈) → 𝑌 ∈ 𝑈) |
| 24 | 1, 23 | mtand 827 | 1 ⊢ (𝜑 → ¬ (𝑋 + 𝑌) ∈ 𝑈) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ‘cfv 6537 (class class class)co 7411 Basecbs 17269 +gcplusg 17310 -gcsg 19002 Abelcabl 19851 LModclmod 20959 LSubSpclss 21030 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-er 8694 df-en 8944 df-dom 8945 df-sdom 8946 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-2 12303 df-sets 17224 df-slot 17242 df-ndx 17254 df-base 17270 df-plusg 17323 df-0g 17494 df-mgm 18698 df-sgrp 18777 df-mnd 18793 df-grp 19003 df-minusg 19004 df-sbg 19005 df-cmn 19852 df-abl 19853 df-mgp 20217 df-ur 20264 df-ring 20317 df-lmod 20961 df-lss 21031 |
| This theorem is referenced by: lssvancl2 21045 dvh3dim2 42112 dvh3dim3N 42113 hdmap11lem2 42506 |
| Copyright terms: Public domain | W3C validator |