| 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 2763 | . . . . . . . 8 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
| 3 | lsmsp.s | . . . . . . . 8 ⊢ 𝑆 = (LSubSp‘𝑊) | |
| 4 | 2, 3 | lssss 21241 | . . . . . . 7 ⊢ (𝑇 ∈ 𝑆 → 𝑇 ⊆ (Base‘𝑊)) |
| 5 | 4 | 3ad2ant2 1152 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑇 ⊆ (Base‘𝑊)) |
| 6 | 2, 3 | lssss 21241 | . . . . . . 7 ⊢ (𝑈 ∈ 𝑆 → 𝑈 ⊆ (Base‘𝑊)) |
| 7 | 6 | 3ad2ant3 1153 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑈 ⊆ (Base‘𝑊)) |
| 8 | 5, 7 | unssd 4193 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ∪ 𝑈) ⊆ (Base‘𝑊)) |
| 9 | lsmsp.n | . . . . . 6 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 10 | 2, 9 | lspssid 21290 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ (Base‘𝑊)) → (𝑇 ∪ 𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 11 | 1, 8, 10 | syl2anc 596 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ∪ 𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 12 | 11 | unssad 4194 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑇 ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 13 | 11 | unssbd 4195 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑈 ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 14 | 3 | lsssssubg 21263 | . . . . . 6 ⊢ (𝑊 ∈ LMod → 𝑆 ⊆ (SubGrp‘𝑊)) |
| 15 | 14 | 3ad2ant1 1151 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑆 ⊆ (SubGrp‘𝑊)) |
| 16 | simp2 1155 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑇 ∈ 𝑆) | |
| 17 | 15, 16 | sseldd 3914 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑇 ∈ (SubGrp‘𝑊)) |
| 18 | simp3 1156 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑈 ∈ 𝑆) | |
| 19 | 15, 18 | sseldd 3914 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑈 ∈ (SubGrp‘𝑊)) |
| 20 | 2, 3, 9 | lspcl 21281 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ (Base‘𝑊)) → (𝑁‘(𝑇 ∪ 𝑈)) ∈ 𝑆) |
| 21 | 1, 8, 20 | syl2anc 596 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑁‘(𝑇 ∪ 𝑈)) ∈ 𝑆) |
| 22 | 15, 21 | sseldd 3914 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑁‘(𝑇 ∪ 𝑈)) ∈ (SubGrp‘𝑊)) |
| 23 | lsmsp.p | . . . . 5 ⊢ ⊕ = (LSSum‘𝑊) | |
| 24 | 23 | lsmlub 19908 | . . . 4 ⊢ ((𝑇 ∈ (SubGrp‘𝑊) ∧ 𝑈 ∈ (SubGrp‘𝑊) ∧ (𝑁‘(𝑇 ∪ 𝑈)) ∈ (SubGrp‘𝑊)) → ((𝑇 ⊆ (𝑁‘(𝑇 ∪ 𝑈)) ∧ 𝑈 ⊆ (𝑁‘(𝑇 ∪ 𝑈))) ↔ (𝑇 ⊕ 𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈)))) |
| 25 | 17, 19, 22, 24 | syl3anc 1399 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → ((𝑇 ⊆ (𝑁‘(𝑇 ∪ 𝑈)) ∧ 𝑈 ⊆ (𝑁‘(𝑇 ∪ 𝑈))) ↔ (𝑇 ⊕ 𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈)))) |
| 26 | 12, 13, 25 | mpbi2and 725 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ⊕ 𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 27 | 3, 23 | lsmcl 21388 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ⊕ 𝑈) ∈ 𝑆) |
| 28 | 23 | lsmunss 19903 | . . . 4 ⊢ ((𝑇 ∈ (SubGrp‘𝑊) ∧ 𝑈 ∈ (SubGrp‘𝑊)) → (𝑇 ∪ 𝑈) ⊆ (𝑇 ⊕ 𝑈)) |
| 29 | 17, 19, 28 | syl2anc 596 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ∪ 𝑈) ⊆ (𝑇 ⊕ 𝑈)) |
| 30 | 3, 9 | lspssp 21293 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ⊕ 𝑈) ∈ 𝑆 ∧ (𝑇 ∪ 𝑈) ⊆ (𝑇 ⊕ 𝑈)) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ (𝑇 ⊕ 𝑈)) |
| 31 | 1, 27, 29, 30 | syl3anc 1399 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ (𝑇 ⊕ 𝑈)) |
| 32 | 26, 31 | eqssd 3930 | 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 2147 ⊆ wss 3900 ∪ cun 4152 ‘cfv 6558 (class class class)co 7443 Basecbs 17416 SubGrpcsubg 19359 LSSumclsm 19878 LModclmod 21165 LSubSpclss 21236 LSpanclspn 21276 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-cnex 11283 ax-resscn 11284 ax-1cn 11285 ax-icn 11286 ax-addcl 11287 ax-addrcl 11288 ax-mulcl 11289 ax-mulrcl 11290 ax-mulcom 11291 ax-addass 11292 ax-mulass 11293 ax-distr 11294 ax-i2m1 11295 ax-1ne0 11296 ax-1rid 11297 ax-rnegex 11298 ax-rrecex 11299 ax-cnre 11300 ax-pre-lttri 11301 ax-pre-lttrn 11302 ax-pre-ltadd 11303 ax-pre-mulgt0 11304 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7902 df-1st 8025 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-er 8745 df-en 9002 df-dom 9003 df-sdom 9004 df-pnf 11372 df-mnf 11373 df-xr 11374 df-ltxr 11375 df-le 11376 df-sub 11570 df-neg 11571 df-nn 12363 df-2 12432 df-sets 17371 df-slot 17389 df-ndx 17401 df-base 17417 df-ress 17438 df-plusg 17470 df-0g 17641 df-mgm 18845 df-sgrp 18937 df-mnd 18953 df-submnd 19008 df-grp 19176 df-minusg 19177 df-sbg 19178 df-subg 19362 df-cntz 19561 df-lsm 19880 df-cmn 20026 df-abl 20027 df-mgp 20391 df-ur 20438 df-ring 20491 df-lmod 21167 df-lss 21237 df-lsp 21277 |
| This theorem is used by: lsmsp2 21392 lsmpr 21394 lsppr 21398 lsmidllsp 21567 islshpsm 40229 lshpnel2N 40234 lkrlsp3 40353 djhlsmcl 42663 dochsatshp 42700 |
| Copyright terms: Public domain | W3C validator |