| 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 21036 and prcom 4684.) (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 3929 | . . . 4 ⊢ ((𝑁‘{𝑋, 𝑈}) ⊆ (𝑁‘{𝑋, 𝑌}) → (𝑍 ∈ (𝑁‘{𝑋, 𝑈}) → 𝑍 ∈ (𝑁‘{𝑋, 𝑌}))) | |
| 4 | 2, 3 | syl5com 31 | . . 3 ⊢ (𝜑 → ((𝑁‘{𝑋, 𝑈}) ⊆ (𝑁‘{𝑋, 𝑌}) → 𝑍 ∈ (𝑁‘{𝑋, 𝑌}))) |
| 5 | 1, 4 | mtod 198 | . 2 ⊢ (𝜑 → ¬ (𝑁‘{𝑋, 𝑈}) ⊆ (𝑁‘{𝑋, 𝑌})) |
| 6 | lspindp5.w | . . . . . . 7 ⊢ (𝜑 → 𝑊 ∈ LVec) | |
| 7 | lveclmod 21010 | . . . . . . 7 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod) | |
| 8 | 6, 7 | syl 17 | . . . . . 6 ⊢ (𝜑 → 𝑊 ∈ LMod) |
| 9 | lspindp5.y | . . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 10 | lspindp5.x | . . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
| 11 | prssi 4772 | . . . . . . 7 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → {𝑋, 𝑌} ⊆ 𝑉) | |
| 12 | 9, 10, 11 | syl2anc 584 | . . . . . 6 ⊢ (𝜑 → {𝑋, 𝑌} ⊆ 𝑉) |
| 13 | snsspr1 4765 | . . . . . . 7 ⊢ {𝑋} ⊆ {𝑋, 𝑌} | |
| 14 | 13 | a1i 11 | . . . . . 6 ⊢ (𝜑 → {𝑋} ⊆ {𝑋, 𝑌}) |
| 15 | lspindp5.v | . . . . . . 7 ⊢ 𝑉 = (Base‘𝑊) | |
| 16 | lspindp5.n | . . . . . . 7 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 17 | 15, 16 | lspss 20887 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ {𝑋, 𝑌} ⊆ 𝑉 ∧ {𝑋} ⊆ {𝑋, 𝑌}) → (𝑁‘{𝑋}) ⊆ (𝑁‘{𝑋, 𝑌})) |
| 18 | 8, 12, 14, 17 | syl3anc 1373 | . . . . 5 ⊢ (𝜑 → (𝑁‘{𝑋}) ⊆ (𝑁‘{𝑋, 𝑌})) |
| 19 | 18 | biantrurd 532 | . . . 4 ⊢ (𝜑 → ((𝑁‘{𝑈}) ⊆ (𝑁‘{𝑋, 𝑌}) ↔ ((𝑁‘{𝑋}) ⊆ (𝑁‘{𝑋, 𝑌}) ∧ (𝑁‘{𝑈}) ⊆ (𝑁‘{𝑋, 𝑌})))) |
| 20 | eqid 2729 | . . . . . . . 8 ⊢ (LSubSp‘𝑊) = (LSubSp‘𝑊) | |
| 21 | 20 | lsssssubg 20861 | . . . . . . 7 ⊢ (𝑊 ∈ LMod → (LSubSp‘𝑊) ⊆ (SubGrp‘𝑊)) |
| 22 | 8, 21 | syl 17 | . . . . . 6 ⊢ (𝜑 → (LSubSp‘𝑊) ⊆ (SubGrp‘𝑊)) |
| 23 | 15, 20, 16 | lspsncl 20880 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{𝑋}) ∈ (LSubSp‘𝑊)) |
| 24 | 8, 9, 23 | syl2anc 584 | . . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑋}) ∈ (LSubSp‘𝑊)) |
| 25 | 22, 24 | sseldd 3936 | . . . . 5 ⊢ (𝜑 → (𝑁‘{𝑋}) ∈ (SubGrp‘𝑊)) |
| 26 | lspindp5.u | . . . . . . 7 ⊢ (𝜑 → 𝑈 ∈ 𝑉) | |
| 27 | 15, 20, 16 | lspsncl 20880 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑉) → (𝑁‘{𝑈}) ∈ (LSubSp‘𝑊)) |
| 28 | 8, 26, 27 | syl2anc 584 | . . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑈}) ∈ (LSubSp‘𝑊)) |
| 29 | 22, 28 | sseldd 3936 | . . . . 5 ⊢ (𝜑 → (𝑁‘{𝑈}) ∈ (SubGrp‘𝑊)) |
| 30 | 15, 20, 16, 8, 9, 10 | lspprcl 20881 | . . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑋, 𝑌}) ∈ (LSubSp‘𝑊)) |
| 31 | 22, 30 | sseldd 3936 | . . . . 5 ⊢ (𝜑 → (𝑁‘{𝑋, 𝑌}) ∈ (SubGrp‘𝑊)) |
| 32 | eqid 2729 | . . . . . 6 ⊢ (LSSum‘𝑊) = (LSSum‘𝑊) | |
| 33 | 32 | lsmlub 19543 | . . . . 5 ⊢ (((𝑁‘{𝑋}) ∈ (SubGrp‘𝑊) ∧ (𝑁‘{𝑈}) ∈ (SubGrp‘𝑊) ∧ (𝑁‘{𝑋, 𝑌}) ∈ (SubGrp‘𝑊)) → (((𝑁‘{𝑋}) ⊆ (𝑁‘{𝑋, 𝑌}) ∧ (𝑁‘{𝑈}) ⊆ (𝑁‘{𝑋, 𝑌})) ↔ ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑈})) ⊆ (𝑁‘{𝑋, 𝑌}))) |
| 34 | 25, 29, 31, 33 | syl3anc 1373 | . . . 4 ⊢ (𝜑 → (((𝑁‘{𝑋}) ⊆ (𝑁‘{𝑋, 𝑌}) ∧ (𝑁‘{𝑈}) ⊆ (𝑁‘{𝑋, 𝑌})) ↔ ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑈})) ⊆ (𝑁‘{𝑋, 𝑌}))) |
| 35 | 19, 34 | bitrd 279 | . . 3 ⊢ (𝜑 → ((𝑁‘{𝑈}) ⊆ (𝑁‘{𝑋, 𝑌}) ↔ ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑈})) ⊆ (𝑁‘{𝑋, 𝑌}))) |
| 36 | 15, 20, 16, 8, 30, 26 | ellspsn5b 20898 | . . 3 ⊢ (𝜑 → (𝑈 ∈ (𝑁‘{𝑋, 𝑌}) ↔ (𝑁‘{𝑈}) ⊆ (𝑁‘{𝑋, 𝑌}))) |
| 37 | 15, 16, 32, 8, 9, 26 | lsmpr 20993 | . . . 4 ⊢ (𝜑 → (𝑁‘{𝑋, 𝑈}) = ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑈}))) |
| 38 | 37 | sseq1d 3967 | . . 3 ⊢ (𝜑 → ((𝑁‘{𝑋, 𝑈}) ⊆ (𝑁‘{𝑋, 𝑌}) ↔ ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑈})) ⊆ (𝑁‘{𝑋, 𝑌}))) |
| 39 | 35, 36, 38 | 3bitr4d 311 | . 2 ⊢ (𝜑 → (𝑈 ∈ (𝑁‘{𝑋, 𝑌}) ↔ (𝑁‘{𝑋, 𝑈}) ⊆ (𝑁‘{𝑋, 𝑌}))) |
| 40 | 5, 39 | mtbird 325 | 1 ⊢ (𝜑 → ¬ 𝑈 ∈ (𝑁‘{𝑋, 𝑌})) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ⊆ wss 3903 {csn 4577 {cpr 4579 ‘cfv 6482 (class class class)co 7349 Basecbs 17120 SubGrpcsubg 18999 LSSumclsm 19513 LModclmod 20763 LSubSpclss 20834 LSpanclspn 20874 LVecclvec 21006 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5218 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671 ax-cnex 11065 ax-resscn 11066 ax-1cn 11067 ax-icn 11068 ax-addcl 11069 ax-addrcl 11070 ax-mulcl 11071 ax-mulrcl 11072 ax-mulcom 11073 ax-addass 11074 ax-mulass 11075 ax-distr 11076 ax-i2m1 11077 ax-1ne0 11078 ax-1rid 11079 ax-rnegex 11080 ax-rrecex 11081 ax-cnre 11082 ax-pre-lttri 11083 ax-pre-lttrn 11084 ax-pre-ltadd 11085 ax-pre-mulgt0 11086 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3343 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-int 4897 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5174 df-tr 5200 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6249 df-ord 6310 df-on 6311 df-lim 6312 df-suc 6313 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-riota 7306 df-ov 7352 df-oprab 7353 df-mpo 7354 df-om 7800 df-1st 7924 df-2nd 7925 df-frecs 8214 df-wrecs 8245 df-recs 8294 df-rdg 8332 df-er 8625 df-en 8873 df-dom 8874 df-sdom 8875 df-pnf 11151 df-mnf 11152 df-xr 11153 df-ltxr 11154 df-le 11155 df-sub 11349 df-neg 11350 df-nn 12129 df-2 12191 df-sets 17075 df-slot 17093 df-ndx 17105 df-base 17121 df-ress 17142 df-plusg 17174 df-0g 17345 df-mgm 18514 df-sgrp 18593 df-mnd 18609 df-submnd 18658 df-grp 18815 df-minusg 18816 df-sbg 18817 df-subg 19002 df-cntz 19196 df-lsm 19515 df-cmn 19661 df-abl 19662 df-mgp 20026 df-ur 20067 df-ring 20120 df-lmod 20765 df-lss 20835 df-lsp 20875 df-lvec 21007 |
| This theorem is referenced by: mapdh8b 41769 |
| Copyright terms: Public domain | W3C validator |