Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > l1cvpat | Structured version Visualization version GIF version |
Description: A subspace covered by the set of all vectors, when summed with an atom not under it, equals the set of all vectors. (1cvrjat 37416 analog.) (Contributed by NM, 11-Jan-2015.) |
Ref | Expression |
---|---|
l1cvpat.v | ⊢ 𝑉 = (Base‘𝑊) |
l1cvpat.s | ⊢ 𝑆 = (LSubSp‘𝑊) |
l1cvpat.p | ⊢ ⊕ = (LSSum‘𝑊) |
l1cvpat.a | ⊢ 𝐴 = (LSAtoms‘𝑊) |
l1cvpat.c | ⊢ 𝐶 = ( ⋖L ‘𝑊) |
l1cvpat.w | ⊢ (𝜑 → 𝑊 ∈ LVec) |
l1cvpat.u | ⊢ (𝜑 → 𝑈 ∈ 𝑆) |
l1cvpat.q | ⊢ (𝜑 → 𝑄 ∈ 𝐴) |
l1cvpat.l | ⊢ (𝜑 → 𝑈𝐶𝑉) |
l1cvpat.m | ⊢ (𝜑 → ¬ 𝑄 ⊆ 𝑈) |
Ref | Expression |
---|---|
l1cvpat | ⊢ (𝜑 → (𝑈 ⊕ 𝑄) = 𝑉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | l1cvpat.q | . . 3 ⊢ (𝜑 → 𝑄 ∈ 𝐴) | |
2 | l1cvpat.w | . . . 4 ⊢ (𝜑 → 𝑊 ∈ LVec) | |
3 | l1cvpat.v | . . . . 5 ⊢ 𝑉 = (Base‘𝑊) | |
4 | eqid 2738 | . . . . 5 ⊢ (LSpan‘𝑊) = (LSpan‘𝑊) | |
5 | eqid 2738 | . . . . 5 ⊢ (0g‘𝑊) = (0g‘𝑊) | |
6 | l1cvpat.a | . . . . 5 ⊢ 𝐴 = (LSAtoms‘𝑊) | |
7 | 3, 4, 5, 6 | islsat 36932 | . . . 4 ⊢ (𝑊 ∈ LVec → (𝑄 ∈ 𝐴 ↔ ∃𝑣 ∈ (𝑉 ∖ {(0g‘𝑊)})𝑄 = ((LSpan‘𝑊)‘{𝑣}))) |
8 | 2, 7 | syl 17 | . . 3 ⊢ (𝜑 → (𝑄 ∈ 𝐴 ↔ ∃𝑣 ∈ (𝑉 ∖ {(0g‘𝑊)})𝑄 = ((LSpan‘𝑊)‘{𝑣}))) |
9 | 1, 8 | mpbid 231 | . 2 ⊢ (𝜑 → ∃𝑣 ∈ (𝑉 ∖ {(0g‘𝑊)})𝑄 = ((LSpan‘𝑊)‘{𝑣})) |
10 | l1cvpat.m | . 2 ⊢ (𝜑 → ¬ 𝑄 ⊆ 𝑈) | |
11 | eldifi 4057 | . . . 4 ⊢ (𝑣 ∈ (𝑉 ∖ {(0g‘𝑊)}) → 𝑣 ∈ 𝑉) | |
12 | l1cvpat.s | . . . . . . . . 9 ⊢ 𝑆 = (LSubSp‘𝑊) | |
13 | lveclmod 20283 | . . . . . . . . . . 11 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod) | |
14 | 2, 13 | syl 17 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑊 ∈ LMod) |
15 | 14 | 3ad2ant1 1131 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉 ∧ 𝑄 = ((LSpan‘𝑊)‘{𝑣})) → 𝑊 ∈ LMod) |
16 | l1cvpat.u | . . . . . . . . . 10 ⊢ (𝜑 → 𝑈 ∈ 𝑆) | |
17 | 16 | 3ad2ant1 1131 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉 ∧ 𝑄 = ((LSpan‘𝑊)‘{𝑣})) → 𝑈 ∈ 𝑆) |
18 | simp2 1135 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉 ∧ 𝑄 = ((LSpan‘𝑊)‘{𝑣})) → 𝑣 ∈ 𝑉) | |
19 | 3, 12, 4, 15, 17, 18 | lspsnel5 20172 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉 ∧ 𝑄 = ((LSpan‘𝑊)‘{𝑣})) → (𝑣 ∈ 𝑈 ↔ ((LSpan‘𝑊)‘{𝑣}) ⊆ 𝑈)) |
20 | 19 | notbid 317 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉 ∧ 𝑄 = ((LSpan‘𝑊)‘{𝑣})) → (¬ 𝑣 ∈ 𝑈 ↔ ¬ ((LSpan‘𝑊)‘{𝑣}) ⊆ 𝑈)) |
21 | l1cvpat.p | . . . . . . . . 9 ⊢ ⊕ = (LSSum‘𝑊) | |
22 | eqid 2738 | . . . . . . . . 9 ⊢ (LSHyp‘𝑊) = (LSHyp‘𝑊) | |
23 | 2 | 3ad2ant1 1131 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉 ∧ 𝑄 = ((LSpan‘𝑊)‘{𝑣})) → 𝑊 ∈ LVec) |
24 | l1cvpat.l | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑈𝐶𝑉) | |
25 | l1cvpat.c | . . . . . . . . . . . 12 ⊢ 𝐶 = ( ⋖L ‘𝑊) | |
26 | 3, 12, 22, 25, 2 | islshpcv 36994 | . . . . . . . . . . 11 ⊢ (𝜑 → (𝑈 ∈ (LSHyp‘𝑊) ↔ (𝑈 ∈ 𝑆 ∧ 𝑈𝐶𝑉))) |
27 | 16, 24, 26 | mpbir2and 709 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑈 ∈ (LSHyp‘𝑊)) |
28 | 27 | 3ad2ant1 1131 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉 ∧ 𝑄 = ((LSpan‘𝑊)‘{𝑣})) → 𝑈 ∈ (LSHyp‘𝑊)) |
29 | 3, 4, 21, 22, 23, 28, 18 | lshpnelb 36925 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉 ∧ 𝑄 = ((LSpan‘𝑊)‘{𝑣})) → (¬ 𝑣 ∈ 𝑈 ↔ (𝑈 ⊕ ((LSpan‘𝑊)‘{𝑣})) = 𝑉)) |
30 | 29 | biimpd 228 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉 ∧ 𝑄 = ((LSpan‘𝑊)‘{𝑣})) → (¬ 𝑣 ∈ 𝑈 → (𝑈 ⊕ ((LSpan‘𝑊)‘{𝑣})) = 𝑉)) |
31 | 20, 30 | sylbird 259 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉 ∧ 𝑄 = ((LSpan‘𝑊)‘{𝑣})) → (¬ ((LSpan‘𝑊)‘{𝑣}) ⊆ 𝑈 → (𝑈 ⊕ ((LSpan‘𝑊)‘{𝑣})) = 𝑉)) |
32 | sseq1 3942 | . . . . . . . . 9 ⊢ (𝑄 = ((LSpan‘𝑊)‘{𝑣}) → (𝑄 ⊆ 𝑈 ↔ ((LSpan‘𝑊)‘{𝑣}) ⊆ 𝑈)) | |
33 | 32 | notbid 317 | . . . . . . . 8 ⊢ (𝑄 = ((LSpan‘𝑊)‘{𝑣}) → (¬ 𝑄 ⊆ 𝑈 ↔ ¬ ((LSpan‘𝑊)‘{𝑣}) ⊆ 𝑈)) |
34 | oveq2 7263 | . . . . . . . . 9 ⊢ (𝑄 = ((LSpan‘𝑊)‘{𝑣}) → (𝑈 ⊕ 𝑄) = (𝑈 ⊕ ((LSpan‘𝑊)‘{𝑣}))) | |
35 | 34 | eqeq1d 2740 | . . . . . . . 8 ⊢ (𝑄 = ((LSpan‘𝑊)‘{𝑣}) → ((𝑈 ⊕ 𝑄) = 𝑉 ↔ (𝑈 ⊕ ((LSpan‘𝑊)‘{𝑣})) = 𝑉)) |
36 | 33, 35 | imbi12d 344 | . . . . . . 7 ⊢ (𝑄 = ((LSpan‘𝑊)‘{𝑣}) → ((¬ 𝑄 ⊆ 𝑈 → (𝑈 ⊕ 𝑄) = 𝑉) ↔ (¬ ((LSpan‘𝑊)‘{𝑣}) ⊆ 𝑈 → (𝑈 ⊕ ((LSpan‘𝑊)‘{𝑣})) = 𝑉))) |
37 | 36 | 3ad2ant3 1133 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉 ∧ 𝑄 = ((LSpan‘𝑊)‘{𝑣})) → ((¬ 𝑄 ⊆ 𝑈 → (𝑈 ⊕ 𝑄) = 𝑉) ↔ (¬ ((LSpan‘𝑊)‘{𝑣}) ⊆ 𝑈 → (𝑈 ⊕ ((LSpan‘𝑊)‘{𝑣})) = 𝑉))) |
38 | 31, 37 | mpbird 256 | . . . . 5 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉 ∧ 𝑄 = ((LSpan‘𝑊)‘{𝑣})) → (¬ 𝑄 ⊆ 𝑈 → (𝑈 ⊕ 𝑄) = 𝑉)) |
39 | 38 | 3exp 1117 | . . . 4 ⊢ (𝜑 → (𝑣 ∈ 𝑉 → (𝑄 = ((LSpan‘𝑊)‘{𝑣}) → (¬ 𝑄 ⊆ 𝑈 → (𝑈 ⊕ 𝑄) = 𝑉)))) |
40 | 11, 39 | syl5 34 | . . 3 ⊢ (𝜑 → (𝑣 ∈ (𝑉 ∖ {(0g‘𝑊)}) → (𝑄 = ((LSpan‘𝑊)‘{𝑣}) → (¬ 𝑄 ⊆ 𝑈 → (𝑈 ⊕ 𝑄) = 𝑉)))) |
41 | 40 | rexlimdv 3211 | . 2 ⊢ (𝜑 → (∃𝑣 ∈ (𝑉 ∖ {(0g‘𝑊)})𝑄 = ((LSpan‘𝑊)‘{𝑣}) → (¬ 𝑄 ⊆ 𝑈 → (𝑈 ⊕ 𝑄) = 𝑉))) |
42 | 9, 10, 41 | mp2d 49 | 1 ⊢ (𝜑 → (𝑈 ⊕ 𝑄) = 𝑉) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ∃wrex 3064 ∖ cdif 3880 ⊆ wss 3883 {csn 4558 class class class wbr 5070 ‘cfv 6418 (class class class)co 7255 Basecbs 16840 0gc0g 17067 LSSumclsm 19154 LModclmod 20038 LSubSpclss 20108 LSpanclspn 20148 LVecclvec 20279 LSAtomsclsa 36915 LSHypclsh 36916 ⋖L clcv 36959 |
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-tpos 8013 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-3 11967 df-sets 16793 df-slot 16811 df-ndx 16823 df-base 16841 df-ress 16868 df-plusg 16901 df-mulr 16902 df-0g 17069 df-mgm 18241 df-sgrp 18290 df-mnd 18301 df-submnd 18346 df-grp 18495 df-minusg 18496 df-sbg 18497 df-subg 18667 df-cntz 18838 df-lsm 19156 df-cmn 19303 df-abl 19304 df-mgp 19636 df-ur 19653 df-ring 19700 df-oppr 19777 df-dvdsr 19798 df-unit 19799 df-invr 19829 df-drng 19908 df-lmod 20040 df-lss 20109 df-lsp 20149 df-lvec 20280 df-lsatoms 36917 df-lshyp 36918 df-lcv 36960 |
This theorem is referenced by: l1cvat 36996 |
Copyright terms: Public domain | W3C validator |