hdmap1l6a - Mathbox for Norm Megill

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

Theorem hdmap1l6a 42690

Description: Lemma for hdmap1l6 42702. Part (6) in [Baer] p. 47, case 1. (Contributed by NM, 23-Apr-2015.)

**Hypotheses**
Ref	Expression
hdmap1l6.h	⊢ 𝐻 = (LHyp‘𝐾)
hdmap1l6.u	⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
hdmap1l6.v	⊢ 𝑉 = (Base‘𝑈)
hdmap1l6.p	⊢ + = (+_g‘𝑈)
hdmap1l6.s	⊢ − = (-_g‘𝑈)
hdmap1l6c.o	⊢ 0 = (0_g‘𝑈)
hdmap1l6.n	⊢ 𝑁 = (LSpan‘𝑈)
hdmap1l6.c	⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊)
hdmap1l6.d	⊢ 𝐷 = (Base‘𝐶)
hdmap1l6.a	⊢ ✚ = (+_g‘𝐶)
hdmap1l6.r	⊢ 𝑅 = (-_g‘𝐶)
hdmap1l6.q	⊢ 𝑄 = (0_g‘𝐶)
hdmap1l6.l	⊢ 𝐿 = (LSpan‘𝐶)
hdmap1l6.m	⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
hdmap1l6.i	⊢ 𝐼 = ((HDMap1‘𝐾)‘𝑊)
hdmap1l6.k	⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
hdmap1l6.f	⊢ (𝜑 → 𝐹 ∈ 𝐷)
hdmap1l6cl.x	⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 }))
hdmap1l6.mn	⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐿‘{𝐹}))
hdmap1l6e.y	⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 }))
hdmap1l6e.z	⊢ (𝜑 → 𝑍 ∈ (𝑉 ∖ { 0 }))
hdmap1l6e.xn	⊢ (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))
hdmap1l6.yz	⊢ (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))
hdmap1l6.fg	⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)
hdmap1l6.fe	⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) = 𝐸)

**Assertion**
Ref	Expression
hdmap1l6a	⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))

