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 42171

Description: Lemma for mapdpg 42198. 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 2739	. . . 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 42084	. . . 4 ⊢ (𝜑 → 𝐶 ∈ LMod)
8		mapdpglem.m	. . . . 5 ⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
9		mapdpglem.u	. . . . 5 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
10		eqid 2739	. . . . 5 ⊢ (LSubSp‘𝑈) = (LSubSp‘𝑈)
11	4, 9, 6	dvhlmod 41602	. . . . . 6 ⊢ (𝜑 → 𝑈 ∈ LMod)
12		mapdpglem.y	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
13		mapdpglem.v	. . . . . . 7 ⊢ 𝑉 = (Base‘𝑈)
14		mapdpglem.n	. . . . . . 7 ⊢ 𝑁 = (LSpan‘𝑈)
15	13, 10, 14	lspsncl 20967	. . . . . 6 ⊢ ((𝑈 ∈ LMod ∧ 𝑌 ∈ 𝑉) → (𝑁‘{𝑌}) ∈ (LSubSp‘𝑈))
16	11, 12, 15	syl2anc 590	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑌}) ∈ (LSubSp‘𝑈))
17	4, 8, 9, 10, 5, 2, 6, 16	mapdcl2 42148	. . . 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 42170	. . . 4 ⊢ (𝜑 → 𝑡 ∈ (𝑀‘(𝑁‘{𝑌})))
38	2, 3, 7, 17, 37	ellspsn5 20986	. . 3 ⊢ (𝜑 → (𝐽‘{𝑡}) ⊆ (𝑀‘(𝑁‘{𝑌})))
39	1, 38	eqsstrd 3949	. 2 ⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) ⊆ (𝑀‘(𝑁‘{𝑌})))
40	13, 18	lmodvsubcl 20897	. . . . 5 ⊢ ((𝑈 ∈ LMod ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝑋 − 𝑌) ∈ 𝑉)
41	11, 19, 12, 40	syl3anc 1379	. . . 4 ⊢ (𝜑 → (𝑋 − 𝑌) ∈ 𝑉)
42	13, 10, 14	lspsncl 20967	. . . 4 ⊢ ((𝑈 ∈ LMod ∧ (𝑋 − 𝑌) ∈ 𝑉) → (𝑁‘{(𝑋 − 𝑌)}) ∈ (LSubSp‘𝑈))
43	11, 41, 42	syl2anc 590	. . 3 ⊢ (𝜑 → (𝑁‘{(𝑋 − 𝑌)}) ∈ (LSubSp‘𝑈))
44	4, 9, 10, 8, 6, 43, 16	mapdord 42130	. 2 ⊢ (𝜑 → ((𝑀‘(𝑁‘{(𝑋 − 𝑌)})) ⊆ (𝑀‘(𝑁‘{𝑌})) ↔ (𝑁‘{(𝑋 − 𝑌)}) ⊆ (𝑁‘{𝑌})))
45	39, 44	mpbid 233	1 ⊢ (𝜑 → (𝑁‘{(𝑋 − 𝑌)}) ⊆ (𝑁‘{𝑌}))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ≠ wne 2934 ⊆ wss 3883 {csn 4555 ‘cfv 6485 (class class class)co 7356 Basecbs 17170 Scalarcsca 17214 ·_𝑠 cvsca 17215 0_gc0g 17393 -_gcsg 18902 LSSumclsm 19600 LModclmod 20850 LSubSpclss 20921 LSpanclspn 20961 HLchlt 39842 LHypclh 40476 DVecHcdvh 41570 LCDualclcd 42078 mapdcmpd 42116

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 ax-riotaBAD 39445

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-tp 4560 df-op 4562 df-uni 4839 df-int 4878 df-iun 4923 df-iin 4924 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-of 7620 df-om 7807 df-1st 7931 df-2nd 7932 df-tpos 8166 df-undef 8213 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-2o 8396 df-er 8633 df-map 8765 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-2 12235 df-3 12236 df-4 12237 df-5 12238 df-6 12239 df-n0 12429 df-z 12516 df-uz 12780 df-fz 13453 df-struct 17108 df-sets 17125 df-slot 17143 df-ndx 17155 df-base 17171 df-ress 17192 df-plusg 17224 df-mulr 17225 df-sca 17227 df-vsca 17228 df-0g 17395 df-mre 17539 df-mrc 17540 df-acs 17542 df-proset 18251 df-poset 18270 df-plt 18285 df-lub 18301 df-glb 18302 df-join 18303 df-meet 18304 df-p0 18380 df-p1 18381 df-lat 18389 df-clat 18456 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-submnd 18743 df-grp 18903 df-minusg 18904 df-sbg 18905 df-subg 19090 df-cntz 19283 df-oppg 19312 df-lsm 19602 df-cmn 19748 df-abl 19749 df-mgp 20113 df-rng 20125 df-ur 20154 df-ring 20207 df-oppr 20308 df-dvdsr 20328 df-unit 20329 df-invr 20359 df-dvr 20372 df-nzr 20485 df-rlreg 20666 df-domn 20667 df-drng 20703 df-lmod 20852 df-lss 20922 df-lsp 20962 df-lvec 21093 df-lsatoms 39468 df-lshyp 39469 df-lcv 39511 df-lfl 39550 df-lkr 39578 df-ldual 39616 df-oposet 39668 df-ol 39670 df-oml 39671 df-covers 39758 df-ats 39759 df-atl 39790 df-cvlat 39814 df-hlat 39843 df-llines 39990 df-lplanes 39991 df-lvols 39992 df-lines 39993 df-psubsp 39995 df-pmap 39996 df-padd 40288 df-lhyp 40480 df-laut 40481 df-ldil 40596 df-ltrn 40597 df-trl 40651 df-tgrp 41235 df-tendo 41247 df-edring 41249 df-dveca 41495 df-disoa 41521 df-dvech 41571 df-dib 41631 df-dic 41665 df-dih 41721 df-doch 41840 df-djh 41887 df-lcdual 42079 df-mapd 42117

This theorem is referenced by: mapdpglem9 42172

W3C validator