![]() |
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 4535 | . . . . . 6 ⊢ (𝑋 = 0 → {𝑋} = { 0 }) | |
2 | 1 | fveq2d 6649 | . . . . 5 ⊢ (𝑋 = 0 → (𝑁‘{𝑋}) = (𝑁‘{ 0 })) |
3 | lspdisj2.w | . . . . . . 7 ⊢ (𝜑 → 𝑊 ∈ LVec) | |
4 | lveclmod 19871 | . . . . . . 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 19773 | . . . . . 6 ⊢ (𝑊 ∈ LMod → (𝑁‘{ 0 }) = { 0 }) |
9 | 5, 8 | syl 17 | . . . . 5 ⊢ (𝜑 → (𝑁‘{ 0 }) = { 0 }) |
10 | 2, 9 | sylan9eqr 2855 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 = 0 ) → (𝑁‘{𝑋}) = { 0 }) |
11 | 10 | ineq1d 4138 | . . 3 ⊢ ((𝜑 ∧ 𝑋 = 0 ) → ((𝑁‘{𝑋}) ∩ (𝑁‘{𝑌})) = ({ 0 } ∩ (𝑁‘{𝑌}))) |
12 | lspdisj2.y | . . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
13 | lspdisj2.v | . . . . . . . 8 ⊢ 𝑉 = (Base‘𝑊) | |
14 | eqid 2798 | . . . . . . . 8 ⊢ (LSubSp‘𝑊) = (LSubSp‘𝑊) | |
15 | 13, 14, 7 | lspsncl 19742 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑌 ∈ 𝑉) → (𝑁‘{𝑌}) ∈ (LSubSp‘𝑊)) |
16 | 5, 12, 15 | syl2anc 587 | . . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑌}) ∈ (LSubSp‘𝑊)) |
17 | 6, 14 | lss0ss 19713 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑁‘{𝑌}) ∈ (LSubSp‘𝑊)) → { 0 } ⊆ (𝑁‘{𝑌})) |
18 | 5, 16, 17 | syl2anc 587 | . . . . 5 ⊢ (𝜑 → { 0 } ⊆ (𝑁‘{𝑌})) |
19 | df-ss 3898 | . . . . 5 ⊢ ({ 0 } ⊆ (𝑁‘{𝑌}) ↔ ({ 0 } ∩ (𝑁‘{𝑌})) = { 0 }) | |
20 | 18, 19 | sylib 221 | . . . 4 ⊢ (𝜑 → ({ 0 } ∩ (𝑁‘{𝑌})) = { 0 }) |
21 | 20 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ 𝑋 = 0 ) → ({ 0 } ∩ (𝑁‘{𝑌})) = { 0 }) |
22 | 11, 21 | eqtrd 2833 | . 2 ⊢ ((𝜑 ∧ 𝑋 = 0 ) → ((𝑁‘{𝑋}) ∩ (𝑁‘{𝑌})) = { 0 }) |
23 | 3 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → 𝑊 ∈ LVec) |
24 | 16 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → (𝑁‘{𝑌}) ∈ (LSubSp‘𝑊)) |
25 | lspdisj2.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
26 | 25 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → 𝑋 ∈ 𝑉) |
27 | lspdisj2.q | . . . . 5 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌})) | |
28 | 27 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌})) |
29 | 23 | adantr 484 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑋 ≠ 0 ) ∧ 𝑋 ∈ (𝑁‘{𝑌})) → 𝑊 ∈ LVec) |
30 | 12 | adantr 484 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → 𝑌 ∈ 𝑉) |
31 | 30 | adantr 484 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑋 ≠ 0 ) ∧ 𝑋 ∈ (𝑁‘{𝑌})) → 𝑌 ∈ 𝑉) |
32 | simpr 488 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑋 ≠ 0 ) ∧ 𝑋 ∈ (𝑁‘{𝑌})) → 𝑋 ∈ (𝑁‘{𝑌})) | |
33 | simplr 768 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑋 ≠ 0 ) ∧ 𝑋 ∈ (𝑁‘{𝑌})) → 𝑋 ≠ 0 ) | |
34 | 13, 6, 7, 29, 31, 32, 33 | lspsneleq 19880 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑋 ≠ 0 ) ∧ 𝑋 ∈ (𝑁‘{𝑌})) → (𝑁‘{𝑋}) = (𝑁‘{𝑌})) |
35 | 34 | ex 416 | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → (𝑋 ∈ (𝑁‘{𝑌}) → (𝑁‘{𝑋}) = (𝑁‘{𝑌}))) |
36 | 35 | necon3ad 3000 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → ((𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}) → ¬ 𝑋 ∈ (𝑁‘{𝑌}))) |
37 | 28, 36 | mpd 15 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → ¬ 𝑋 ∈ (𝑁‘{𝑌})) |
38 | 13, 6, 7, 14, 23, 24, 26, 37 | lspdisj 19890 | . 2 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → ((𝑁‘{𝑋}) ∩ (𝑁‘{𝑌})) = { 0 }) |
39 | 22, 38 | pm2.61dane 3074 | 1 ⊢ (𝜑 → ((𝑁‘{𝑋}) ∩ (𝑁‘{𝑌})) = { 0 }) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 ∩ cin 3880 ⊆ wss 3881 {csn 4525 ‘cfv 6324 Basecbs 16475 0gc0g 16705 LModclmod 19627 LSubSpclss 19696 LSpanclspn 19736 LVecclvec 19867 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-tpos 7875 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-3 11689 df-ndx 16478 df-slot 16479 df-base 16481 df-sets 16482 df-ress 16483 df-plusg 16570 df-mulr 16571 df-0g 16707 df-mgm 17844 df-sgrp 17893 df-mnd 17904 df-grp 18098 df-minusg 18099 df-sbg 18100 df-mgp 19233 df-ur 19245 df-ring 19292 df-oppr 19369 df-dvdsr 19387 df-unit 19388 df-invr 19418 df-drng 19497 df-lmod 19629 df-lss 19697 df-lsp 19737 df-lvec 19868 |
This theorem is referenced by: lvecindp2 19904 hdmaprnlem9N 39153 |
Copyright terms: Public domain | W3C validator |