| 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 21095 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ (𝑁‘{𝑋})) |
| 4 | eleq2 2852 | . . . 4 ⊢ ((𝑁‘{𝑋}) = { 0 } → (𝑋 ∈ (𝑁‘{𝑋}) ↔ 𝑋 ∈ { 0 })) | |
| 5 | 3, 4 | syl5ibcom 248 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → ((𝑁‘{𝑋}) = { 0 } → 𝑋 ∈ { 0 })) |
| 6 | elsni 4607 | . . 3 ⊢ (𝑋 ∈ { 0 } → 𝑋 = 0 ) | |
| 7 | 5, 6 | syl6 36 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → ((𝑁‘{𝑋}) = { 0 } → 𝑋 = 0 )) |
| 8 | lspsneq0.z | . . . . 5 ⊢ 0 = (0g‘𝑊) | |
| 9 | 8, 2 | lspsn0 21110 | . . . 4 ⊢ (𝑊 ∈ LMod → (𝑁‘{ 0 }) = { 0 }) |
| 10 | 9 | adantr 485 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{ 0 }) = { 0 }) |
| 11 | sneq 4600 | . . . 4 ⊢ (𝑋 = 0 → {𝑋} = { 0 }) | |
| 12 | 11 | fveqeq2d 6891 | . . 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 1570 ∈ wcel 2143 {csn 4590 ‘cfv 6538 Basecbs 17270 0gc0g 17493 LModclmod 20962 LSpanclspn 21073 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-int 4914 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 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 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-nn 12235 df-2 12304 df-sets 17225 df-slot 17243 df-ndx 17255 df-base 17271 df-plusg 17324 df-0g 17495 df-mgm 18699 df-sgrp 18778 df-mnd 18794 df-grp 19004 df-minusg 19005 df-cmn 19853 df-abl 19854 df-mgp 20218 df-rng 20232 df-ur 20265 df-ring 20318 df-lmod 20964 df-lss 21034 df-lsp 21074 |
| This theorem is referenced by: lspsneq0b 21115 lsatn0 39751 lsator0sp 39753 lsat0cv 39785 dih0vbN 42034 dihlspsnat 42085 mapdn0 42421 mapdindp1 42472 hdmapeq0 42596 |
| Copyright terms: Public domain | W3C validator |