| 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 21312. Can it be used along with lspsnne1 21293, lspsnne2 21294 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 21082 | . . . . . 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 21110 | . . . . . 6 ⊢ ((𝑈 ∈ 𝑆 ∧ 𝑋 ∈ 𝑈) → 𝑋 ∈ 𝑉) |
| 10 | 5, 6, 9 | syl2anc 596 | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
| 11 | lssvancl.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
| 12 | lssvancl.p | . . . . . 6 ⊢ + = (+g‘𝑊) | |
| 13 | eqid 2765 | . . . . . 6 ⊢ (-g‘𝑊) = (-g‘𝑊) | |
| 14 | 7, 12, 13 | ablpncan2 19931 | . . . . 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 21117 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ ((𝑋 + 𝑌) ∈ 𝑈 ∧ 𝑋 ∈ 𝑈)) → ((𝑋 + 𝑌)(-g‘𝑊)𝑋) ∈ 𝑈) |
| 22 | 17, 18, 19, 20, 21 | syl22anc 852 | . . 3 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) ∈ 𝑈) → ((𝑋 + 𝑌)(-g‘𝑊)𝑋) ∈ 𝑈) |
| 23 | 16, 22 | eqeltrrd 2866 | . 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 2146 ‘cfv 6540 (class class class)co 7419 Basecbs 17293 +gcplusg 17334 -gcsg 19048 Abelcabl 19897 LModclmod 21033 LSubSpclss 21104 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11173 ax-resscn 11174 ax-1cn 11175 ax-icn 11176 ax-addcl 11177 ax-addrcl 11178 ax-mulcl 11179 ax-mulrcl 11180 ax-mulcom 11181 ax-addass 11182 ax-mulass 11183 ax-distr 11184 ax-i2m1 11185 ax-1ne0 11186 ax-1rid 11187 ax-rnegex 11188 ax-rrecex 11189 ax-cnre 11190 ax-pre-lttri 11191 ax-pre-lttrn 11192 ax-pre-ltadd 11193 ax-pre-mulgt0 11194 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-1st 7992 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-er 8700 df-en 8950 df-dom 8951 df-sdom 8952 df-pnf 11262 df-mnf 11263 df-xr 11264 df-ltxr 11265 df-le 11266 df-sub 11460 df-neg 11461 df-nn 12251 df-2 12320 df-sets 17248 df-slot 17266 df-ndx 17278 df-base 17294 df-plusg 17347 df-0g 17518 df-mgm 18722 df-sgrp 18811 df-mnd 18827 df-grp 19049 df-minusg 19050 df-sbg 19051 df-cmn 19898 df-abl 19899 df-mgp 20263 df-ur 20310 df-ring 20363 df-lmod 21035 df-lss 21105 |
| This theorem is used by: lssvancl2 21119 dvh3dim2 42282 dvh3dim3N 42283 hdmap11lem2 42676 |
| Copyright terms: Public domain | W3C validator |