| 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 21326. Can it be used along with lspsnne1 21307, lspsnne2 21308 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 21096 | . . . . . 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 21124 | . . . . . 6 ⊢ ((𝑈 ∈ 𝑆 ∧ 𝑋 ∈ 𝑈) → 𝑋 ∈ 𝑉) |
| 10 | 5, 6, 9 | syl2anc 596 | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
| 11 | lssvancl.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
| 12 | lssvancl.p | . . . . . 6 ⊢ + = (+g‘𝑊) | |
| 13 | eqid 2760 | . . . . . 6 ⊢ (-g‘𝑊) = (-g‘𝑊) | |
| 14 | 7, 12, 13 | ablpncan2 19945 | . . . . 5 ⊢ ((𝑊 ∈ Abel ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((𝑋 + 𝑌)(-g‘𝑊)𝑋) = 𝑌) |
| 15 | 4, 10, 11, 14 | syl3anc 1398 | . . . 4 ⊢ (𝜑 → ((𝑋 + 𝑌)(-g‘𝑊)𝑋) = 𝑌) |
| 16 | 15 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) ∈ 𝑈) → ((𝑋 + 𝑌)(-g‘𝑊)𝑋) = 𝑌) |
| 17 | 2 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) ∈ 𝑈) → 𝑊 ∈ LMod) |
| 18 | 5 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) ∈ 𝑈) → 𝑈 ∈ 𝑆) |
| 19 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) ∈ 𝑈) → (𝑋 + 𝑌) ∈ 𝑈) | |
| 20 | 6 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) ∈ 𝑈) → 𝑋 ∈ 𝑈) |
| 21 | 13, 8 | lssvsubcl 21131 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ ((𝑋 + 𝑌) ∈ 𝑈 ∧ 𝑋 ∈ 𝑈)) → ((𝑋 + 𝑌)(-g‘𝑊)𝑋) ∈ 𝑈) |
| 22 | 17, 18, 19, 20, 21 | syl22anc 852 | . . 3 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) ∈ 𝑈) → ((𝑋 + 𝑌)(-g‘𝑊)𝑋) ∈ 𝑈) |
| 23 | 16, 22 | eqeltrrd 2861 | . 2 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) ∈ 𝑈) → 𝑌 ∈ 𝑈) |
| 24 | 1, 23 | mtand 828 | 1 ⊢ (𝜑 → ¬ (𝑋 + 𝑌) ∈ 𝑈) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ‘cfv 6533 (class class class)co 7414 Basecbs 17304 +gcplusg 17345 -gcsg 19062 Abelcabl 19911 LModclmod 21047 LSubSpclss 21118 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-nn 12261 df-2 12330 df-sets 17259 df-slot 17277 df-ndx 17289 df-base 17305 df-plusg 17358 df-0g 17529 df-mgm 18733 df-sgrp 18824 df-mnd 18840 df-grp 19063 df-minusg 19064 df-sbg 19065 df-cmn 19912 df-abl 19913 df-mgp 20277 df-ur 20324 df-ring 20377 df-lmod 21049 df-lss 21119 |
| This theorem is used by: lssvancl2 21133 dvh3dim2 42324 dvh3dim3N 42325 hdmap11lem2 42718 |
| Copyright terms: Public domain | W3C validator |