| 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 3919 | . . . . 5 ⊢ ({ 0 } ⊊ 𝑦 ↔ ({ 0 } ⊆ 𝑦 ∧ { 0 } ≠ 𝑦)) | |
| 2 | nesym 3007 | . . . . . 6 ⊢ ({ 0 } ≠ 𝑦 ↔ ¬ 𝑦 = { 0 }) | |
| 3 | 2 | bilani 507 | . . . . 5 ⊢ (({ 0 } ⊆ 𝑦 ∧ { 0 } ≠ 𝑦) → ¬ 𝑦 = { 0 }) |
| 4 | 1, 3 | sylbi 219 | . . . 4 ⊢ ({ 0 } ⊊ 𝑦 → ¬ 𝑦 = { 0 }) |
| 5 | lspsncv0.w | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑊 ∈ LVec) | |
| 6 | 5 | ad2antrr 734 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑆) ∧ 𝑦 ⊆ (𝑁‘{𝑋})) → 𝑊 ∈ LVec) |
| 7 | simplr 776 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑆) ∧ 𝑦 ⊆ (𝑁‘{𝑋})) → 𝑦 ∈ 𝑆) | |
| 8 | lspsncv0.x | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 9 | 8 | ad2antrr 734 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑆) ∧ 𝑦 ⊆ (𝑁‘{𝑋})) → 𝑋 ∈ 𝑉) |
| 10 | simpr 487 | . . . . . . . . . 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 21188 | . . . . . . . . . 10 ⊢ (((𝑊 ∈ LVec ∧ 𝑦 ∈ 𝑆 ∧ 𝑋 ∈ 𝑉) ∧ 𝑦 ⊆ (𝑁‘{𝑋})) → (𝑦 = (𝑁‘{𝑋}) ∨ 𝑦 = { 0 })) |
| 16 | 6, 7, 9, 10, 15 | syl31anc 1388 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑆) ∧ 𝑦 ⊆ (𝑁‘{𝑋})) → (𝑦 = (𝑁‘{𝑋}) ∨ 𝑦 = { 0 })) |
| 17 | 16 | orcomd 880 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑆) ∧ 𝑦 ⊆ (𝑁‘{𝑋})) → (𝑦 = { 0 } ∨ 𝑦 = (𝑁‘{𝑋}))) |
| 18 | 17 | ord 873 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑆) ∧ 𝑦 ⊆ (𝑁‘{𝑋})) → (¬ 𝑦 = { 0 } → 𝑦 = (𝑁‘{𝑋}))) |
| 19 | 18 | ex 415 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑆) → (𝑦 ⊆ (𝑁‘{𝑋}) → (¬ 𝑦 = { 0 } → 𝑦 = (𝑁‘{𝑋})))) |
| 20 | 19 | com23 86 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑆) → (¬ 𝑦 = { 0 } → (𝑦 ⊆ (𝑁‘{𝑋}) → 𝑦 = (𝑁‘{𝑋})))) |
| 21 | npss 4062 | . . . . 5 ⊢ (¬ 𝑦 ⊊ (𝑁‘{𝑋}) ↔ (𝑦 ⊆ (𝑁‘{𝑋}) → 𝑦 = (𝑁‘{𝑋}))) | |
| 22 | 20, 21 | imbitrrdi 254 | . . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑆) → (¬ 𝑦 = { 0 } → ¬ 𝑦 ⊊ (𝑁‘{𝑋}))) |
| 23 | 4, 22 | syl5 34 | . . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑆) → ({ 0 } ⊊ 𝑦 → ¬ 𝑦 ⊊ (𝑁‘{𝑋}))) |
| 24 | 23 | ralrimiva 3148 | . 2 ⊢ (𝜑 → ∀𝑦 ∈ 𝑆 ({ 0 } ⊊ 𝑦 → ¬ 𝑦 ⊊ (𝑁‘{𝑋}))) |
| 25 | ralinexa 3109 | . 2 ⊢ (∀𝑦 ∈ 𝑆 ({ 0 } ⊊ 𝑦 → ¬ 𝑦 ⊊ (𝑁‘{𝑋})) ↔ ¬ ∃𝑦 ∈ 𝑆 ({ 0 } ⊊ 𝑦 ∧ 𝑦 ⊊ (𝑁‘{𝑋}))) | |
| 26 | 24, 25 | sylib 220 | 1 ⊢ (𝜑 → ¬ ∃𝑦 ∈ 𝑆 ({ 0 } ⊊ 𝑦 ∧ 𝑦 ⊊ (𝑁‘{𝑋}))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 ∨ wo 856 = wceq 1554 ∈ wcel 2136 ≠ wne 2951 ∀wral 3070 ∃wrex 3080 ⊆ wss 3899 ⊊ wpss 3900 {csn 4576 ‘cfv 6510 Basecbs 17221 0gc0g 17444 LSubSpclss 20971 LSpanclspn 21011 LVecclvec 21142 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-10 2169 ax-11 2185 ax-12 2206 ax-ext 2728 ax-rep 5221 ax-sep 5240 ax-nul 5250 ax-pow 5316 ax-pr 5384 ax-un 7707 ax-cnex 11119 ax-resscn 11120 ax-1cn 11121 ax-icn 11122 ax-addcl 11123 ax-addrcl 11124 ax-mulcl 11125 ax-mulrcl 11126 ax-mulcom 11127 ax-addass 11128 ax-mulass 11129 ax-distr 11130 ax-i2m1 11131 ax-1ne0 11132 ax-1rid 11133 ax-rnegex 11134 ax-rrecex 11135 ax-cnre 11136 ax-pre-lttri 11137 ax-pre-lttrn 11138 ax-pre-ltadd 11139 ax-pre-mulgt0 11140 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-nf 1798 df-sb 2085 df-mo 2560 df-eu 2590 df-clab 2735 df-cleq 2748 df-clel 2831 df-nfc 2905 df-ne 2952 df-nel 3056 df-ral 3071 df-rex 3081 df-rmo 3361 df-reu 3362 df-rab 3409 df-v 3450 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4281 df-if 4475 df-pw 4551 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-int 4900 df-iun 4945 df-br 5095 df-opab 5157 df-mpt 5176 df-tr 5202 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6466 df-fun 6512 df-fn 6513 df-f 6514 df-f1 6515 df-fo 6516 df-f1o 6517 df-fv 6518 df-riota 7342 df-ov 7388 df-oprab 7389 df-mpo 7390 df-om 7836 df-1st 7959 df-2nd 7960 df-tpos 8194 df-frecs 8250 df-wrecs 8281 df-recs 8330 df-rdg 8369 df-er 8666 df-en 8917 df-dom 8918 df-sdom 8919 df-pnf 11208 df-mnf 11209 df-xr 11210 df-ltxr 11211 df-le 11212 df-sub 11406 df-neg 11407 df-nn 12201 df-2 12270 df-3 12271 df-sets 17176 df-slot 17194 df-ndx 17206 df-base 17222 df-ress 17243 df-plusg 17275 df-mulr 17276 df-0g 17446 df-mgm 18650 df-sgrp 18729 df-mnd 18745 df-grp 18954 df-minusg 18955 df-sbg 18956 df-cmn 19798 df-abl 19799 df-mgp 20163 df-rng 20175 df-ur 20204 df-ring 20257 df-oppr 20358 df-dvdsr 20378 df-unit 20379 df-invr 20409 df-drng 20753 df-lmod 20902 df-lss 20972 df-lsp 21012 df-lvec 21143 |
| This theorem is referenced by: lsatcv0 39603 |
| Copyright terms: Public domain | W3C validator |