mapdpglem8 - Mathbox for Norm Megill

	Mathbox for Norm Megill		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > mapdpglem8		Structured version Visualization version GIF version

Theorem mapdpglem8 39620

Description: Lemma for mapdpg 39647. Baer p. 45, line 4: "...so that (F(x-y))* <= (Fy)*. This would imply that F(x-y) <= F(y)..." (Contributed by NM, 20-Mar-2015.)

**Hypotheses**
Ref	Expression
mapdpglem.h	⊢ 𝐻 = (LHyp‘𝐾)
mapdpglem.m	⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
mapdpglem.u	⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
mapdpglem.v	⊢ 𝑉 = (Base‘𝑈)
mapdpglem.s	⊢ − = (-_g‘𝑈)
mapdpglem.n	⊢ 𝑁 = (LSpan‘𝑈)
mapdpglem.c	⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊)
mapdpglem.k	⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
mapdpglem.x	⊢ (𝜑 → 𝑋 ∈ 𝑉)
mapdpglem.y	⊢ (𝜑 → 𝑌 ∈ 𝑉)
mapdpglem1.p	⊢ ⊕ = (LSSum‘𝐶)
mapdpglem2.j	⊢ 𝐽 = (LSpan‘𝐶)
mapdpglem3.f	⊢ 𝐹 = (Base‘𝐶)
mapdpglem3.te	⊢ (𝜑 → 𝑡 ∈ ((𝑀‘(𝑁‘{𝑋})) ⊕ (𝑀‘(𝑁‘{𝑌}))))
mapdpglem3.a	⊢ 𝐴 = (Scalar‘𝑈)
mapdpglem3.b	⊢ 𝐵 = (Base‘𝐴)
mapdpglem3.t	⊢ · = ( ·_𝑠 ‘𝐶)
mapdpglem3.r	⊢ 𝑅 = (-_g‘𝐶)
mapdpglem3.g	⊢ (𝜑 → 𝐺 ∈ 𝐹)
mapdpglem3.e	⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐺}))
mapdpglem4.q	⊢ 𝑄 = (0_g‘𝑈)
mapdpglem.ne	⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))
mapdpglem4.jt	⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{𝑡}))
mapdpglem4.z	⊢ 0 = (0_g‘𝐴)
mapdpglem4.g4	⊢ (𝜑 → 𝑔 ∈ 𝐵)
mapdpglem4.z4	⊢ (𝜑 → 𝑧 ∈ (𝑀‘(𝑁‘{𝑌})))
mapdpglem4.t4	⊢ (𝜑 → 𝑡 = ((𝑔 · 𝐺)𝑅𝑧))
mapdpglem4.xn	⊢ (𝜑 → 𝑋 ≠ 𝑄)
mapdpglem4.g0	⊢ (𝜑 → 𝑔 = 0 )

**Assertion**
Ref	Expression
mapdpglem8	⊢ (𝜑 → (𝑁‘{(𝑋 − 𝑌)}) ⊆ (𝑁‘{𝑌}))

Distinct variable groups: 𝑡, − 𝑡,𝐶 𝑡,𝐽 𝑡,𝑀 𝑡,𝑁 𝑡,𝑋 𝑡,𝑌 𝐵,𝑔 𝑧,𝑔,𝐶 𝑔,𝐹 𝑔,𝐺,𝑧 𝑔,𝐽,𝑧 𝑔,𝑀,𝑧 𝑔,𝑁,𝑧 𝑅,𝑔,𝑧 · ,𝑔,𝑧 𝑔,𝑌,𝑧,𝑡 Allowed substitution hints: 𝜑(𝑧,𝑡,𝑔) 𝐴(𝑧,𝑡,𝑔) 𝐵(𝑧,𝑡) ⊕ (𝑧,𝑡,𝑔) 𝑄(𝑧,𝑡,𝑔) 𝑅(𝑡) · (𝑡) 𝑈(𝑧,𝑡,𝑔) 𝐹(𝑧,𝑡) 𝐺(𝑡) 𝐻(𝑧,𝑡,𝑔) 𝐾(𝑧,𝑡,𝑔) − (𝑧,𝑔) 𝑉(𝑧,𝑡,𝑔) 𝑊(𝑧,𝑡,𝑔) 𝑋(𝑧,𝑔) 0 (𝑧,𝑡,𝑔)

