mapdpglem3 - Mathbox for Norm Megill

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

Theorem mapdpglem3 41676

Description: Lemma for mapdpg 41707. Baer p. 45, line 3: "infer ... the existence of a number g in G and of an element z in (Fy)* such that t = gx'-z." (We scope $d 𝑔𝑤𝑧𝜑 locally to avoid clashes with later substitutions into 𝜑.) (Contributed by NM, 18-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	⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐺}))

**Assertion**
Ref	Expression
mapdpglem3	⊢ (𝜑 → ∃𝑔 ∈ 𝐵 ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = ((𝑔 · 𝐺)𝑅𝑧))

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

Proof of Theorem mapdpglem3 Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		mapdpglem3.te	. . . 4 ⊢ (𝜑 → 𝑡 ∈ ((𝑀‘(𝑁‘{𝑋})) ⊕ (𝑀‘(𝑁‘{𝑌}))))
2		mapdpglem3.e	. . . . 5 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐺}))
3	2	oveq1d 7405	. . . 4 ⊢ (𝜑 → ((𝑀‘(𝑁‘{𝑋})) ⊕ (𝑀‘(𝑁‘{𝑌}))) = ((𝐽‘{𝐺}) ⊕ (𝑀‘(𝑁‘{𝑌}))))
4	1, 3	eleqtrd 2831	. . 3 ⊢ (𝜑 → 𝑡 ∈ ((𝐽‘{𝐺}) ⊕ (𝑀‘(𝑁‘{𝑌}))))
5		r19.41v 3168	. . . . . . 7 ⊢ (∃𝑔 ∈ 𝐵 (𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)) ↔ (∃𝑔 ∈ 𝐵 𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)))
6		mapdpglem.h	. . . . . . . . . . 11 ⊢ 𝐻 = (LHyp‘𝐾)
7		mapdpglem.c	. . . . . . . . . . 11 ⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊)
8		mapdpglem.k	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
9	6, 7, 8	lcdlmod 41593	. . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ LMod)
10		mapdpglem3.g	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺 ∈ 𝐹)
11		eqid 2730	. . . . . . . . . . 11 ⊢ (Scalar‘𝐶) = (Scalar‘𝐶)
12		eqid 2730	. . . . . . . . . . 11 ⊢ (Base‘(Scalar‘𝐶)) = (Base‘(Scalar‘𝐶))
13		mapdpglem3.f	. . . . . . . . . . 11 ⊢ 𝐹 = (Base‘𝐶)
14		mapdpglem3.t	. . . . . . . . . . 11 ⊢ · = ( ·_𝑠 ‘𝐶)
15		mapdpglem2.j	. . . . . . . . . . 11 ⊢ 𝐽 = (LSpan‘𝐶)
16	11, 12, 13, 14, 15	ellspsn 20916	. . . . . . . . . 10 ⊢ ((𝐶 ∈ LMod ∧ 𝐺 ∈ 𝐹) → (𝑤 ∈ (𝐽‘{𝐺}) ↔ ∃𝑔 ∈ (Base‘(Scalar‘𝐶))𝑤 = (𝑔 · 𝐺)))
17	9, 10, 16	syl2anc 584	. . . . . . . . 9 ⊢ (𝜑 → (𝑤 ∈ (𝐽‘{𝐺}) ↔ ∃𝑔 ∈ (Base‘(Scalar‘𝐶))𝑤 = (𝑔 · 𝐺)))
18		mapdpglem.u	. . . . . . . . . . 11 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
19		mapdpglem3.a	. . . . . . . . . . 11 ⊢ 𝐴 = (Scalar‘𝑈)
20		mapdpglem3.b	. . . . . . . . . . 11 ⊢ 𝐵 = (Base‘𝐴)
21	6, 18, 19, 20, 7, 11, 12, 8	lcdsbase 41601	. . . . . . . . . 10 ⊢ (𝜑 → (Base‘(Scalar‘𝐶)) = 𝐵)
22	21	rexeqdv 3302	. . . . . . . . 9 ⊢ (𝜑 → (∃𝑔 ∈ (Base‘(Scalar‘𝐶))𝑤 = (𝑔 · 𝐺) ↔ ∃𝑔 ∈ 𝐵 𝑤 = (𝑔 · 𝐺)))
23	17, 22	bitrd 279	. . . . . . . 8 ⊢ (𝜑 → (𝑤 ∈ (𝐽‘{𝐺}) ↔ ∃𝑔 ∈ 𝐵 𝑤 = (𝑔 · 𝐺)))
24	23	anbi1d 631	. . . . . . 7 ⊢ (𝜑 → ((𝑤 ∈ (𝐽‘{𝐺}) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)) ↔ (∃𝑔 ∈ 𝐵 𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧))))
25	5, 24	bitr4id 290	. . . . . 6 ⊢ (𝜑 → (∃𝑔 ∈ 𝐵 (𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)) ↔ (𝑤 ∈ (𝐽‘{𝐺}) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧))))
26	25	exbidv 1921	. . . . 5 ⊢ (𝜑 → (∃𝑤∃𝑔 ∈ 𝐵 (𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)) ↔ ∃𝑤(𝑤 ∈ (𝐽‘{𝐺}) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧))))
27		df-rex 3055	. . . . 5 ⊢ (∃𝑤 ∈ (𝐽‘{𝐺})∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧) ↔ ∃𝑤(𝑤 ∈ (𝐽‘{𝐺}) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)))
28	26, 27	bitr4di 289	. . . 4 ⊢ (𝜑 → (∃𝑤∃𝑔 ∈ 𝐵 (𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)) ↔ ∃𝑤 ∈ (𝐽‘{𝐺})∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)))
29		mapdpglem3.r	. . . . 5 ⊢ 𝑅 = (-_g‘𝐶)
30		mapdpglem1.p	. . . . 5 ⊢ ⊕ = (LSSum‘𝐶)
31		eqid 2730	. . . . . . . 8 ⊢ (LSubSp‘𝐶) = (LSubSp‘𝐶)
32	31	lsssssubg 20871	. . . . . . 7 ⊢ (𝐶 ∈ LMod → (LSubSp‘𝐶) ⊆ (SubGrp‘𝐶))
33	9, 32	syl 17	. . . . . 6 ⊢ (𝜑 → (LSubSp‘𝐶) ⊆ (SubGrp‘𝐶))
34	13, 31, 15	lspsncl 20890	. . . . . . 7 ⊢ ((𝐶 ∈ LMod ∧ 𝐺 ∈ 𝐹) → (𝐽‘{𝐺}) ∈ (LSubSp‘𝐶))
35	9, 10, 34	syl2anc 584	. . . . . 6 ⊢ (𝜑 → (𝐽‘{𝐺}) ∈ (LSubSp‘𝐶))
36	33, 35	sseldd 3950	. . . . 5 ⊢ (𝜑 → (𝐽‘{𝐺}) ∈ (SubGrp‘𝐶))
37		mapdpglem.m	. . . . . . 7 ⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
38		eqid 2730	. . . . . . 7 ⊢ (LSubSp‘𝑈) = (LSubSp‘𝑈)
39	6, 18, 8	dvhlmod 41111	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ LMod)
40		mapdpglem.y	. . . . . . . 8 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
41		mapdpglem.v	. . . . . . . . 9 ⊢ 𝑉 = (Base‘𝑈)
42		mapdpglem.n	. . . . . . . . 9 ⊢ 𝑁 = (LSpan‘𝑈)
43	41, 38, 42	lspsncl 20890	. . . . . . . 8 ⊢ ((𝑈 ∈ LMod ∧ 𝑌 ∈ 𝑉) → (𝑁‘{𝑌}) ∈ (LSubSp‘𝑈))
44	39, 40, 43	syl2anc 584	. . . . . . 7 ⊢ (𝜑 → (𝑁‘{𝑌}) ∈ (LSubSp‘𝑈))
45	6, 37, 18, 38, 7, 31, 8, 44	mapdcl2 41657	. . . . . 6 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑌})) ∈ (LSubSp‘𝐶))
46	33, 45	sseldd 3950	. . . . 5 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑌})) ∈ (SubGrp‘𝐶))
47	29, 30, 36, 46	lsmelvalm 19588	. . . 4 ⊢ (𝜑 → (𝑡 ∈ ((𝐽‘{𝐺}) ⊕ (𝑀‘(𝑁‘{𝑌}))) ↔ ∃𝑤 ∈ (𝐽‘{𝐺})∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)))
48	28, 47	bitr4d 282	. . 3 ⊢ (𝜑 → (∃𝑤∃𝑔 ∈ 𝐵 (𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)) ↔ 𝑡 ∈ ((𝐽‘{𝐺}) ⊕ (𝑀‘(𝑁‘{𝑌})))))
49	4, 48	mpbird 257	. 2 ⊢ (𝜑 → ∃𝑤∃𝑔 ∈ 𝐵 (𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)))
50		ovex 7423	. . . . 5 ⊢ (𝑔 · 𝐺) ∈ V
51		oveq1 7397	. . . . . . 7 ⊢ (𝑤 = (𝑔 · 𝐺) → (𝑤𝑅𝑧) = ((𝑔 · 𝐺)𝑅𝑧))
52	51	eqeq2d 2741	. . . . . 6 ⊢ (𝑤 = (𝑔 · 𝐺) → (𝑡 = (𝑤𝑅𝑧) ↔ 𝑡 = ((𝑔 · 𝐺)𝑅𝑧)))
53	52	rexbidv 3158	. . . . 5 ⊢ (𝑤 = (𝑔 · 𝐺) → (∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧) ↔ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = ((𝑔 · 𝐺)𝑅𝑧)))
54	50, 53	ceqsexv 3501	. . . 4 ⊢ (∃𝑤(𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)) ↔ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = ((𝑔 · 𝐺)𝑅𝑧))
55	54	rexbii 3077	. . 3 ⊢ (∃𝑔 ∈ 𝐵 ∃𝑤(𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)) ↔ ∃𝑔 ∈ 𝐵 ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = ((𝑔 · 𝐺)𝑅𝑧))
56		rexcom4 3265	. . 3 ⊢ (∃𝑔 ∈ 𝐵 ∃𝑤(𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)) ↔ ∃𝑤∃𝑔 ∈ 𝐵 (𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)))
57	55, 56	bitr3i 277	. 2 ⊢ (∃𝑔 ∈ 𝐵 ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = ((𝑔 · 𝐺)𝑅𝑧) ↔ ∃𝑤∃𝑔 ∈ 𝐵 (𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)))
58	49, 57	sylibr 234	1 ⊢ (𝜑 → ∃𝑔 ∈ 𝐵 ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = ((𝑔 · 𝐺)𝑅𝑧))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∃wex 1779 ∈ wcel 2109 ∃wrex 3054 ⊆ wss 3917 {csn 4592 ‘cfv 6514 (class class class)co 7390 Basecbs 17186 Scalarcsca 17230 ·_𝑠 cvsca 17231 -_gcsg 18874 SubGrpcsubg 19059 LSSumclsm 19571 LModclmod 20773 LSubSpclss 20844 LSpanclspn 20884 HLchlt 39350 LHypclh 39985 DVecHcdvh 41079 LCDualclcd 41587 mapdcmpd 41625

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

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-tp 4597 df-op 4599 df-uni 4875 df-int 4914 df-iun 4960 df-iin 4961 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-of 7656 df-om 7846 df-1st 7971 df-2nd 7972 df-tpos 8208 df-undef 8255 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-1o 8437 df-2o 8438 df-er 8674 df-map 8804 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 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-4 12258 df-5 12259 df-6 12260 df-n0 12450 df-z 12537 df-uz 12801 df-fz 13476 df-struct 17124 df-sets 17141 df-slot 17159 df-ndx 17171 df-base 17187 df-ress 17208 df-plusg 17240 df-mulr 17241 df-sca 17243 df-vsca 17244 df-0g 17411 df-mre 17554 df-mrc 17555 df-acs 17557 df-proset 18262 df-poset 18281 df-plt 18296 df-lub 18312 df-glb 18313 df-join 18314 df-meet 18315 df-p0 18391 df-p1 18392 df-lat 18398 df-clat 18465 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-oppg 19285 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-dvr 20317 df-nzr 20429 df-rlreg 20610 df-domn 20611 df-drng 20647 df-lmod 20775 df-lss 20845 df-lsp 20885 df-lvec 21017 df-lsatoms 38976 df-lshyp 38977 df-lcv 39019 df-lfl 39058 df-lkr 39086 df-ldual 39124 df-oposet 39176 df-ol 39178 df-oml 39179 df-covers 39266 df-ats 39267 df-atl 39298 df-cvlat 39322 df-hlat 39351 df-llines 39499 df-lplanes 39500 df-lvols 39501 df-lines 39502 df-psubsp 39504 df-pmap 39505 df-padd 39797 df-lhyp 39989 df-laut 39990 df-ldil 40105 df-ltrn 40106 df-trl 40160 df-tgrp 40744 df-tendo 40756 df-edring 40758 df-dveca 41004 df-disoa 41030 df-dvech 41080 df-dib 41140 df-dic 41174 df-dih 41230 df-doch 41349 df-djh 41396 df-lcdual 41588 df-mapd 41626

This theorem is referenced by: mapdpglem24 41705

W3C validator