| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lspsncv0 | Structured version Visualization version GIF version | ||
| Description: The span of a singleton covers the zero subspace, using Definition 3.2.18 of [PtakPulmannova] p. 68 for "covers".) (Contributed by NM, 12-Aug-2014.) (Revised by AV, 13-Jul-2022.) |
| Ref | Expression |
|---|---|
| lspsncv0.v | ⊢ 𝑉 = (Base‘𝑊) |
| lspsncv0.z | ⊢ 0 = (0g‘𝑊) |
| lspsncv0.s | ⊢ 𝑆 = (LSubSp‘𝑊) |
| lspsncv0.n | ⊢ 𝑁 = (LSpan‘𝑊) |
| lspsncv0.w | ⊢ (𝜑 → 𝑊 ∈ LVec) |
| lspsncv0.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
| Ref | Expression |
|---|---|
| lspsncv0 | ⊢ (𝜑 → ¬ ∃𝑦 ∈ 𝑆 ({ 0 } ⊊ 𝑦 ∧ 𝑦 ⊊ (𝑁‘{𝑋}))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-pss 3927 | . . . . 5 ⊢ ({ 0 } ⊊ 𝑦 ↔ ({ 0 } ⊆ 𝑦 ∧ { 0 } ≠ 𝑦)) | |
| 2 | nesym 3016 | . . . . . 6 ⊢ ({ 0 } ≠ 𝑦 ↔ ¬ 𝑦 = { 0 }) | |
| 3 | 2 | bilani 509 | . . . . 5 ⊢ (({ 0 } ⊆ 𝑦 ∧ { 0 } ≠ 𝑦) → ¬ 𝑦 = { 0 }) |
| 4 | 1, 3 | sylbi 220 | . . . 4 ⊢ ({ 0 } ⊊ 𝑦 → ¬ 𝑦 = { 0 }) |
| 5 | lspsncv0.w | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑊 ∈ LVec) | |
| 6 | 5 | ad2antrr 738 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑆) ∧ 𝑦 ⊆ (𝑁‘{𝑋})) → 𝑊 ∈ LVec) |
| 7 | simplr 780 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑆) ∧ 𝑦 ⊆ (𝑁‘{𝑋})) → 𝑦 ∈ 𝑆) | |
| 8 | lspsncv0.x | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 9 | 8 | ad2antrr 738 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑆) ∧ 𝑦 ⊆ (𝑁‘{𝑋})) → 𝑋 ∈ 𝑉) |
| 10 | simpr 489 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑆) ∧ 𝑦 ⊆ (𝑁‘{𝑋})) → 𝑦 ⊆ (𝑁‘{𝑋})) | |
| 11 | lspsncv0.v | . . . . . . . . . . 11 ⊢ 𝑉 = (Base‘𝑊) | |
| 12 | lspsncv0.z | . . . . . . . . . . 11 ⊢ 0 = (0g‘𝑊) | |
| 13 | lspsncv0.s | . . . . . . . . . . 11 ⊢ 𝑆 = (LSubSp‘𝑊) | |
| 14 | lspsncv0.n | . . . . . . . . . . 11 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 15 | 11, 12, 13, 14 | lspsnat 21238 | . . . . . . . . . 10 ⊢ (((𝑊 ∈ LVec ∧ 𝑦 ∈ 𝑆 ∧ 𝑋 ∈ 𝑉) ∧ 𝑦 ⊆ (𝑁‘{𝑋})) → (𝑦 = (𝑁‘{𝑋}) ∨ 𝑦 = { 0 })) |
| 16 | 6, 7, 9, 10, 15 | syl31anc 1396 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑆) ∧ 𝑦 ⊆ (𝑁‘{𝑋})) → (𝑦 = (𝑁‘{𝑋}) ∨ 𝑦 = { 0 })) |
| 17 | 16 | orcomd 884 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑆) ∧ 𝑦 ⊆ (𝑁‘{𝑋})) → (𝑦 = { 0 } ∨ 𝑦 = (𝑁‘{𝑋}))) |
| 18 | 17 | ord 877 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑆) ∧ 𝑦 ⊆ (𝑁‘{𝑋})) → (¬ 𝑦 = { 0 } → 𝑦 = (𝑁‘{𝑋}))) |
| 19 | 18 | ex 417 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑆) → (𝑦 ⊆ (𝑁‘{𝑋}) → (¬ 𝑦 = { 0 } → 𝑦 = (𝑁‘{𝑋})))) |
| 20 | 19 | com23 87 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑆) → (¬ 𝑦 = { 0 } → (𝑦 ⊆ (𝑁‘{𝑋}) → 𝑦 = (𝑁‘{𝑋})))) |
| 21 | npss 4070 | . . . . 5 ⊢ (¬ 𝑦 ⊊ (𝑁‘{𝑋}) ↔ (𝑦 ⊆ (𝑁‘{𝑋}) → 𝑦 = (𝑁‘{𝑋}))) | |
| 22 | 20, 21 | imbitrrdi 255 | . . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑆) → (¬ 𝑦 = { 0 } → ¬ 𝑦 ⊊ (𝑁‘{𝑋}))) |
| 23 | 4, 22 | syl5 35 | . . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑆) → ({ 0 } ⊊ 𝑦 → ¬ 𝑦 ⊊ (𝑁‘{𝑋}))) |
| 24 | 23 | ralrimiva 3157 | . 2 ⊢ (𝜑 → ∀𝑦 ∈ 𝑆 ({ 0 } ⊊ 𝑦 → ¬ 𝑦 ⊊ (𝑁‘{𝑋}))) |
| 25 | ralinexa 3118 | . 2 ⊢ (∀𝑦 ∈ 𝑆 ({ 0 } ⊊ 𝑦 → ¬ 𝑦 ⊊ (𝑁‘{𝑋})) ↔ ¬ ∃𝑦 ∈ 𝑆 ({ 0 } ⊊ 𝑦 ∧ 𝑦 ⊊ (𝑁‘{𝑋}))) | |
| 26 | 24, 25 | sylib 221 | 1 ⊢ (𝜑 → ¬ ∃𝑦 ∈ 𝑆 ({ 0 } ⊊ 𝑦 ∧ 𝑦 ⊊ (𝑁‘{𝑋}))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∨ wo 860 = wceq 1563 ∈ wcel 2145 ≠ wne 2960 ∀wral 3079 ∃wrex 3089 ⊆ wss 3907 ⊊ wpss 3908 {csn 4585 ‘cfv 6525 Basecbs 17259 0gc0g 17482 LSubSpclss 21021 LSpanclspn 21061 LVecclvec 21192 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-int 4909 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-tpos 8210 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-nn 12225 df-2 12294 df-3 12295 df-sets 17214 df-slot 17232 df-ndx 17244 df-base 17260 df-ress 17281 df-plusg 17313 df-mulr 17314 df-0g 17484 df-mgm 18688 df-sgrp 18767 df-mnd 18783 df-grp 18993 df-minusg 18994 df-sbg 18995 df-cmn 19843 df-abl 19844 df-mgp 20208 df-rng 20222 df-ur 20255 df-ring 20308 df-oppr 20410 df-dvdsr 20430 df-unit 20431 df-invr 20461 df-drng 20806 df-lmod 20952 df-lss 21022 df-lsp 21062 df-lvec 21193 |
| This theorem is referenced by: lsatcv0 39667 |
| Copyright terms: Public domain | W3C validator |