Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > lsppratlem2 | Structured version Visualization version GIF version |
Description: Lemma for lspprat 20330. Show that if 𝑋 and 𝑌 are both in (𝑁‘{𝑥, 𝑦}) (which will be our goal for each of the two cases above), then (𝑁‘{𝑋, 𝑌}) ⊆ 𝑈, contradicting the hypothesis for 𝑈. (Contributed by NM, 29-Aug-2014.) (Revised by Mario Carneiro, 5-Sep-2014.) |
Ref | Expression |
---|---|
lspprat.v | ⊢ 𝑉 = (Base‘𝑊) |
lspprat.s | ⊢ 𝑆 = (LSubSp‘𝑊) |
lspprat.n | ⊢ 𝑁 = (LSpan‘𝑊) |
lspprat.w | ⊢ (𝜑 → 𝑊 ∈ LVec) |
lspprat.u | ⊢ (𝜑 → 𝑈 ∈ 𝑆) |
lspprat.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
lspprat.y | ⊢ (𝜑 → 𝑌 ∈ 𝑉) |
lspprat.p | ⊢ (𝜑 → 𝑈 ⊊ (𝑁‘{𝑋, 𝑌})) |
lsppratlem1.o | ⊢ 0 = (0g‘𝑊) |
lsppratlem1.x2 | ⊢ (𝜑 → 𝑥 ∈ (𝑈 ∖ { 0 })) |
lsppratlem1.y2 | ⊢ (𝜑 → 𝑦 ∈ (𝑈 ∖ (𝑁‘{𝑥}))) |
lsppratlem2.x1 | ⊢ (𝜑 → 𝑋 ∈ (𝑁‘{𝑥, 𝑦})) |
lsppratlem2.y1 | ⊢ (𝜑 → 𝑌 ∈ (𝑁‘{𝑥, 𝑦})) |
Ref | Expression |
---|---|
lsppratlem2 | ⊢ (𝜑 → (𝑁‘{𝑋, 𝑌}) ⊆ 𝑈) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | lspprat.s | . . 3 ⊢ 𝑆 = (LSubSp‘𝑊) | |
2 | lspprat.n | . . 3 ⊢ 𝑁 = (LSpan‘𝑊) | |
3 | lspprat.w | . . . 4 ⊢ (𝜑 → 𝑊 ∈ LVec) | |
4 | lveclmod 20283 | . . . 4 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod) | |
5 | 3, 4 | syl 17 | . . 3 ⊢ (𝜑 → 𝑊 ∈ LMod) |
6 | lsppratlem1.x2 | . . . . . . 7 ⊢ (𝜑 → 𝑥 ∈ (𝑈 ∖ { 0 })) | |
7 | 6 | eldifad 3895 | . . . . . 6 ⊢ (𝜑 → 𝑥 ∈ 𝑈) |
8 | lsppratlem1.y2 | . . . . . . 7 ⊢ (𝜑 → 𝑦 ∈ (𝑈 ∖ (𝑁‘{𝑥}))) | |
9 | 8 | eldifad 3895 | . . . . . 6 ⊢ (𝜑 → 𝑦 ∈ 𝑈) |
10 | 7, 9 | prssd 4752 | . . . . 5 ⊢ (𝜑 → {𝑥, 𝑦} ⊆ 𝑈) |
11 | lspprat.u | . . . . . 6 ⊢ (𝜑 → 𝑈 ∈ 𝑆) | |
12 | lspprat.v | . . . . . . 7 ⊢ 𝑉 = (Base‘𝑊) | |
13 | 12, 1 | lssss 20113 | . . . . . 6 ⊢ (𝑈 ∈ 𝑆 → 𝑈 ⊆ 𝑉) |
14 | 11, 13 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝑈 ⊆ 𝑉) |
15 | 10, 14 | sstrd 3927 | . . . 4 ⊢ (𝜑 → {𝑥, 𝑦} ⊆ 𝑉) |
16 | 12, 1, 2 | lspcl 20153 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ {𝑥, 𝑦} ⊆ 𝑉) → (𝑁‘{𝑥, 𝑦}) ∈ 𝑆) |
17 | 5, 15, 16 | syl2anc 583 | . . 3 ⊢ (𝜑 → (𝑁‘{𝑥, 𝑦}) ∈ 𝑆) |
18 | lsppratlem2.x1 | . . 3 ⊢ (𝜑 → 𝑋 ∈ (𝑁‘{𝑥, 𝑦})) | |
19 | lsppratlem2.y1 | . . 3 ⊢ (𝜑 → 𝑌 ∈ (𝑁‘{𝑥, 𝑦})) | |
20 | 1, 2, 5, 17, 18, 19 | lspprss 20169 | . 2 ⊢ (𝜑 → (𝑁‘{𝑋, 𝑌}) ⊆ (𝑁‘{𝑥, 𝑦})) |
21 | 1, 2, 5, 11, 7, 9 | lspprss 20169 | . 2 ⊢ (𝜑 → (𝑁‘{𝑥, 𝑦}) ⊆ 𝑈) |
22 | 20, 21 | sstrd 3927 | 1 ⊢ (𝜑 → (𝑁‘{𝑋, 𝑌}) ⊆ 𝑈) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2108 ∖ cdif 3880 ⊆ wss 3883 ⊊ wpss 3884 {csn 4558 {cpr 4560 ‘cfv 6418 Basecbs 16840 0gc0g 17067 LModclmod 20038 LSubSpclss 20108 LSpanclspn 20148 LVecclvec 20279 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-2 11966 df-sets 16793 df-slot 16811 df-ndx 16823 df-base 16841 df-plusg 16901 df-0g 17069 df-mgm 18241 df-sgrp 18290 df-mnd 18301 df-grp 18495 df-minusg 18496 df-sbg 18497 df-mgp 19636 df-ur 19653 df-ring 19700 df-lmod 20040 df-lss 20109 df-lsp 20149 df-lvec 20280 |
This theorem is referenced by: lsppratlem5 20328 |
Copyright terms: Public domain | W3C validator |