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 1135 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑊 ∈ LMod) | |
2 | eqid 2735 | . . . . . . . 8 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
3 | lsmsp.s | . . . . . . . 8 ⊢ 𝑆 = (LSubSp‘𝑊) | |
4 | 2, 3 | lssss 20261 | . . . . . . 7 ⊢ (𝑇 ∈ 𝑆 → 𝑇 ⊆ (Base‘𝑊)) |
5 | 4 | 3ad2ant2 1133 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑇 ⊆ (Base‘𝑊)) |
6 | 2, 3 | lssss 20261 | . . . . . . 7 ⊢ (𝑈 ∈ 𝑆 → 𝑈 ⊆ (Base‘𝑊)) |
7 | 6 | 3ad2ant3 1134 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑈 ⊆ (Base‘𝑊)) |
8 | 5, 7 | unssd 4125 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ∪ 𝑈) ⊆ (Base‘𝑊)) |
9 | lsmsp.n | . . . . . 6 ⊢ 𝑁 = (LSpan‘𝑊) | |
10 | 2, 9 | lspssid 20310 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ (Base‘𝑊)) → (𝑇 ∪ 𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
11 | 1, 8, 10 | syl2anc 584 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ∪ 𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
12 | 11 | unssad 4126 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑇 ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
13 | 11 | unssbd 4127 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑈 ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
14 | 3 | lsssssubg 20283 | . . . . . 6 ⊢ (𝑊 ∈ LMod → 𝑆 ⊆ (SubGrp‘𝑊)) |
15 | 14 | 3ad2ant1 1132 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑆 ⊆ (SubGrp‘𝑊)) |
16 | simp2 1136 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑇 ∈ 𝑆) | |
17 | 15, 16 | sseldd 3926 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑇 ∈ (SubGrp‘𝑊)) |
18 | simp3 1137 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑈 ∈ 𝑆) | |
19 | 15, 18 | sseldd 3926 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑈 ∈ (SubGrp‘𝑊)) |
20 | 2, 3, 9 | lspcl 20301 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ (Base‘𝑊)) → (𝑁‘(𝑇 ∪ 𝑈)) ∈ 𝑆) |
21 | 1, 8, 20 | syl2anc 584 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑁‘(𝑇 ∪ 𝑈)) ∈ 𝑆) |
22 | 15, 21 | sseldd 3926 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑁‘(𝑇 ∪ 𝑈)) ∈ (SubGrp‘𝑊)) |
23 | lsmsp.p | . . . . 5 ⊢ ⊕ = (LSSum‘𝑊) | |
24 | 23 | lsmlub 19329 | . . . 4 ⊢ ((𝑇 ∈ (SubGrp‘𝑊) ∧ 𝑈 ∈ (SubGrp‘𝑊) ∧ (𝑁‘(𝑇 ∪ 𝑈)) ∈ (SubGrp‘𝑊)) → ((𝑇 ⊆ (𝑁‘(𝑇 ∪ 𝑈)) ∧ 𝑈 ⊆ (𝑁‘(𝑇 ∪ 𝑈))) ↔ (𝑇 ⊕ 𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈)))) |
25 | 17, 19, 22, 24 | syl3anc 1370 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → ((𝑇 ⊆ (𝑁‘(𝑇 ∪ 𝑈)) ∧ 𝑈 ⊆ (𝑁‘(𝑇 ∪ 𝑈))) ↔ (𝑇 ⊕ 𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈)))) |
26 | 12, 13, 25 | mpbi2and 709 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ⊕ 𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
27 | 3, 23 | lsmcl 20408 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ⊕ 𝑈) ∈ 𝑆) |
28 | 23 | lsmunss 19323 | . . . 4 ⊢ ((𝑇 ∈ (SubGrp‘𝑊) ∧ 𝑈 ∈ (SubGrp‘𝑊)) → (𝑇 ∪ 𝑈) ⊆ (𝑇 ⊕ 𝑈)) |
29 | 17, 19, 28 | syl2anc 584 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ∪ 𝑈) ⊆ (𝑇 ⊕ 𝑈)) |
30 | 3, 9 | lspssp 20313 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ⊕ 𝑈) ∈ 𝑆 ∧ (𝑇 ∪ 𝑈) ⊆ (𝑇 ⊕ 𝑈)) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ (𝑇 ⊕ 𝑈)) |
31 | 1, 27, 29, 30 | syl3anc 1370 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ (𝑇 ⊕ 𝑈)) |
32 | 26, 31 | eqssd 3942 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ⊕ 𝑈) = (𝑁‘(𝑇 ∪ 𝑈))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1086 = wceq 1538 ∈ wcel 2103 ∪ cun 3889 ⊆ wss 3891 ‘cfv 6458 (class class class)co 7308 Basecbs 16971 SubGrpcsubg 18808 LSSumclsm 19298 LModclmod 20186 LSubSpclss 20256 LSpanclspn 20296 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1910 ax-6 1968 ax-7 2008 ax-8 2105 ax-9 2113 ax-10 2134 ax-11 2151 ax-12 2168 ax-ext 2706 ax-rep 5217 ax-sep 5231 ax-nul 5238 ax-pow 5296 ax-pr 5360 ax-un 7621 ax-cnex 10987 ax-resscn 10988 ax-1cn 10989 ax-icn 10990 ax-addcl 10991 ax-addrcl 10992 ax-mulcl 10993 ax-mulrcl 10994 ax-mulcom 10995 ax-addass 10996 ax-mulass 10997 ax-distr 10998 ax-i2m1 10999 ax-1ne0 11000 ax-1rid 11001 ax-rnegex 11002 ax-rrecex 11003 ax-cnre 11004 ax-pre-lttri 11005 ax-pre-lttrn 11006 ax-pre-ltadd 11007 ax-pre-mulgt0 11008 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1541 df-fal 1551 df-ex 1779 df-nf 1783 df-sb 2065 df-mo 2537 df-eu 2566 df-clab 2713 df-cleq 2727 df-clel 2813 df-nfc 2885 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rmo 3339 df-reu 3340 df-rab 3357 df-v 3438 df-sbc 3721 df-csb 3837 df-dif 3894 df-un 3896 df-in 3898 df-ss 3908 df-pss 3910 df-nul 4262 df-if 4465 df-pw 4540 df-sn 4565 df-pr 4567 df-op 4571 df-uni 4844 df-int 4886 df-iun 4932 df-br 5081 df-opab 5143 df-mpt 5164 df-tr 5198 df-id 5500 df-eprel 5506 df-po 5514 df-so 5515 df-fr 5555 df-we 5557 df-xp 5606 df-rel 5607 df-cnv 5608 df-co 5609 df-dm 5610 df-rn 5611 df-res 5612 df-ima 5613 df-pred 6217 df-ord 6284 df-on 6285 df-lim 6286 df-suc 6287 df-iota 6410 df-fun 6460 df-fn 6461 df-f 6462 df-f1 6463 df-fo 6464 df-f1o 6465 df-fv 6466 df-riota 7265 df-ov 7311 df-oprab 7312 df-mpo 7313 df-om 7749 df-1st 7867 df-2nd 7868 df-frecs 8132 df-wrecs 8163 df-recs 8237 df-rdg 8276 df-er 8534 df-en 8770 df-dom 8771 df-sdom 8772 df-pnf 11071 df-mnf 11072 df-xr 11073 df-ltxr 11074 df-le 11075 df-sub 11267 df-neg 11268 df-nn 12034 df-2 12096 df-sets 16924 df-slot 16942 df-ndx 16954 df-base 16972 df-ress 17001 df-plusg 17034 df-0g 17211 df-mgm 18385 df-sgrp 18434 df-mnd 18445 df-submnd 18490 df-grp 18639 df-minusg 18640 df-sbg 18641 df-subg 18811 df-cntz 18982 df-lsm 19300 df-cmn 19447 df-abl 19448 df-mgp 19780 df-ur 19797 df-ring 19844 df-lmod 20188 df-lss 20257 df-lsp 20297 |
This theorem is referenced by: lsmsp2 20412 lsmpr 20414 lsppr 20418 lsmidllsp 31683 islshpsm 37204 lshpnel2N 37209 lkrlsp3 37328 djhlsmcl 39638 dochsatshp 39675 |
Copyright terms: Public domain | W3C validator |