**Proof of Theorem mapdpglem8**
Step	Hyp	Ref	Expression
1		mapdpglem4.jt	. . 3 ⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{𝑡}))
2		eqid 2738	. . . 4 ⊢ (LSubSp‘𝐶) = (LSubSp‘𝐶)
3		mapdpglem2.j	. . . 4 ⊢ 𝐽 = (LSpan‘𝐶)
4		mapdpglem.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
5		mapdpglem.c	. . . . 5 ⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊)
6		mapdpglem.k	. . . . 5 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
7	4, 5, 6	lcdlmod 39533	. . . 4 ⊢ (𝜑 → 𝐶 ∈ LMod)
8		mapdpglem.m	. . . . 5 ⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
9		mapdpglem.u	. . . . 5 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
10		eqid 2738	. . . . 5 ⊢ (LSubSp‘𝑈) = (LSubSp‘𝑈)
11	4, 9, 6	dvhlmod 39051	. . . . . 6 ⊢ (𝜑 → 𝑈 ∈ LMod)
12		mapdpglem.y	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
13		mapdpglem.v	. . . . . . 7 ⊢ 𝑉 = (Base‘𝑈)
14		mapdpglem.n	. . . . . . 7 ⊢ 𝑁 = (LSpan‘𝑈)
15	13, 10, 14	lspsncl 20154	. . . . . 6 ⊢ ((𝑈 ∈ LMod ∧ 𝑌 ∈ 𝑉) → (𝑁‘{𝑌}) ∈ (LSubSp‘𝑈))
16	11, 12, 15	syl2anc 583	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑌}) ∈ (LSubSp‘𝑈))
17	4, 8, 9, 10, 5, 2, 6, 16	mapdcl2 39597	. . . 4 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑌})) ∈ (LSubSp‘𝐶))
18		mapdpglem.s	. . . . 5 ⊢ − = (-_g‘𝑈)
19		mapdpglem.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
20		mapdpglem1.p	. . . . 5 ⊢ ⊕ = (LSSum‘𝐶)
21		mapdpglem3.f	. . . . 5 ⊢ 𝐹 = (Base‘𝐶)
22		mapdpglem3.te	. . . . 5 ⊢ (𝜑 → 𝑡 ∈ ((𝑀‘(𝑁‘{𝑋})) ⊕ (𝑀‘(𝑁‘{𝑌}))))
23		mapdpglem3.a	. . . . 5 ⊢ 𝐴 = (Scalar‘𝑈)
24		mapdpglem3.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐴)
25		mapdpglem3.t	. . . . 5 ⊢ · = ( ·_𝑠 ‘𝐶)
26		mapdpglem3.r	. . . . 5 ⊢ 𝑅 = (-_g‘𝐶)
27		mapdpglem3.g	. . . . 5 ⊢ (𝜑 → 𝐺 ∈ 𝐹)
28		mapdpglem3.e	. . . . 5 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐺}))
29		mapdpglem4.q	. . . . 5 ⊢ 𝑄 = (0_g‘𝑈)
30		mapdpglem.ne	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))
31		mapdpglem4.z	. . . . 5 ⊢ 0 = (0_g‘𝐴)
32		mapdpglem4.g4	. . . . 5 ⊢ (𝜑 → 𝑔 ∈ 𝐵)
33		mapdpglem4.z4	. . . . 5 ⊢ (𝜑 → 𝑧 ∈ (𝑀‘(𝑁‘{𝑌})))
34		mapdpglem4.t4	. . . . 5 ⊢ (𝜑 → 𝑡 = ((𝑔 · 𝐺)𝑅𝑧))
35		mapdpglem4.xn	. . . . 5 ⊢ (𝜑 → 𝑋 ≠ 𝑄)
36		mapdpglem4.g0	. . . . 5 ⊢ (𝜑 → 𝑔 = 0 )
37	4, 8, 9, 13, 18, 14, 5, 6, 19, 12, 20, 3, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 1, 31, 32, 33, 34, 35, 36	mapdpglem6 39619	. . . 4 ⊢ (𝜑 → 𝑡 ∈ (𝑀‘(𝑁‘{𝑌})))
38	2, 3, 7, 17, 37	lspsnel5a 20173	. . 3 ⊢ (𝜑 → (𝐽‘{𝑡}) ⊆ (𝑀‘(𝑁‘{𝑌})))
39	1, 38	eqsstrd 3955	. 2 ⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) ⊆ (𝑀‘(𝑁‘{𝑌})))
40	13, 18	lmodvsubcl 20083	. . . . 5 ⊢ ((𝑈 ∈ LMod ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝑋 − 𝑌) ∈ 𝑉)
41	11, 19, 12, 40	syl3anc 1369	. . . 4 ⊢ (𝜑 → (𝑋 − 𝑌) ∈ 𝑉)
42	13, 10, 14	lspsncl 20154	. . . 4 ⊢ ((𝑈 ∈ LMod ∧ (𝑋 − 𝑌) ∈ 𝑉) → (𝑁‘{(𝑋 − 𝑌)}) ∈ (LSubSp‘𝑈))
43	11, 41, 42	syl2anc 583	. . 3 ⊢ (𝜑 → (𝑁‘{(𝑋 − 𝑌)}) ∈ (LSubSp‘𝑈))
44	4, 9, 10, 8, 6, 43, 16	mapdord 39579	. 2 ⊢ (𝜑 → ((𝑀‘(𝑁‘{(𝑋 − 𝑌)})) ⊆ (𝑀‘(𝑁‘{𝑌})) ↔ (𝑁‘{(𝑋 − 𝑌)}) ⊆ (𝑁‘{𝑌})))
45	39, 44	mpbid 231	1 ⊢ (𝜑 → (𝑁‘{(𝑋 − 𝑌)}) ⊆ (𝑁‘{𝑌}))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ≠ wne 2942 ⊆ wss 3883 {csn 4558 ‘cfv 6418 (class class class)co 7255 Basecbs 16840 Scalarcsca 16891 ·_𝑠 cvsca 16892 0_gc0g 17067 -_gcsg 18494 LSSumclsm 19154 LModclmod 20038 LSubSpclss 20108 LSpanclspn 20148 HLchlt 37291 LHypclh 37925 DVecHcdvh 39019 LCDualclcd 39527 mapdcmpd 39565

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 ax-riotaBAD 36894

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-iin 4924 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-of 7511 df-om 7688 df-1st 7804 df-2nd 7805 df-tpos 8013 df-undef 8060 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-er 8456 df-map 8575 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 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-4 11968 df-5 11969 df-6 11970 df-n0 12164 df-z 12250 df-uz 12512 df-fz 13169 df-struct 16776 df-sets 16793 df-slot 16811 df-ndx 16823 df-base 16841 df-ress 16868 df-plusg 16901 df-mulr 16902 df-sca 16904 df-vsca 16905 df-0g 17069 df-mre 17212 df-mrc 17213 df-acs 17215 df-proset 17928 df-poset 17946 df-plt 17963 df-lub 17979 df-glb 17980 df-join 17981 df-meet 17982 df-p0 18058 df-p1 18059 df-lat 18065 df-clat 18132 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-oppg 18865 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-dvr 19840 df-drng 19908 df-lmod 20040 df-lss 20109 df-lsp 20149 df-lvec 20280 df-lsatoms 36917 df-lshyp 36918 df-lcv 36960 df-lfl 36999 df-lkr 37027 df-ldual 37065 df-oposet 37117 df-ol 37119 df-oml 37120 df-covers 37207 df-ats 37208 df-atl 37239 df-cvlat 37263 df-hlat 37292 df-llines 37439 df-lplanes 37440 df-lvols 37441 df-lines 37442 df-psubsp 37444 df-pmap 37445 df-padd 37737 df-lhyp 37929 df-laut 37930 df-ldil 38045 df-ltrn 38046 df-trl 38100 df-tgrp 38684 df-tendo 38696 df-edring 38698 df-dveca 38944 df-disoa 38970 df-dvech 39020 df-dib 39080 df-dic 39114 df-dih 39170 df-doch 39289 df-djh 39336 df-lcdual 39528 df-mapd 39566

This theorem is referenced by: mapdpglem9 39621

W3C validator