![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > lspprat | Structured version Visualization version GIF version |
Description: A proper subspace of the span of a pair of vectors is the span of a singleton (an atom) or the zero subspace (if 𝑧 is zero). Proof suggested by Mario Carneiro, 28-Aug-2014. (Contributed by NM, 29-Aug-2014.) |
Ref | Expression |
---|---|
lspprat.v | ⊢ 𝑉 = (Base‘𝑊) |
lspprat.s | ⊢ 𝑆 = (LSubSp‘𝑊) |
lspprat.n | ⊢ 𝑁 = (LSpan‘𝑊) |
lspprat.w | ⊢ (𝜑 → 𝑊 ∈ LVec) |
lspprat.u | ⊢ (𝜑 → 𝑈 ∈ 𝑆) |
lspprat.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
lspprat.y | ⊢ (𝜑 → 𝑌 ∈ 𝑉) |
lspprat.p | ⊢ (𝜑 → 𝑈 ⊊ (𝑁‘{𝑋, 𝑌})) |
Ref | Expression |
---|---|
lspprat | ⊢ (𝜑 → ∃𝑧 ∈ 𝑉 𝑈 = (𝑁‘{𝑧})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssdif0 4372 | . . 3 ⊢ (𝑈 ⊆ {(0g‘𝑊)} ↔ (𝑈 ∖ {(0g‘𝑊)}) = ∅) | |
2 | lspprat.w | . . . . . . . 8 ⊢ (𝜑 → 𝑊 ∈ LVec) | |
3 | lveclmod 21123 | . . . . . . . 8 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod) | |
4 | 2, 3 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝑊 ∈ LMod) |
5 | lspprat.v | . . . . . . . 8 ⊢ 𝑉 = (Base‘𝑊) | |
6 | eqid 2735 | . . . . . . . 8 ⊢ (0g‘𝑊) = (0g‘𝑊) | |
7 | 5, 6 | lmod0vcl 20906 | . . . . . . 7 ⊢ (𝑊 ∈ LMod → (0g‘𝑊) ∈ 𝑉) |
8 | 4, 7 | syl 17 | . . . . . 6 ⊢ (𝜑 → (0g‘𝑊) ∈ 𝑉) |
9 | 8 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑈 ⊆ {(0g‘𝑊)}) → (0g‘𝑊) ∈ 𝑉) |
10 | simpr 484 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑈 ⊆ {(0g‘𝑊)}) → 𝑈 ⊆ {(0g‘𝑊)}) | |
11 | lspprat.u | . . . . . . . . 9 ⊢ (𝜑 → 𝑈 ∈ 𝑆) | |
12 | lspprat.s | . . . . . . . . . 10 ⊢ 𝑆 = (LSubSp‘𝑊) | |
13 | 6, 12 | lss0ss 20965 | . . . . . . . . 9 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → {(0g‘𝑊)} ⊆ 𝑈) |
14 | 4, 11, 13 | syl2anc 584 | . . . . . . . 8 ⊢ (𝜑 → {(0g‘𝑊)} ⊆ 𝑈) |
15 | 14 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑈 ⊆ {(0g‘𝑊)}) → {(0g‘𝑊)} ⊆ 𝑈) |
16 | 10, 15 | eqssd 4013 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑈 ⊆ {(0g‘𝑊)}) → 𝑈 = {(0g‘𝑊)}) |
17 | lspprat.n | . . . . . . . . 9 ⊢ 𝑁 = (LSpan‘𝑊) | |
18 | 6, 17 | lspsn0 21024 | . . . . . . . 8 ⊢ (𝑊 ∈ LMod → (𝑁‘{(0g‘𝑊)}) = {(0g‘𝑊)}) |
19 | 4, 18 | syl 17 | . . . . . . 7 ⊢ (𝜑 → (𝑁‘{(0g‘𝑊)}) = {(0g‘𝑊)}) |
20 | 19 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑈 ⊆ {(0g‘𝑊)}) → (𝑁‘{(0g‘𝑊)}) = {(0g‘𝑊)}) |
21 | 16, 20 | eqtr4d 2778 | . . . . 5 ⊢ ((𝜑 ∧ 𝑈 ⊆ {(0g‘𝑊)}) → 𝑈 = (𝑁‘{(0g‘𝑊)})) |
22 | sneq 4641 | . . . . . . 7 ⊢ (𝑧 = (0g‘𝑊) → {𝑧} = {(0g‘𝑊)}) | |
23 | 22 | fveq2d 6911 | . . . . . 6 ⊢ (𝑧 = (0g‘𝑊) → (𝑁‘{𝑧}) = (𝑁‘{(0g‘𝑊)})) |
24 | 23 | rspceeqv 3645 | . . . . 5 ⊢ (((0g‘𝑊) ∈ 𝑉 ∧ 𝑈 = (𝑁‘{(0g‘𝑊)})) → ∃𝑧 ∈ 𝑉 𝑈 = (𝑁‘{𝑧})) |
25 | 9, 21, 24 | syl2anc 584 | . . . 4 ⊢ ((𝜑 ∧ 𝑈 ⊆ {(0g‘𝑊)}) → ∃𝑧 ∈ 𝑉 𝑈 = (𝑁‘{𝑧})) |
26 | 25 | ex 412 | . . 3 ⊢ (𝜑 → (𝑈 ⊆ {(0g‘𝑊)} → ∃𝑧 ∈ 𝑉 𝑈 = (𝑁‘{𝑧}))) |
27 | 1, 26 | biimtrrid 243 | . 2 ⊢ (𝜑 → ((𝑈 ∖ {(0g‘𝑊)}) = ∅ → ∃𝑧 ∈ 𝑉 𝑈 = (𝑁‘{𝑧}))) |
28 | 5, 12 | lssss 20952 | . . . . . . . 8 ⊢ (𝑈 ∈ 𝑆 → 𝑈 ⊆ 𝑉) |
29 | 11, 28 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝑈 ⊆ 𝑉) |
30 | 29 | ssdifssd 4157 | . . . . . 6 ⊢ (𝜑 → (𝑈 ∖ {(0g‘𝑊)}) ⊆ 𝑉) |
31 | 30 | sseld 3994 | . . . . 5 ⊢ (𝜑 → (𝑧 ∈ (𝑈 ∖ {(0g‘𝑊)}) → 𝑧 ∈ 𝑉)) |
32 | lspprat.x | . . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
33 | lspprat.y | . . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
34 | lspprat.p | . . . . . 6 ⊢ (𝜑 → 𝑈 ⊊ (𝑁‘{𝑋, 𝑌})) | |
35 | 5, 12, 17, 2, 11, 32, 33, 34, 6 | lsppratlem6 21172 | . . . . 5 ⊢ (𝜑 → (𝑧 ∈ (𝑈 ∖ {(0g‘𝑊)}) → 𝑈 = (𝑁‘{𝑧}))) |
36 | 31, 35 | jcad 512 | . . . 4 ⊢ (𝜑 → (𝑧 ∈ (𝑈 ∖ {(0g‘𝑊)}) → (𝑧 ∈ 𝑉 ∧ 𝑈 = (𝑁‘{𝑧})))) |
37 | 36 | eximdv 1915 | . . 3 ⊢ (𝜑 → (∃𝑧 𝑧 ∈ (𝑈 ∖ {(0g‘𝑊)}) → ∃𝑧(𝑧 ∈ 𝑉 ∧ 𝑈 = (𝑁‘{𝑧})))) |
38 | n0 4359 | . . 3 ⊢ ((𝑈 ∖ {(0g‘𝑊)}) ≠ ∅ ↔ ∃𝑧 𝑧 ∈ (𝑈 ∖ {(0g‘𝑊)})) | |
39 | df-rex 3069 | . . 3 ⊢ (∃𝑧 ∈ 𝑉 𝑈 = (𝑁‘{𝑧}) ↔ ∃𝑧(𝑧 ∈ 𝑉 ∧ 𝑈 = (𝑁‘{𝑧}))) | |
40 | 37, 38, 39 | 3imtr4g 296 | . 2 ⊢ (𝜑 → ((𝑈 ∖ {(0g‘𝑊)}) ≠ ∅ → ∃𝑧 ∈ 𝑉 𝑈 = (𝑁‘{𝑧}))) |
41 | 27, 40 | pm2.61dne 3026 | 1 ⊢ (𝜑 → ∃𝑧 ∈ 𝑉 𝑈 = (𝑁‘{𝑧})) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∃wex 1776 ∈ wcel 2106 ≠ wne 2938 ∃wrex 3068 ∖ cdif 3960 ⊆ wss 3963 ⊊ wpss 3964 ∅c0 4339 {csn 4631 {cpr 4633 ‘cfv 6563 Basecbs 17245 0gc0g 17486 LModclmod 20875 LSubSpclss 20947 LSpanclspn 20987 LVecclvec 21119 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-int 4952 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-tpos 8250 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-nn 12265 df-2 12327 df-3 12328 df-sets 17198 df-slot 17216 df-ndx 17228 df-base 17246 df-ress 17275 df-plusg 17311 df-mulr 17312 df-0g 17488 df-mgm 18666 df-sgrp 18745 df-mnd 18761 df-grp 18967 df-minusg 18968 df-sbg 18969 df-cmn 19815 df-abl 19816 df-mgp 20153 df-rng 20171 df-ur 20200 df-ring 20253 df-oppr 20351 df-dvdsr 20374 df-unit 20375 df-invr 20405 df-drng 20748 df-lmod 20877 df-lss 20948 df-lsp 20988 df-lvec 21120 |
This theorem is referenced by: dvh3dim3N 41432 |
Copyright terms: Public domain | W3C validator |