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 21037

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 21020	. . . . . . 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 20893	. . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{𝑋}) ∈ (SubGrp‘𝑊))
8	3, 4, 7	syl2anc 584	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑋}) ∈ (SubGrp‘𝑊))
9		lspabs2.y	. . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 }))
10	9	eldifad 3929	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
11	5, 6	lspsnsubg 20893	. . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑌 ∈ 𝑉) → (𝑁‘{𝑌}) ∈ (SubGrp‘𝑊))
12	3, 10, 11	syl2anc 584	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑌}) ∈ (SubGrp‘𝑊))
13		eqid 2730	. . . . . 6 ⊢ (LSSum‘𝑊) = (LSSum‘𝑊)
14	13	lsmub2 19595	. . . . 5 ⊢ (((𝑁‘{𝑋}) ∈ (SubGrp‘𝑊) ∧ (𝑁‘{𝑌}) ∈ (SubGrp‘𝑊)) → (𝑁‘{𝑌}) ⊆ ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑌})))
15	8, 12, 14	syl2anc 584	. . . 4 ⊢ (𝜑 → (𝑁‘{𝑌}) ⊆ ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑌})))
16		lspabs2.e	. . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑋}) = (𝑁‘{(𝑋 + 𝑌)}))
17	16	oveq2d 7406	. . . . 5 ⊢ (𝜑 → ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑋})) = ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{(𝑋 + 𝑌)})))
18	13	lsmidm 19600	. . . . . 6 ⊢ ((𝑁‘{𝑋}) ∈ (SubGrp‘𝑊) → ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑋})) = (𝑁‘{𝑋}))
19	8, 18	syl 17	. . . . 5 ⊢ (𝜑 → ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑋})) = (𝑁‘{𝑋}))
20		lspabs2.p	. . . . . . 7 ⊢ + = (+_g‘𝑊)
21	5, 20, 6, 3, 4, 10	lspprabs 21009	. . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑋, (𝑋 + 𝑌)}) = (𝑁‘{𝑋, 𝑌}))
22	5, 20	lmodvacl 20788	. . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝑋 + 𝑌) ∈ 𝑉)
23	3, 4, 10, 22	syl3anc 1373	. . . . . . 7 ⊢ (𝜑 → (𝑋 + 𝑌) ∈ 𝑉)
24	5, 6, 13, 3, 4, 23	lsmpr 21003	. . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑋, (𝑋 + 𝑌)}) = ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{(𝑋 + 𝑌)})))
25	5, 6, 13, 3, 4, 10	lsmpr 21003	. . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑋, 𝑌}) = ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑌})))
26	21, 24, 25	3eqtr3d 2773	. . . . 5 ⊢ (𝜑 → ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{(𝑋 + 𝑌)})) = ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑌})))
27	17, 19, 26	3eqtr3rd 2774	. . . 4 ⊢ (𝜑 → ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑌})) = (𝑁‘{𝑋}))
28	15, 27	sseqtrd 3986	. . 3 ⊢ (𝜑 → (𝑁‘{𝑌}) ⊆ (𝑁‘{𝑋}))
29		lspabs2.o	. . . 4 ⊢ 0 = (0_g‘𝑊)
30	5, 29, 6, 1, 9, 4	lspsncmp 21033	. . 3 ⊢ (𝜑 → ((𝑁‘{𝑌}) ⊆ (𝑁‘{𝑋}) ↔ (𝑁‘{𝑌}) = (𝑁‘{𝑋})))
31	28, 30	mpbid 232	. 2 ⊢ (𝜑 → (𝑁‘{𝑌}) = (𝑁‘{𝑋}))
32	31	eqcomd 2736	1 ⊢ (𝜑 → (𝑁‘{𝑋}) = (𝑁‘{𝑌}))

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 ∖ cdif 3914 ⊆ wss 3917 {csn 4592 {cpr 4594 ‘cfv 6514 (class class class)co 7390 Basecbs 17186 +_gcplusg 17227 0_gc0g 17409 SubGrpcsubg 19059 LSSumclsm 19571 LModclmod 20773 LSpanclspn 20884 LVecclvec 21016

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 2702 ax-rep 5237 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152

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 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-int 4914 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7846 df-1st 7971 df-2nd 7972 df-tpos 8208 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-er 8674 df-en 8922 df-dom 8923 df-sdom 8924 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-nn 12194 df-2 12256 df-3 12257 df-sets 17141 df-slot 17159 df-ndx 17171 df-base 17187 df-ress 17208 df-plusg 17240 df-mulr 17241 df-0g 17411 df-mgm 18574 df-sgrp 18653 df-mnd 18669 df-submnd 18718 df-grp 18875 df-minusg 18876 df-sbg 18877 df-subg 19062 df-cntz 19256 df-lsm 19573 df-cmn 19719 df-abl 19720 df-mgp 20057 df-rng 20069 df-ur 20098 df-ring 20151 df-oppr 20253 df-dvdsr 20273 df-unit 20274 df-invr 20304 df-drng 20647 df-lmod 20775 df-lss 20845 df-lsp 20885 df-lvec 21017

This theorem is referenced by: lspindp3 21053

W3C validator