| 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 40322 | . . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑋}) ∈ 𝐴) → (𝑁‘{𝑋}) ≠ { 0 }) |
| 7 | sneq 4594 | . . . . . . . 8 ⊢ (𝑋 = 0 → {𝑋} = { 0 }) | |
| 8 | 7 | fveq2d 6920 | . . . . . . 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 21334 | . . . . . . 7 ⊢ (𝑊 ∈ LMod → (𝑁‘{ 0 }) = { 0 }) |
| 13 | 10, 12 | syl 18 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑁‘{𝑋}) ∈ 𝐴) ∧ 𝑋 = 0 ) → (𝑁‘{ 0 }) = { 0 }) |
| 14 | 9, 13 | eqtrd 2798 | . . . . 5 ⊢ (((𝜑 ∧ (𝑁‘{𝑋}) ∈ 𝐴) ∧ 𝑋 = 0 ) → (𝑁‘{𝑋}) = { 0 }) |
| 15 | 14 | ex 418 | . . . 4 ⊢ ((𝜑 ∧ (𝑁‘{𝑋}) ∈ 𝐴) → (𝑋 = 0 → (𝑁‘{𝑋}) = { 0 })) |
| 16 | 15 | necon3d 2980 | . . 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 4750 | . . . 4 ⊢ (𝑋 ∈ (𝑉 ∖ { 0 }) ↔ (𝑋 ∈ 𝑉 ∧ 𝑋 ≠ 0 )) | |
| 24 | 21, 22, 23 | sylanbrc 595 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 0 ) → 𝑋 ∈ (𝑉 ∖ { 0 })) |
| 25 | 18, 11, 1, 2, 19, 24 | lsatlspsn 40316 | . 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 2147 ≠ wne 2959 ∖ cdif 4048 {csn 4588 ‘cfv 6566 Basecbs 17431 0gc0g 17660 LModclmod 21186 LSpanclspn 21297 LSAtomsclsa 40297 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-sets 17386 df-slot 17404 df-ndx 17416 df-base 17432 df-plusg 17486 df-0g 17662 df-mgm 18866 df-sgrp 18958 df-mnd 18974 df-grp 19197 df-minusg 19198 df-cmn 20047 df-abl 20048 df-mgp 20412 df-rng 20426 df-ur 20459 df-ring 20512 df-lmod 21188 df-lss 21258 df-lsp 21298 df-lsatoms 40299 |
| This theorem is used by: lsator0sp 40324 lcfl8b 42827 mapdpglem5N 43000 mapdpglem30a 43018 mapdpglem30b 43019 |
| Copyright terms: Public domain | W3C validator |