| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lspdisj2 | Structured version Visualization version GIF version | ||
| Description: Unequal spans are disjoint (share only the zero vector). (Contributed by NM, 22-Mar-2015.) |
| Ref | Expression |
|---|---|
| lspdisj2.v | ⊢ 𝑉 = (Base‘𝑊) |
| lspdisj2.o | ⊢ 0 = (0g‘𝑊) |
| lspdisj2.n | ⊢ 𝑁 = (LSpan‘𝑊) |
| lspdisj2.w | ⊢ (𝜑 → 𝑊 ∈ LVec) |
| lspdisj2.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
| lspdisj2.y | ⊢ (𝜑 → 𝑌 ∈ 𝑉) |
| lspdisj2.q | ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌})) |
| Ref | Expression |
|---|---|
| lspdisj2 | ⊢ (𝜑 → ((𝑁‘{𝑋}) ∩ (𝑁‘{𝑌})) = { 0 }) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sneq 4586 | . . . . . 6 ⊢ (𝑋 = 0 → {𝑋} = { 0 }) | |
| 2 | 1 | fveq2d 6826 | . . . . 5 ⊢ (𝑋 = 0 → (𝑁‘{𝑋}) = (𝑁‘{ 0 })) |
| 3 | lspdisj2.w | . . . . . . 7 ⊢ (𝜑 → 𝑊 ∈ LVec) | |
| 4 | lveclmod 21038 | . . . . . . 7 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod) | |
| 5 | 3, 4 | syl 17 | . . . . . 6 ⊢ (𝜑 → 𝑊 ∈ LMod) |
| 6 | lspdisj2.o | . . . . . . 7 ⊢ 0 = (0g‘𝑊) | |
| 7 | lspdisj2.n | . . . . . . 7 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 8 | 6, 7 | lspsn0 20939 | . . . . . 6 ⊢ (𝑊 ∈ LMod → (𝑁‘{ 0 }) = { 0 }) |
| 9 | 5, 8 | syl 17 | . . . . 5 ⊢ (𝜑 → (𝑁‘{ 0 }) = { 0 }) |
| 10 | 2, 9 | sylan9eqr 2788 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 = 0 ) → (𝑁‘{𝑋}) = { 0 }) |
| 11 | 10 | ineq1d 4169 | . . 3 ⊢ ((𝜑 ∧ 𝑋 = 0 ) → ((𝑁‘{𝑋}) ∩ (𝑁‘{𝑌})) = ({ 0 } ∩ (𝑁‘{𝑌}))) |
| 12 | lspdisj2.y | . . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
| 13 | lspdisj2.v | . . . . . . . 8 ⊢ 𝑉 = (Base‘𝑊) | |
| 14 | eqid 2731 | . . . . . . . 8 ⊢ (LSubSp‘𝑊) = (LSubSp‘𝑊) | |
| 15 | 13, 14, 7 | lspsncl 20908 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑌 ∈ 𝑉) → (𝑁‘{𝑌}) ∈ (LSubSp‘𝑊)) |
| 16 | 5, 12, 15 | syl2anc 584 | . . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑌}) ∈ (LSubSp‘𝑊)) |
| 17 | 6, 14 | lss0ss 20880 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑁‘{𝑌}) ∈ (LSubSp‘𝑊)) → { 0 } ⊆ (𝑁‘{𝑌})) |
| 18 | 5, 16, 17 | syl2anc 584 | . . . . 5 ⊢ (𝜑 → { 0 } ⊆ (𝑁‘{𝑌})) |
| 19 | dfss2 3920 | . . . . 5 ⊢ ({ 0 } ⊆ (𝑁‘{𝑌}) ↔ ({ 0 } ∩ (𝑁‘{𝑌})) = { 0 }) | |
| 20 | 18, 19 | sylib 218 | . . . 4 ⊢ (𝜑 → ({ 0 } ∩ (𝑁‘{𝑌})) = { 0 }) |
| 21 | 20 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝑋 = 0 ) → ({ 0 } ∩ (𝑁‘{𝑌})) = { 0 }) |
| 22 | 11, 21 | eqtrd 2766 | . 2 ⊢ ((𝜑 ∧ 𝑋 = 0 ) → ((𝑁‘{𝑋}) ∩ (𝑁‘{𝑌})) = { 0 }) |
| 23 | 3 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → 𝑊 ∈ LVec) |
| 24 | 16 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → (𝑁‘{𝑌}) ∈ (LSubSp‘𝑊)) |
| 25 | lspdisj2.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 26 | 25 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → 𝑋 ∈ 𝑉) |
| 27 | lspdisj2.q | . . . . 5 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌})) | |
| 28 | 27 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌})) |
| 29 | 23 | adantr 480 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑋 ≠ 0 ) ∧ 𝑋 ∈ (𝑁‘{𝑌})) → 𝑊 ∈ LVec) |
| 30 | 12 | adantr 480 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → 𝑌 ∈ 𝑉) |
| 31 | 30 | adantr 480 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑋 ≠ 0 ) ∧ 𝑋 ∈ (𝑁‘{𝑌})) → 𝑌 ∈ 𝑉) |
| 32 | simpr 484 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑋 ≠ 0 ) ∧ 𝑋 ∈ (𝑁‘{𝑌})) → 𝑋 ∈ (𝑁‘{𝑌})) | |
| 33 | simplr 768 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑋 ≠ 0 ) ∧ 𝑋 ∈ (𝑁‘{𝑌})) → 𝑋 ≠ 0 ) | |
| 34 | 13, 6, 7, 29, 31, 32, 33 | lspsneleq 21050 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑋 ≠ 0 ) ∧ 𝑋 ∈ (𝑁‘{𝑌})) → (𝑁‘{𝑋}) = (𝑁‘{𝑌})) |
| 35 | 34 | ex 412 | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → (𝑋 ∈ (𝑁‘{𝑌}) → (𝑁‘{𝑋}) = (𝑁‘{𝑌}))) |
| 36 | 35 | necon3ad 2941 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → ((𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}) → ¬ 𝑋 ∈ (𝑁‘{𝑌}))) |
| 37 | 28, 36 | mpd 15 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → ¬ 𝑋 ∈ (𝑁‘{𝑌})) |
| 38 | 13, 6, 7, 14, 23, 24, 26, 37 | lspdisj 21060 | . 2 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → ((𝑁‘{𝑋}) ∩ (𝑁‘{𝑌})) = { 0 }) |
| 39 | 22, 38 | pm2.61dane 3015 | 1 ⊢ (𝜑 → ((𝑁‘{𝑋}) ∩ (𝑁‘{𝑌})) = { 0 }) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2111 ≠ wne 2928 ∩ cin 3901 ⊆ wss 3902 {csn 4576 ‘cfv 6481 Basecbs 17117 0gc0g 17340 LModclmod 20791 LSubSpclss 20862 LSpanclspn 20902 LVecclvec 21034 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5217 ax-sep 5234 ax-nul 5244 ax-pow 5303 ax-pr 5370 ax-un 7668 ax-cnex 11059 ax-resscn 11060 ax-1cn 11061 ax-icn 11062 ax-addcl 11063 ax-addrcl 11064 ax-mulcl 11065 ax-mulrcl 11066 ax-mulcom 11067 ax-addass 11068 ax-mulass 11069 ax-distr 11070 ax-i2m1 11071 ax-1ne0 11072 ax-1rid 11073 ax-rnegex 11074 ax-rrecex 11075 ax-cnre 11076 ax-pre-lttri 11077 ax-pre-lttrn 11078 ax-pre-ltadd 11079 ax-pre-mulgt0 11080 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4476 df-pw 4552 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-int 4898 df-iun 4943 df-br 5092 df-opab 5154 df-mpt 5173 df-tr 5199 df-id 5511 df-eprel 5516 df-po 5524 df-so 5525 df-fr 5569 df-we 5571 df-xp 5622 df-rel 5623 df-cnv 5624 df-co 5625 df-dm 5626 df-rn 5627 df-res 5628 df-ima 5629 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-om 7797 df-1st 7921 df-2nd 7922 df-tpos 8156 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-er 8622 df-en 8870 df-dom 8871 df-sdom 8872 df-pnf 11145 df-mnf 11146 df-xr 11147 df-ltxr 11148 df-le 11149 df-sub 11343 df-neg 11344 df-nn 12123 df-2 12185 df-3 12186 df-sets 17072 df-slot 17090 df-ndx 17102 df-base 17118 df-ress 17139 df-plusg 17171 df-mulr 17172 df-0g 17342 df-mgm 18545 df-sgrp 18624 df-mnd 18640 df-grp 18846 df-minusg 18847 df-sbg 18848 df-cmn 19692 df-abl 19693 df-mgp 20057 df-rng 20069 df-ur 20098 df-ring 20151 df-oppr 20253 df-dvdsr 20273 df-unit 20274 df-invr 20304 df-drng 20644 df-lmod 20793 df-lss 20863 df-lsp 20903 df-lvec 21035 |
| This theorem is referenced by: lvecindp2 21074 hdmaprnlem9N 41895 |
| Copyright terms: Public domain | W3C validator |