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 41673

Description: Lemma for mapdpg 41700. 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 2729	. . . 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 41586	. . . 4 ⊢ (𝜑 → 𝐶 ∈ LMod)
8		mapdpglem.m	. . . . 5 ⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
9		mapdpglem.u	. . . . 5 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
10		eqid 2729	. . . . 5 ⊢ (LSubSp‘𝑈) = (LSubSp‘𝑈)
11	4, 9, 6	dvhlmod 41104	. . . . . 6 ⊢ (𝜑 → 𝑈 ∈ LMod)
12		mapdpglem.y	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
13		mapdpglem.v	. . . . . . 7 ⊢ 𝑉 = (Base‘𝑈)
14		mapdpglem.n	. . . . . . 7 ⊢ 𝑁 = (LSpan‘𝑈)
15	13, 10, 14	lspsncl 20883	. . . . . 6 ⊢ ((𝑈 ∈ LMod ∧ 𝑌 ∈ 𝑉) → (𝑁‘{𝑌}) ∈ (LSubSp‘𝑈))
16	11, 12, 15	syl2anc 584	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑌}) ∈ (LSubSp‘𝑈))
17	4, 8, 9, 10, 5, 2, 6, 16	mapdcl2 41650	. . . 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 41672	. . . 4 ⊢ (𝜑 → 𝑡 ∈ (𝑀‘(𝑁‘{𝑌})))
38	2, 3, 7, 17, 37	ellspsn5 20902	. . 3 ⊢ (𝜑 → (𝐽‘{𝑡}) ⊆ (𝑀‘(𝑁‘{𝑌})))
39	1, 38	eqsstrd 3981	. 2 ⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) ⊆ (𝑀‘(𝑁‘{𝑌})))
40	13, 18	lmodvsubcl 20813	. . . . 5 ⊢ ((𝑈 ∈ LMod ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝑋 − 𝑌) ∈ 𝑉)
41	11, 19, 12, 40	syl3anc 1373	. . . 4 ⊢ (𝜑 → (𝑋 − 𝑌) ∈ 𝑉)
42	13, 10, 14	lspsncl 20883	. . . 4 ⊢ ((𝑈 ∈ LMod ∧ (𝑋 − 𝑌) ∈ 𝑉) → (𝑁‘{(𝑋 − 𝑌)}) ∈ (LSubSp‘𝑈))
43	11, 41, 42	syl2anc 584	. . 3 ⊢ (𝜑 → (𝑁‘{(𝑋 − 𝑌)}) ∈ (LSubSp‘𝑈))
44	4, 9, 10, 8, 6, 43, 16	mapdord 41632	. 2 ⊢ (𝜑 → ((𝑀‘(𝑁‘{(𝑋 − 𝑌)})) ⊆ (𝑀‘(𝑁‘{𝑌})) ↔ (𝑁‘{(𝑋 − 𝑌)}) ⊆ (𝑁‘{𝑌})))
45	39, 44	mpbid 232	1 ⊢ (𝜑 → (𝑁‘{(𝑋 − 𝑌)}) ⊆ (𝑁‘{𝑌}))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ⊆ wss 3914 {csn 4589 ‘cfv 6511 (class class class)co 7387 Basecbs 17179 Scalarcsca 17223 ·_𝑠 cvsca 17224 0_gc0g 17402 -_gcsg 18867 LSSumclsm 19564 LModclmod 20766 LSubSpclss 20837 LSpanclspn 20877 HLchlt 39343 LHypclh 39978 DVecHcdvh 41072 LCDualclcd 41580 mapdcmpd 41618

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 2701 ax-rep 5234 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 ax-riotaBAD 38946

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 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-uni 4872 df-int 4911 df-iun 4957 df-iin 4958 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-of 7653 df-om 7843 df-1st 7968 df-2nd 7969 df-tpos 8205 df-undef 8252 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-1o 8434 df-2o 8435 df-er 8671 df-map 8801 df-en 8919 df-dom 8920 df-sdom 8921 df-fin 8922 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-nn 12187 df-2 12249 df-3 12250 df-4 12251 df-5 12252 df-6 12253 df-n0 12443 df-z 12530 df-uz 12794 df-fz 13469 df-struct 17117 df-sets 17134 df-slot 17152 df-ndx 17164 df-base 17180 df-ress 17201 df-plusg 17233 df-mulr 17234 df-sca 17236 df-vsca 17237 df-0g 17404 df-mre 17547 df-mrc 17548 df-acs 17550 df-proset 18255 df-poset 18274 df-plt 18289 df-lub 18305 df-glb 18306 df-join 18307 df-meet 18308 df-p0 18384 df-p1 18385 df-lat 18391 df-clat 18458 df-mgm 18567 df-sgrp 18646 df-mnd 18662 df-submnd 18711 df-grp 18868 df-minusg 18869 df-sbg 18870 df-subg 19055 df-cntz 19249 df-oppg 19278 df-lsm 19566 df-cmn 19712 df-abl 19713 df-mgp 20050 df-rng 20062 df-ur 20091 df-ring 20144 df-oppr 20246 df-dvdsr 20266 df-unit 20267 df-invr 20297 df-dvr 20310 df-nzr 20422 df-rlreg 20603 df-domn 20604 df-drng 20640 df-lmod 20768 df-lss 20838 df-lsp 20878 df-lvec 21010 df-lsatoms 38969 df-lshyp 38970 df-lcv 39012 df-lfl 39051 df-lkr 39079 df-ldual 39117 df-oposet 39169 df-ol 39171 df-oml 39172 df-covers 39259 df-ats 39260 df-atl 39291 df-cvlat 39315 df-hlat 39344 df-llines 39492 df-lplanes 39493 df-lvols 39494 df-lines 39495 df-psubsp 39497 df-pmap 39498 df-padd 39790 df-lhyp 39982 df-laut 39983 df-ldil 40098 df-ltrn 40099 df-trl 40153 df-tgrp 40737 df-tendo 40749 df-edring 40751 df-dveca 40997 df-disoa 41023 df-dvech 41073 df-dib 41133 df-dic 41167 df-dih 41223 df-doch 41342 df-djh 41389 df-lcdual 41581 df-mapd 41619

This theorem is referenced by: mapdpglem9 41674

W3C validator