| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > lsatspn0 | Structured version Visualization version GIF version | ||
| Description: The span of a vector is an atom iff the vector is nonzero. (Contributed by NM, 4-Feb-2015.) |
| Ref | Expression |
|---|---|
| lsatspn0.v | ⊢ 𝑉 = (Base‘𝑊) |
| lsatspn0.n | ⊢ 𝑁 = (LSpan‘𝑊) |
| lsatspn0.o | ⊢ 0 = (0g‘𝑊) |
| lsatspn0.a | ⊢ 𝐴 = (LSAtoms‘𝑊) |
| isateln0.w | ⊢ (𝜑 → 𝑊 ∈ LMod) |
| isateln0.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
| Ref | Expression |
|---|---|
| lsatspn0 | ⊢ (𝜑 → ((𝑁‘{𝑋}) ∈ 𝐴 ↔ 𝑋 ≠ 0 )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lsatspn0.o | . . . 4 ⊢ 0 = (0g‘𝑊) | |
| 2 | lsatspn0.a | . . . 4 ⊢ 𝐴 = (LSAtoms‘𝑊) | |
| 3 | isateln0.w | . . . . 5 ⊢ (𝜑 → 𝑊 ∈ LMod) | |
| 4 | 3 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ (𝑁‘{𝑋}) ∈ 𝐴) → 𝑊 ∈ LMod) |
| 5 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ (𝑁‘{𝑋}) ∈ 𝐴) → (𝑁‘{𝑋}) ∈ 𝐴) | |
| 6 | 1, 2, 4, 5 | lsatn0 40036 | . . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑋}) ∈ 𝐴) → (𝑁‘{𝑋}) ≠ { 0 }) |
| 7 | sneq 4594 | . . . . . . . 8 ⊢ (𝑋 = 0 → {𝑋} = { 0 }) | |
| 8 | 7 | fveq2d 6887 | . . . . . . 7 ⊢ (𝑋 = 0 → (𝑁‘{𝑋}) = (𝑁‘{ 0 })) |
| 9 | 8 | adantl 487 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑁‘{𝑋}) ∈ 𝐴) ∧ 𝑋 = 0 ) → (𝑁‘{𝑋}) = (𝑁‘{ 0 })) |
| 10 | 4 | adantr 486 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝑁‘{𝑋}) ∈ 𝐴) ∧ 𝑋 = 0 ) → 𝑊 ∈ LMod) |
| 11 | lsatspn0.n | . . . . . . . 8 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 12 | 1, 11 | lspsn0 21276 | . . . . . . 7 ⊢ (𝑊 ∈ LMod → (𝑁‘{ 0 }) = { 0 }) |
| 13 | 10, 12 | syl 18 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑁‘{𝑋}) ∈ 𝐴) ∧ 𝑋 = 0 ) → (𝑁‘{ 0 }) = { 0 }) |
| 14 | 9, 13 | eqtrd 2796 | . . . . 5 ⊢ (((𝜑 ∧ (𝑁‘{𝑋}) ∈ 𝐴) ∧ 𝑋 = 0 ) → (𝑁‘{𝑋}) = { 0 }) |
| 15 | 14 | ex 418 | . . . 4 ⊢ ((𝜑 ∧ (𝑁‘{𝑋}) ∈ 𝐴) → (𝑋 = 0 → (𝑁‘{𝑋}) = { 0 })) |
| 16 | 15 | necon3d 2977 | . . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑋}) ∈ 𝐴) → ((𝑁‘{𝑋}) ≠ { 0 } → 𝑋 ≠ 0 )) |
| 17 | 6, 16 | mpd 16 | . 2 ⊢ ((𝜑 ∧ (𝑁‘{𝑋}) ∈ 𝐴) → 𝑋 ≠ 0 ) |
| 18 | lsatspn0.v | . . 3 ⊢ 𝑉 = (Base‘𝑊) | |
| 19 | 3 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → 𝑊 ∈ LMod) |
| 20 | isateln0.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 21 | 20 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → 𝑋 ∈ 𝑉) |
| 22 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → 𝑋 ≠ 0 ) | |
| 23 | eldifsn 4748 | . . . 4 ⊢ (𝑋 ∈ (𝑉 ∖ { 0 }) ↔ (𝑋 ∈ 𝑉 ∧ 𝑋 ≠ 0 )) | |
| 24 | 21, 22, 23 | sylanbrc 595 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → 𝑋 ∈ (𝑉 ∖ { 0 })) |
| 25 | 18, 11, 1, 2, 19, 24 | lsatlspsn 40030 | . 2 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → (𝑁‘{𝑋}) ∈ 𝐴) |
| 26 | 17, 25 | impbida 813 | 1 ⊢ (𝜑 → ((𝑁‘{𝑋}) ∈ 𝐴 ↔ 𝑋 ≠ 0 )) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2956 ∖ cdif 3896 {csn 4584 ‘cfv 6537 Basecbs 17380 0gc0g 17603 LModclmod 21128 LSpanclspn 21239 LSAtomsclsa 40011 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-er 8710 df-en 8967 df-dom 8968 df-sdom 8969 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-nn 12329 df-2 12398 df-sets 17335 df-slot 17353 df-ndx 17365 df-base 17381 df-plusg 17434 df-0g 17605 df-mgm 18809 df-sgrp 18901 df-mnd 18917 df-grp 19140 df-minusg 19141 df-cmn 19989 df-abl 19990 df-mgp 20354 df-rng 20368 df-ur 20401 df-ring 20454 df-lmod 21130 df-lss 21200 df-lsp 21240 df-lsatoms 40013 |
| This theorem is used by: lsator0sp 40038 lcfl8b 42541 mapdpglem5N 42714 mapdpglem30a 42732 mapdpglem30b 42733 |
| Copyright terms: Public domain | W3C validator |