![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > lspindp5 | Structured version Visualization version GIF version |
Description: Obtain an independent vector set 𝑈, 𝑋, 𝑌 from a vector 𝑈 dependent on 𝑋 and 𝑍 and another independent set 𝑍, 𝑋, 𝑌. (Here we don't show the (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}) part of the independence, which passes straight through. We also don't show nonzero vector requirements that are redundant for this theorem. Different orderings can be obtained using lspexch 19323 and prcom 4403.) (Contributed by NM, 4-May-2015.) |
Ref | Expression |
---|---|
lspindp5.v | ⊢ 𝑉 = (Base‘𝑊) |
lspindp5.n | ⊢ 𝑁 = (LSpan‘𝑊) |
lspindp5.w | ⊢ (𝜑 → 𝑊 ∈ LVec) |
lspindp5.y | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
lspindp5.x | ⊢ (𝜑 → 𝑌 ∈ 𝑉) |
lspindp5.u | ⊢ (𝜑 → 𝑈 ∈ 𝑉) |
lspindp5.e | ⊢ (𝜑 → 𝑍 ∈ (𝑁‘{𝑋, 𝑈})) |
lspindp5.m | ⊢ (𝜑 → ¬ 𝑍 ∈ (𝑁‘{𝑋, 𝑌})) |
Ref | Expression |
---|---|
lspindp5 | ⊢ (𝜑 → ¬ 𝑈 ∈ (𝑁‘{𝑋, 𝑌})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | lspindp5.m | . . 3 ⊢ (𝜑 → ¬ 𝑍 ∈ (𝑁‘{𝑋, 𝑌})) | |
2 | lspindp5.e | . . . 4 ⊢ (𝜑 → 𝑍 ∈ (𝑁‘{𝑋, 𝑈})) | |
3 | ssel 3730 | . . . 4 ⊢ ((𝑁‘{𝑋, 𝑈}) ⊆ (𝑁‘{𝑋, 𝑌}) → (𝑍 ∈ (𝑁‘{𝑋, 𝑈}) → 𝑍 ∈ (𝑁‘{𝑋, 𝑌}))) | |
4 | 2, 3 | syl5com 31 | . . 3 ⊢ (𝜑 → ((𝑁‘{𝑋, 𝑈}) ⊆ (𝑁‘{𝑋, 𝑌}) → 𝑍 ∈ (𝑁‘{𝑋, 𝑌}))) |
5 | 1, 4 | mtod 189 | . 2 ⊢ (𝜑 → ¬ (𝑁‘{𝑋, 𝑈}) ⊆ (𝑁‘{𝑋, 𝑌})) |
6 | lspindp5.w | . . . . . . 7 ⊢ (𝜑 → 𝑊 ∈ LVec) | |
7 | lveclmod 19300 | . . . . . . 7 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod) | |
8 | 6, 7 | syl 17 | . . . . . 6 ⊢ (𝜑 → 𝑊 ∈ LMod) |
9 | lspindp5.y | . . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
10 | lspindp5.x | . . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
11 | prssi 4490 | . . . . . . 7 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → {𝑋, 𝑌} ⊆ 𝑉) | |
12 | 9, 10, 11 | syl2anc 696 | . . . . . 6 ⊢ (𝜑 → {𝑋, 𝑌} ⊆ 𝑉) |
13 | snsspr1 4482 | . . . . . . 7 ⊢ {𝑋} ⊆ {𝑋, 𝑌} | |
14 | 13 | a1i 11 | . . . . . 6 ⊢ (𝜑 → {𝑋} ⊆ {𝑋, 𝑌}) |
15 | lspindp5.v | . . . . . . 7 ⊢ 𝑉 = (Base‘𝑊) | |
16 | lspindp5.n | . . . . . . 7 ⊢ 𝑁 = (LSpan‘𝑊) | |
17 | 15, 16 | lspss 19178 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ {𝑋, 𝑌} ⊆ 𝑉 ∧ {𝑋} ⊆ {𝑋, 𝑌}) → (𝑁‘{𝑋}) ⊆ (𝑁‘{𝑋, 𝑌})) |
18 | 8, 12, 14, 17 | syl3anc 1473 | . . . . 5 ⊢ (𝜑 → (𝑁‘{𝑋}) ⊆ (𝑁‘{𝑋, 𝑌})) |
19 | 18 | biantrurd 530 | . . . 4 ⊢ (𝜑 → ((𝑁‘{𝑈}) ⊆ (𝑁‘{𝑋, 𝑌}) ↔ ((𝑁‘{𝑋}) ⊆ (𝑁‘{𝑋, 𝑌}) ∧ (𝑁‘{𝑈}) ⊆ (𝑁‘{𝑋, 𝑌})))) |
20 | eqid 2752 | . . . . . . . 8 ⊢ (LSubSp‘𝑊) = (LSubSp‘𝑊) | |
21 | 20 | lsssssubg 19152 | . . . . . . 7 ⊢ (𝑊 ∈ LMod → (LSubSp‘𝑊) ⊆ (SubGrp‘𝑊)) |
22 | 8, 21 | syl 17 | . . . . . 6 ⊢ (𝜑 → (LSubSp‘𝑊) ⊆ (SubGrp‘𝑊)) |
23 | 15, 20, 16 | lspsncl 19171 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{𝑋}) ∈ (LSubSp‘𝑊)) |
24 | 8, 9, 23 | syl2anc 696 | . . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑋}) ∈ (LSubSp‘𝑊)) |
25 | 22, 24 | sseldd 3737 | . . . . 5 ⊢ (𝜑 → (𝑁‘{𝑋}) ∈ (SubGrp‘𝑊)) |
26 | lspindp5.u | . . . . . . 7 ⊢ (𝜑 → 𝑈 ∈ 𝑉) | |
27 | 15, 20, 16 | lspsncl 19171 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑉) → (𝑁‘{𝑈}) ∈ (LSubSp‘𝑊)) |
28 | 8, 26, 27 | syl2anc 696 | . . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑈}) ∈ (LSubSp‘𝑊)) |
29 | 22, 28 | sseldd 3737 | . . . . 5 ⊢ (𝜑 → (𝑁‘{𝑈}) ∈ (SubGrp‘𝑊)) |
30 | 15, 20, 16, 8, 9, 10 | lspprcl 19172 | . . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑋, 𝑌}) ∈ (LSubSp‘𝑊)) |
31 | 22, 30 | sseldd 3737 | . . . . 5 ⊢ (𝜑 → (𝑁‘{𝑋, 𝑌}) ∈ (SubGrp‘𝑊)) |
32 | eqid 2752 | . . . . . 6 ⊢ (LSSum‘𝑊) = (LSSum‘𝑊) | |
33 | 32 | lsmlub 18270 | . . . . 5 ⊢ (((𝑁‘{𝑋}) ∈ (SubGrp‘𝑊) ∧ (𝑁‘{𝑈}) ∈ (SubGrp‘𝑊) ∧ (𝑁‘{𝑋, 𝑌}) ∈ (SubGrp‘𝑊)) → (((𝑁‘{𝑋}) ⊆ (𝑁‘{𝑋, 𝑌}) ∧ (𝑁‘{𝑈}) ⊆ (𝑁‘{𝑋, 𝑌})) ↔ ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑈})) ⊆ (𝑁‘{𝑋, 𝑌}))) |
34 | 25, 29, 31, 33 | syl3anc 1473 | . . . 4 ⊢ (𝜑 → (((𝑁‘{𝑋}) ⊆ (𝑁‘{𝑋, 𝑌}) ∧ (𝑁‘{𝑈}) ⊆ (𝑁‘{𝑋, 𝑌})) ↔ ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑈})) ⊆ (𝑁‘{𝑋, 𝑌}))) |
35 | 19, 34 | bitrd 268 | . . 3 ⊢ (𝜑 → ((𝑁‘{𝑈}) ⊆ (𝑁‘{𝑋, 𝑌}) ↔ ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑈})) ⊆ (𝑁‘{𝑋, 𝑌}))) |
36 | 15, 20, 16, 8, 30, 26 | lspsnel5 19189 | . . 3 ⊢ (𝜑 → (𝑈 ∈ (𝑁‘{𝑋, 𝑌}) ↔ (𝑁‘{𝑈}) ⊆ (𝑁‘{𝑋, 𝑌}))) |
37 | 15, 16, 32, 8, 9, 26 | lsmpr 19283 | . . . 4 ⊢ (𝜑 → (𝑁‘{𝑋, 𝑈}) = ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑈}))) |
38 | 37 | sseq1d 3765 | . . 3 ⊢ (𝜑 → ((𝑁‘{𝑋, 𝑈}) ⊆ (𝑁‘{𝑋, 𝑌}) ↔ ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑈})) ⊆ (𝑁‘{𝑋, 𝑌}))) |
39 | 35, 36, 38 | 3bitr4d 300 | . 2 ⊢ (𝜑 → (𝑈 ∈ (𝑁‘{𝑋, 𝑌}) ↔ (𝑁‘{𝑋, 𝑈}) ⊆ (𝑁‘{𝑋, 𝑌}))) |
40 | 5, 39 | mtbird 314 | 1 ⊢ (𝜑 → ¬ 𝑈 ∈ (𝑁‘{𝑋, 𝑌})) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∧ wa 383 = wceq 1624 ∈ wcel 2131 ⊆ wss 3707 {csn 4313 {cpr 4315 ‘cfv 6041 (class class class)co 6805 Basecbs 16051 SubGrpcsubg 17781 LSSumclsm 18241 LModclmod 19057 LSubSpclss 19126 LSpanclspn 19165 LVecclvec 19296 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1863 ax-4 1878 ax-5 1980 ax-6 2046 ax-7 2082 ax-8 2133 ax-9 2140 ax-10 2160 ax-11 2175 ax-12 2188 ax-13 2383 ax-ext 2732 ax-rep 4915 ax-sep 4925 ax-nul 4933 ax-pow 4984 ax-pr 5047 ax-un 7106 ax-cnex 10176 ax-resscn 10177 ax-1cn 10178 ax-icn 10179 ax-addcl 10180 ax-addrcl 10181 ax-mulcl 10182 ax-mulrcl 10183 ax-mulcom 10184 ax-addass 10185 ax-mulass 10186 ax-distr 10187 ax-i2m1 10188 ax-1ne0 10189 ax-1rid 10190 ax-rnegex 10191 ax-rrecex 10192 ax-cnre 10193 ax-pre-lttri 10194 ax-pre-lttrn 10195 ax-pre-ltadd 10196 ax-pre-mulgt0 10197 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1627 df-ex 1846 df-nf 1851 df-sb 2039 df-eu 2603 df-mo 2604 df-clab 2739 df-cleq 2745 df-clel 2748 df-nfc 2883 df-ne 2925 df-nel 3028 df-ral 3047 df-rex 3048 df-reu 3049 df-rmo 3050 df-rab 3051 df-v 3334 df-sbc 3569 df-csb 3667 df-dif 3710 df-un 3712 df-in 3714 df-ss 3721 df-pss 3723 df-nul 4051 df-if 4223 df-pw 4296 df-sn 4314 df-pr 4316 df-tp 4318 df-op 4320 df-uni 4581 df-int 4620 df-iun 4666 df-br 4797 df-opab 4857 df-mpt 4874 df-tr 4897 df-id 5166 df-eprel 5171 df-po 5179 df-so 5180 df-fr 5217 df-we 5219 df-xp 5264 df-rel 5265 df-cnv 5266 df-co 5267 df-dm 5268 df-rn 5269 df-res 5270 df-ima 5271 df-pred 5833 df-ord 5879 df-on 5880 df-lim 5881 df-suc 5882 df-iota 6004 df-fun 6043 df-fn 6044 df-f 6045 df-f1 6046 df-fo 6047 df-f1o 6048 df-fv 6049 df-riota 6766 df-ov 6808 df-oprab 6809 df-mpt2 6810 df-om 7223 df-1st 7325 df-2nd 7326 df-wrecs 7568 df-recs 7629 df-rdg 7667 df-er 7903 df-en 8114 df-dom 8115 df-sdom 8116 df-pnf 10260 df-mnf 10261 df-xr 10262 df-ltxr 10263 df-le 10264 df-sub 10452 df-neg 10453 df-nn 11205 df-2 11263 df-ndx 16054 df-slot 16055 df-base 16057 df-sets 16058 df-ress 16059 df-plusg 16148 df-0g 16296 df-mgm 17435 df-sgrp 17477 df-mnd 17488 df-submnd 17529 df-grp 17618 df-minusg 17619 df-sbg 17620 df-subg 17784 df-cntz 17942 df-lsm 18243 df-cmn 18387 df-abl 18388 df-mgp 18682 df-ur 18694 df-ring 18741 df-lmod 19059 df-lss 19127 df-lsp 19166 df-lvec 19297 |
This theorem is referenced by: mapdh8b 37563 |
Copyright terms: Public domain | W3C validator |