| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lsmsp | Structured version Visualization version GIF version | ||
| Description: Subspace sum in terms of span. (Contributed by NM, 6-Feb-2014.) (Proof shortened by Mario Carneiro, 21-Jun-2014.) |
| Ref | Expression |
|---|---|
| lsmsp.s | ⊢ 𝑆 = (LSubSp‘𝑊) |
| lsmsp.n | ⊢ 𝑁 = (LSpan‘𝑊) |
| lsmsp.p | ⊢ ⊕ = (LSSum‘𝑊) |
| Ref | Expression |
|---|---|
| lsmsp | ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ⊕ 𝑈) = (𝑁‘(𝑇 ∪ 𝑈))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1154 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑊 ∈ LMod) | |
| 2 | eqid 2766 | . . . . . . . 8 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
| 3 | lsmsp.s | . . . . . . . 8 ⊢ 𝑆 = (LSubSp‘𝑊) | |
| 4 | 2, 3 | lssss 21094 | . . . . . . 7 ⊢ (𝑇 ∈ 𝑆 → 𝑇 ⊆ (Base‘𝑊)) |
| 5 | 4 | 3ad2ant2 1152 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑇 ⊆ (Base‘𝑊)) |
| 6 | 2, 3 | lssss 21094 | . . . . . . 7 ⊢ (𝑈 ∈ 𝑆 → 𝑈 ⊆ (Base‘𝑊)) |
| 7 | 6 | 3ad2ant3 1153 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑈 ⊆ (Base‘𝑊)) |
| 8 | 5, 7 | unssd 4148 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ∪ 𝑈) ⊆ (Base‘𝑊)) |
| 9 | lsmsp.n | . . . . . 6 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 10 | 2, 9 | lspssid 21143 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ (Base‘𝑊)) → (𝑇 ∪ 𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 11 | 1, 8, 10 | syl2anc 596 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ∪ 𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 12 | 11 | unssad 4149 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑇 ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 13 | 11 | unssbd 4150 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑈 ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 14 | 3 | lsssssubg 21116 | . . . . . 6 ⊢ (𝑊 ∈ LMod → 𝑆 ⊆ (SubGrp‘𝑊)) |
| 15 | 14 | 3ad2ant1 1151 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑆 ⊆ (SubGrp‘𝑊)) |
| 16 | simp2 1155 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑇 ∈ 𝑆) | |
| 17 | 15, 16 | sseldd 3941 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑇 ∈ (SubGrp‘𝑊)) |
| 18 | simp3 1156 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑈 ∈ 𝑆) | |
| 19 | 15, 18 | sseldd 3941 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑈 ∈ (SubGrp‘𝑊)) |
| 20 | 2, 3, 9 | lspcl 21134 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ (Base‘𝑊)) → (𝑁‘(𝑇 ∪ 𝑈)) ∈ 𝑆) |
| 21 | 1, 8, 20 | syl2anc 596 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑁‘(𝑇 ∪ 𝑈)) ∈ 𝑆) |
| 22 | 15, 21 | sseldd 3941 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑁‘(𝑇 ∪ 𝑈)) ∈ (SubGrp‘𝑊)) |
| 23 | lsmsp.p | . . . . 5 ⊢ ⊕ = (LSSum‘𝑊) | |
| 24 | 23 | lsmlub 19765 | . . . 4 ⊢ ((𝑇 ∈ (SubGrp‘𝑊) ∧ 𝑈 ∈ (SubGrp‘𝑊) ∧ (𝑁‘(𝑇 ∪ 𝑈)) ∈ (SubGrp‘𝑊)) → ((𝑇 ⊆ (𝑁‘(𝑇 ∪ 𝑈)) ∧ 𝑈 ⊆ (𝑁‘(𝑇 ∪ 𝑈))) ↔ (𝑇 ⊕ 𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈)))) |
| 25 | 17, 19, 22, 24 | syl3anc 1398 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → ((𝑇 ⊆ (𝑁‘(𝑇 ∪ 𝑈)) ∧ 𝑈 ⊆ (𝑁‘(𝑇 ∪ 𝑈))) ↔ (𝑇 ⊕ 𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈)))) |
| 26 | 12, 13, 25 | mpbi2and 725 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ⊕ 𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 27 | 3, 23 | lsmcl 21241 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ⊕ 𝑈) ∈ 𝑆) |
| 28 | 23 | lsmunss 19760 | . . . 4 ⊢ ((𝑇 ∈ (SubGrp‘𝑊) ∧ 𝑈 ∈ (SubGrp‘𝑊)) → (𝑇 ∪ 𝑈) ⊆ (𝑇 ⊕ 𝑈)) |
| 29 | 17, 19, 28 | syl2anc 596 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ∪ 𝑈) ⊆ (𝑇 ⊕ 𝑈)) |
| 30 | 3, 9 | lspssp 21146 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ⊕ 𝑈) ∈ 𝑆 ∧ (𝑇 ∪ 𝑈) ⊆ (𝑇 ⊕ 𝑈)) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ (𝑇 ⊕ 𝑈)) |
| 31 | 1, 27, 29, 30 | syl3anc 1398 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ (𝑇 ⊕ 𝑈)) |
| 32 | 26, 31 | eqssd 3957 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ⊕ 𝑈) = (𝑁‘(𝑇 ∪ 𝑈))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ∪ cun 3906 ⊆ wss 3908 ‘cfv 6543 (class class class)co 7423 Basecbs 17294 SubGrpcsubg 19217 LSSumclsm 19735 LModclmod 21018 LSubSpclss 21089 LSpanclspn 21129 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-cnex 11174 ax-resscn 11175 ax-1cn 11176 ax-icn 11177 ax-addcl 11178 ax-addrcl 11179 ax-mulcl 11180 ax-mulrcl 11181 ax-mulcom 11182 ax-addass 11183 ax-mulass 11184 ax-distr 11185 ax-i2m1 11186 ax-1ne0 11187 ax-1rid 11188 ax-rnegex 11189 ax-rrecex 11190 ax-cnre 11191 ax-pre-lttri 11192 ax-pre-lttrn 11193 ax-pre-ltadd 11194 ax-pre-mulgt0 11195 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-int 4918 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-om 7872 df-1st 7995 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 df-er 8703 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11263 df-mnf 11264 df-xr 11265 df-ltxr 11266 df-le 11267 df-sub 11461 df-neg 11462 df-nn 12252 df-2 12321 df-sets 17249 df-slot 17267 df-ndx 17279 df-base 17295 df-ress 17316 df-plusg 17348 df-0g 17519 df-mgm 18723 df-sgrp 18806 df-mnd 18822 df-submnd 18873 df-grp 19034 df-minusg 19035 df-sbg 19036 df-subg 19220 df-cntz 19418 df-lsm 19737 df-cmn 19883 df-abl 19884 df-mgp 20248 df-ur 20295 df-ring 20348 df-lmod 21020 df-lss 21090 df-lsp 21130 |
| This theorem is used by: lsmsp2 21245 lsmpr 21247 lsppr 21251 lsmidllsp 21420 islshpsm 39795 lshpnel2N 39800 lkrlsp3 39919 djhlsmcl 42229 dochsatshp 42266 |
| Copyright terms: Public domain | W3C validator |