lspabs2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > lspabs2		Structured version Visualization version GIF version

Theorem lspabs2 20297

Description: Absorption law for span of vector sum. (Contributed by NM, 30-Apr-2015.)

**Hypotheses**
Ref	Expression
lspabs2.v	⊢ 𝑉 = (Base‘𝑊)
lspabs2.p	⊢ + = (+_g‘𝑊)
lspabs2.o	⊢ 0 = (0_g‘𝑊)
lspabs2.n	⊢ 𝑁 = (LSpan‘𝑊)
lspabs2.w	⊢ (𝜑 → 𝑊 ∈ LVec)
lspabs2.x	⊢ (𝜑 → 𝑋 ∈ 𝑉)
lspabs2.y	⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 }))
lspabs2.e	⊢ (𝜑 → (𝑁‘{𝑋}) = (𝑁‘{(𝑋 + 𝑌)}))

**Assertion**
Ref	Expression
lspabs2	⊢ (𝜑 → (𝑁‘{𝑋}) = (𝑁‘{𝑌}))

**Proof of Theorem lspabs2**
Step	Hyp	Ref	Expression
1		lspabs2.w	. . . . . . 7 ⊢ (𝜑 → 𝑊 ∈ LVec)
2		lveclmod 20283	. . . . . . 7 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod)
3	1, 2	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑊 ∈ LMod)
4		lspabs2.x	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
5		lspabs2.v	. . . . . . 7 ⊢ 𝑉 = (Base‘𝑊)
6		lspabs2.n	. . . . . . 7 ⊢ 𝑁 = (LSpan‘𝑊)
7	5, 6	lspsnsubg 20157	. . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{𝑋}) ∈ (SubGrp‘𝑊))
8	3, 4, 7	syl2anc 583	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑋}) ∈ (SubGrp‘𝑊))
9		lspabs2.y	. . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 }))
10	9	eldifad 3895	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
11	5, 6	lspsnsubg 20157	. . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑌 ∈ 𝑉) → (𝑁‘{𝑌}) ∈ (SubGrp‘𝑊))
12	3, 10, 11	syl2anc 583	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑌}) ∈ (SubGrp‘𝑊))
13		eqid 2738	. . . . . 6 ⊢ (LSSum‘𝑊) = (LSSum‘𝑊)
14	13	lsmub2 19178	. . . . 5 ⊢ (((𝑁‘{𝑋}) ∈ (SubGrp‘𝑊) ∧ (𝑁‘{𝑌}) ∈ (SubGrp‘𝑊)) → (𝑁‘{𝑌}) ⊆ ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑌})))
15	8, 12, 14	syl2anc 583	. . . 4 ⊢ (𝜑 → (𝑁‘{𝑌}) ⊆ ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑌})))
16		lspabs2.e	. . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑋}) = (𝑁‘{(𝑋 + 𝑌)}))
17	16	oveq2d 7271	. . . . 5 ⊢ (𝜑 → ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑋})) = ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{(𝑋 + 𝑌)})))
18	13	lsmidm 19183	. . . . . 6 ⊢ ((𝑁‘{𝑋}) ∈ (SubGrp‘𝑊) → ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑋})) = (𝑁‘{𝑋}))
19	8, 18	syl 17	. . . . 5 ⊢ (𝜑 → ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑋})) = (𝑁‘{𝑋}))
20		lspabs2.p	. . . . . . 7 ⊢ + = (+_g‘𝑊)
21	5, 20, 6, 3, 4, 10	lspprabs 20272	. . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑋, (𝑋 + 𝑌)}) = (𝑁‘{𝑋, 𝑌}))
22	5, 20	lmodvacl 20052	. . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝑋 + 𝑌) ∈ 𝑉)
23	3, 4, 10, 22	syl3anc 1369	. . . . . . 7 ⊢ (𝜑 → (𝑋 + 𝑌) ∈ 𝑉)
24	5, 6, 13, 3, 4, 23	lsmpr 20266	. . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑋, (𝑋 + 𝑌)}) = ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{(𝑋 + 𝑌)})))
25	5, 6, 13, 3, 4, 10	lsmpr 20266	. . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑋, 𝑌}) = ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑌})))
26	21, 24, 25	3eqtr3d 2786	. . . . 5 ⊢ (𝜑 → ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{(𝑋 + 𝑌)})) = ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑌})))
27	17, 19, 26	3eqtr3rd 2787	. . . 4 ⊢ (𝜑 → ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑌})) = (𝑁‘{𝑋}))
28	15, 27	sseqtrd 3957	. . 3 ⊢ (𝜑 → (𝑁‘{𝑌}) ⊆ (𝑁‘{𝑋}))
29		lspabs2.o	. . . 4 ⊢ 0 = (0_g‘𝑊)
30	5, 29, 6, 1, 9, 4	lspsncmp 20293	. . 3 ⊢ (𝜑 → ((𝑁‘{𝑌}) ⊆ (𝑁‘{𝑋}) ↔ (𝑁‘{𝑌}) = (𝑁‘{𝑋})))
31	28, 30	mpbid 231	. 2 ⊢ (𝜑 → (𝑁‘{𝑌}) = (𝑁‘{𝑋}))
32	31	eqcomd 2744	1 ⊢ (𝜑 → (𝑁‘{𝑋}) = (𝑁‘{𝑌}))

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2108 ∖ cdif 3880 ⊆ wss 3883 {csn 4558 {cpr 4560 ‘cfv 6418 (class class class)co 7255 Basecbs 16840 +_gcplusg 16888 0_gc0g 17067 SubGrpcsubg 18664 LSSumclsm 19154 LModclmod 20038 LSpanclspn 20148 LVecclvec 20279

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-tpos 8013 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-2 11966 df-3 11967 df-sets 16793 df-slot 16811 df-ndx 16823 df-base 16841 df-ress 16868 df-plusg 16901 df-mulr 16902 df-0g 17069 df-mgm 18241 df-sgrp 18290 df-mnd 18301 df-submnd 18346 df-grp 18495 df-minusg 18496 df-sbg 18497 df-subg 18667 df-cntz 18838 df-lsm 19156 df-cmn 19303 df-abl 19304 df-mgp 19636 df-ur 19653 df-ring 19700 df-oppr 19777 df-dvdsr 19798 df-unit 19799 df-invr 19829 df-drng 19908 df-lmod 20040 df-lss 20109 df-lsp 20149 df-lvec 20280

This theorem is referenced by: lspindp3 20313

W3C validator