| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lspsneq0 | Structured version Visualization version GIF version | ||
| Description: Span of the singleton is the zero subspace iff the vector is zero. (Contributed by NM, 27-Apr-2014.) (Revised by Mario Carneiro, 19-Jun-2014.) |
| Ref | Expression |
|---|---|
| lspsneq0.v | ⊢ 𝑉 = (Base‘𝑊) |
| lspsneq0.z | ⊢ 0 = (0g‘𝑊) |
| lspsneq0.n | ⊢ 𝑁 = (LSpan‘𝑊) |
| Ref | Expression |
|---|---|
| lspsneq0 | ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → ((𝑁‘{𝑋}) = { 0 } ↔ 𝑋 = 0 )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lspsneq0.v | . . . . 5 ⊢ 𝑉 = (Base‘𝑊) | |
| 2 | lspsneq0.n | . . . . 5 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 3 | 1, 2 | lspsnid 21094 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ (𝑁‘{𝑋})) |
| 4 | eleq2 2858 | . . . 4 ⊢ ((𝑁‘{𝑋}) = { 0 } → (𝑋 ∈ (𝑁‘{𝑋}) ↔ 𝑋 ∈ { 0 })) | |
| 5 | 3, 4 | syl5ibcom 248 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → ((𝑁‘{𝑋}) = { 0 } → 𝑋 ∈ { 0 })) |
| 6 | elsni 4611 | . . 3 ⊢ (𝑋 ∈ { 0 } → 𝑋 = 0 ) | |
| 7 | 5, 6 | syl6 36 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → ((𝑁‘{𝑋}) = { 0 } → 𝑋 = 0 )) |
| 8 | lspsneq0.z | . . . . 5 ⊢ 0 = (0g‘𝑊) | |
| 9 | 8, 2 | lspsn0 21109 | . . . 4 ⊢ (𝑊 ∈ LMod → (𝑁‘{ 0 }) = { 0 }) |
| 10 | 9 | adantr 485 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{ 0 }) = { 0 }) |
| 11 | sneq 4604 | . . . 4 ⊢ (𝑋 = 0 → {𝑋} = { 0 }) | |
| 12 | 11 | fveqeq2d 6892 | . . 3 ⊢ (𝑋 = 0 → ((𝑁‘{𝑋}) = { 0 } ↔ (𝑁‘{ 0 }) = { 0 })) |
| 13 | 10, 12 | syl5ibrcom 250 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑋 = 0 → (𝑁‘{𝑋}) = { 0 })) |
| 14 | 7, 13 | impbid 215 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → ((𝑁‘{𝑋}) = { 0 } ↔ 𝑋 = 0 )) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 {csn 4594 ‘cfv 6539 Basecbs 17271 0gc0g 17494 LModclmod 20961 LSpanclspn 21072 |
| 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-rep 5242 ax-sep 5261 ax-nul 5273 ax-pow 5339 ax-pr 5407 ax-un 7735 ax-cnex 11158 ax-resscn 11159 ax-1cn 11160 ax-icn 11161 ax-addcl 11162 ax-addrcl 11163 ax-mulcl 11164 ax-mulrcl 11165 ax-mulcom 11166 ax-addass 11167 ax-mulass 11168 ax-distr 11169 ax-i2m1 11170 ax-1ne0 11171 ax-1rid 11172 ax-rnegex 11173 ax-rrecex 11174 ax-cnre 11175 ax-pre-lttri 11176 ax-pre-lttrn 11177 ax-pre-ltadd 11178 ax-pre-mulgt0 11179 |
| 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-int 4917 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5559 df-eprel 5564 df-po 5572 df-so 5573 df-fr 5617 df-we 5619 df-xp 5670 df-rel 5671 df-cnv 5672 df-co 5673 df-dm 5674 df-rn 5675 df-res 5676 df-ima 5677 df-pred 6305 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6495 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7865 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-en 8946 df-dom 8947 df-sdom 8948 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11445 df-neg 11446 df-nn 12236 df-2 12305 df-sets 17226 df-slot 17244 df-ndx 17256 df-base 17272 df-plusg 17325 df-0g 17496 df-mgm 18700 df-sgrp 18779 df-mnd 18795 df-grp 19005 df-minusg 19006 df-cmn 19854 df-abl 19855 df-mgp 20219 df-rng 20233 df-ur 20266 df-ring 20319 df-lmod 20963 df-lss 21033 df-lsp 21073 |
| This theorem is referenced by: lspsneq0b 21114 lsatn0 39700 lsator0sp 39702 lsat0cv 39734 dih0vbN 41983 dihlspsnat 42034 mapdn0 42370 mapdindp1 42421 hdmapeq0 42545 |
| Copyright terms: Public domain | W3C validator |