**Proof of Theorem hdmap1l6a**
Step	Hyp	Ref	Expression
1		hdmap1l6.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
2		hdmap1l6.u	. . . 4 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
3		hdmap1l6.v	. . . 4 ⊢ 𝑉 = (Base‘𝑈)
4		hdmap1l6.p	. . . 4 ⊢ + = (+_g‘𝑈)
5		hdmap1l6.s	. . . 4 ⊢ − = (-_g‘𝑈)
6		hdmap1l6c.o	. . . 4 ⊢ 0 = (0_g‘𝑈)
7		hdmap1l6.n	. . . 4 ⊢ 𝑁 = (LSpan‘𝑈)
8		hdmap1l6.c	. . . 4 ⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊)
9		hdmap1l6.d	. . . 4 ⊢ 𝐷 = (Base‘𝐶)
10		hdmap1l6.a	. . . 4 ⊢ ✚ = (+_g‘𝐶)
11		hdmap1l6.r	. . . 4 ⊢ 𝑅 = (-_g‘𝐶)
12		hdmap1l6.q	. . . 4 ⊢ 𝑄 = (0_g‘𝐶)
13		hdmap1l6.l	. . . 4 ⊢ 𝐿 = (LSpan‘𝐶)
14		hdmap1l6.m	. . . 4 ⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
15		hdmap1l6.i	. . . 4 ⊢ 𝐼 = ((HDMap1‘𝐾)‘𝑊)
16		hdmap1l6.k	. . . 4 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
17		hdmap1l6.f	. . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝐷)
18		hdmap1l6cl.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 }))
19		hdmap1l6.mn	. . . 4 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐿‘{𝐹}))
20		hdmap1l6e.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 }))
21		hdmap1l6e.z	. . . 4 ⊢ (𝜑 → 𝑍 ∈ (𝑉 ∖ { 0 }))
22		hdmap1l6e.xn	. . . 4 ⊢ (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))
23		hdmap1l6.yz	. . . 4 ⊢ (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))
24		hdmap1l6.fg	. . . 4 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)
25		hdmap1l6.fe	. . . 4 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) = 𝐸)
26	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25	hdmap1l6lem2 42689	. . 3 ⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑌 + 𝑍)})) = (𝐿‘{(𝐺 ✚ 𝐸)}))
27	24, 25	oveq12d 7435	. . . . 5 ⊢ (𝜑 → ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)) = (𝐺 ✚ 𝐸))
28	27	sneqd 4599	. . . 4 ⊢ (𝜑 → {((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩))} = {(𝐺 ✚ 𝐸)})
29	28	fveq2d 6886	. . 3 ⊢ (𝜑 → (𝐿‘{((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩))}) = (𝐿‘{(𝐺 ✚ 𝐸)}))
30	26, 29	eqtr4d 2800	. 2 ⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑌 + 𝑍)})) = (𝐿‘{((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩))}))
31	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25	hdmap1l6lem1 42688	. . 3 ⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑋 − (𝑌 + 𝑍))})) = (𝐿‘{(𝐹𝑅(𝐺 ✚ 𝐸))}))
32	27	oveq2d 7433	. . . . 5 ⊢ (𝜑 → (𝐹𝑅((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩))) = (𝐹𝑅(𝐺 ✚ 𝐸)))
33	32	sneqd 4599	. . . 4 ⊢ (𝜑 → {(𝐹𝑅((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))} = {(𝐹𝑅(𝐺 ✚ 𝐸))})
34	33	fveq2d 6886	. . 3 ⊢ (𝜑 → (𝐿‘{(𝐹𝑅((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))}) = (𝐿‘{(𝐹𝑅(𝐺 ✚ 𝐸))}))
35	31, 34	eqtr4d 2800	. 2 ⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑋 − (𝑌 + 𝑍))})) = (𝐿‘{(𝐹𝑅((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))}))
36	1, 2, 16	dvhlmod 41991	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ LMod)
37	20	eldifad 3914	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
38	21	eldifad 3914	. . . . 5 ⊢ (𝜑 → 𝑍 ∈ 𝑉)
39	3, 4	lmodvacl 21065	. . . . 5 ⊢ ((𝑈 ∈ LMod ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑉) → (𝑌 + 𝑍) ∈ 𝑉)
40	36, 37, 38, 39	syl3anc 1398	. . . 4 ⊢ (𝜑 → (𝑌 + 𝑍) ∈ 𝑉)
41	3, 4, 6, 7, 36, 37, 38, 23	lmodindp1 21204	. . . 4 ⊢ (𝜑 → (𝑌 + 𝑍) ≠ 0 )
42		eldifsn 4751	. . . 4 ⊢ ((𝑌 + 𝑍) ∈ (𝑉 ∖ { 0 }) ↔ ((𝑌 + 𝑍) ∈ 𝑉 ∧ (𝑌 + 𝑍) ≠ 0 ))
43	40, 41, 42	sylanbrc 595	. . 3 ⊢ (𝜑 → (𝑌 + 𝑍) ∈ (𝑉 ∖ { 0 }))
44	1, 8, 16	lcdlmod 42473	. . . 4 ⊢ (𝜑 → 𝐶 ∈ LMod)
45	1, 2, 16	dvhlvec 41990	. . . . . . 7 ⊢ (𝜑 → 𝑈 ∈ LVec)
46	18	eldifad 3914	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
47	3, 6, 7, 45, 37, 21, 46, 23, 22	lspindp2 21328	. . . . . 6 ⊢ (𝜑 → ((𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}) ∧ ¬ 𝑍 ∈ (𝑁‘{𝑋, 𝑌})))
48	47	simpld 500	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))
49	1, 2, 3, 6, 7, 8, 9, 13, 14, 15, 16, 17, 19, 48, 18, 37	hdmap1cl 42685	. . . 4 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ∈ 𝐷)
50	3, 6, 7, 45, 20, 38, 46, 23, 22	lspindp1 21326	. . . . . 6 ⊢ (𝜑 → ((𝑁‘{𝑋}) ≠ (𝑁‘{𝑍}) ∧ ¬ 𝑌 ∈ (𝑁‘{𝑋, 𝑍})))
51	50	simpld 500	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑍}))
52	1, 2, 3, 6, 7, 8, 9, 13, 14, 15, 16, 17, 19, 51, 18, 38	hdmap1cl 42685	. . . 4 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) ∈ 𝐷)
53	9, 10	lmodvacl 21065	. . . 4 ⊢ ((𝐶 ∈ LMod ∧ (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ∈ 𝐷 ∧ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) ∈ 𝐷) → ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)) ∈ 𝐷)
54	44, 49, 52, 53	syl3anc 1398	. . 3 ⊢ (𝜑 → ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)) ∈ 𝐷)
55		eqid 2762	. . . . . 6 ⊢ (LSubSp‘𝑈) = (LSubSp‘𝑈)
56	3, 55, 7, 36, 37, 38	lspprcl 21168	. . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑌, 𝑍}) ∈ (LSubSp‘𝑈))
57	3, 4, 7, 36, 37, 38	lspprvacl 21189	. . . . . 6 ⊢ (𝜑 → (𝑌 + 𝑍) ∈ (𝑁‘{𝑌, 𝑍}))
58	55, 7, 36, 56, 57	ellspsn5 21186	. . . . 5 ⊢ (𝜑 → (𝑁‘{(𝑌 + 𝑍)}) ⊆ (𝑁‘{𝑌, 𝑍}))
59	3, 55, 7, 36, 56, 46	ellspsn5b 21185	. . . . . 6 ⊢ (𝜑 → (𝑋 ∈ (𝑁‘{𝑌, 𝑍}) ↔ (𝑁‘{𝑋}) ⊆ (𝑁‘{𝑌, 𝑍})))
60	22, 59	mtbid 327	. . . . 5 ⊢ (𝜑 → ¬ (𝑁‘{𝑋}) ⊆ (𝑁‘{𝑌, 𝑍}))
61		nssne2 3997	. . . . 5 ⊢ (((𝑁‘{(𝑌 + 𝑍)}) ⊆ (𝑁‘{𝑌, 𝑍}) ∧ ¬ (𝑁‘{𝑋}) ⊆ (𝑁‘{𝑌, 𝑍})) → (𝑁‘{(𝑌 + 𝑍)}) ≠ (𝑁‘{𝑋}))
62	58, 60, 61	syl2anc 596	. . . 4 ⊢ (𝜑 → (𝑁‘{(𝑌 + 𝑍)}) ≠ (𝑁‘{𝑋}))
63	62	necomd 3012	. . 3 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{(𝑌 + 𝑍)}))
64	1, 2, 3, 5, 6, 7, 8, 9, 11, 13, 14, 15, 16, 18, 17, 43, 54, 63, 19	hdmap1eq 42682	. 2 ⊢ (𝜑 → ((𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)) ↔ ((𝑀‘(𝑁‘{(𝑌 + 𝑍)})) = (𝐿‘{((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩))}) ∧ (𝑀‘(𝑁‘{(𝑋 − (𝑌 + 𝑍))})) = (𝐿‘{(𝐹𝑅((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))}))))
65	30, 35, 64	mpbir2and 726	1 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2957 ∖ cdif 3899 ⊆ wss 3902 {csn 4587 {cpr 4589 ⟨cotp 4595 ‘cfv 6537 (class class class)co 7417 Basecbs 17307 +_gcplusg 17348 0_gc0g 17530 -_gcsg 19065 LModclmod 21050 LSubSpclss 21121 LSpanclspn 21161 HLchlt 40231 LHypclh 40865 DVecHcdvh 41959 LCDualclcd 42467 mapdcmpd 42505 HDMap1chdma1 42672

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-cnex 11184 ax-resscn 11185 ax-1cn 11186 ax-icn 11187 ax-addcl 11188 ax-addrcl 11189 ax-mulcl 11190 ax-mulrcl 11191 ax-mulcom 11192 ax-addass 11193 ax-mulass 11194 ax-distr 11195 ax-i2m1 11196 ax-1ne0 11197 ax-1rid 11198 ax-rnegex 11199 ax-rrecex 11200 ax-cnre 11201 ax-pre-lttri 11202 ax-pre-lttrn 11203 ax-pre-ltadd 11204 ax-pre-mulgt0 11205 ax-riotaBAD 39834

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4594 df-ot 4596 df-uni 4871 df-int 4911 df-iun 4956 df-iin 4957 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-of 7682 df-om 7867 df-1st 7990 df-2nd 7991 df-tpos 8228 df-undef 8275 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-2o 8460 df-er 8700 df-map 8832 df-en 8957 df-dom 8958 df-sdom 8959 df-fin 8960 df-pnf 11273 df-mnf 11274 df-xr 11275 df-ltxr 11276 df-le 11277 df-sub 11471 df-neg 11472 df-nn 12262 df-2 12331 df-3 12332 df-4 12333 df-5 12334 df-6 12335 df-n0 12533 df-z 12620 df-uz 12892 df-fz 13566 df-struct 17245 df-sets 17262 df-slot 17280 df-ndx 17292 df-base 17308 df-ress 17329 df-plusg 17361 df-mulr 17362 df-sca 17364 df-vsca 17365 df-0g 17532 df-mre 17676 df-mrc 17677 df-acs 17679 df-proset 18388 df-poset 18407 df-plt 18422 df-lub 18438 df-glb 18439 df-join 18440 df-meet 18441 df-p0 18517 df-p1 18518 df-lat 18526 df-clat 18593 df-mgm 18736 df-sgrp 18827 df-mnd 18843 df-submnd 18898 df-grp 19066 df-minusg 19067 df-sbg 19068 df-subg 19252 df-cntz 19450 df-oppg 19479 df-lsm 19769 df-cmn 19915 df-abl 19916 df-mgp 20280 df-rng 20294 df-ur 20327 df-ring 20380 df-oppr 20484 df-dvdsr 20504 df-unit 20505 df-invr 20535 df-dvr 20548 df-nzr 20679 df-rlreg 20862 df-domn 20863 df-drng 20898 df-lmod 21052 df-lss 21122 df-lsp 21162 df-lvec 21293 df-lsatoms 39857 df-lshyp 39858 df-lcv 39900 df-lfl 39939 df-lkr 39967 df-ldual 40005 df-oposet 40057 df-ol 40059 df-oml 40060 df-covers 40147 df-ats 40148 df-atl 40179 df-cvlat 40203 df-hlat 40232 df-llines 40379 df-lplanes 40380 df-lvols 40381 df-lines 40382 df-psubsp 40384 df-pmap 40385 df-padd 40677 df-lhyp 40869 df-laut 40870 df-ldil 40985 df-ltrn 40986 df-trl 41040 df-tgrp 41624 df-tendo 41636 df-edring 41638 df-dveca 41884 df-disoa 41910 df-dvech 41960 df-dib 42020 df-dic 42054 df-dih 42110 df-doch 42229 df-djh 42276 df-lcdual 42468 df-mapd 42506 df-hdmap1 42674

This theorem is used by: hdmap1l6d 42694 hdmap1l6e 42695 hdmap1l6f 42696 hdmap1l6j 42700

W3C validator