hdmap1l6lem1 - Mathbox for Norm Megill

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

Theorem hdmap1l6lem1 42067

Description: Lemma for hdmap1l6 42081. Part (6) in [Baer] p. 47, lines 16-18. (Contributed by NM, 13-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
hdmap1l6lem1	⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑋 − (𝑌 + 𝑍))})) = (𝐿‘{(𝐹𝑅(𝐺 ✚ 𝐸))}))

**Proof of Theorem hdmap1l6lem1**
Step	Hyp	Ref	Expression
1		hdmap1l6.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
2		hdmap1l6.m	. . . 4 ⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
3		hdmap1l6.u	. . . 4 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
4		eqid 2736	. . . 4 ⊢ (LSubSp‘𝑈) = (LSubSp‘𝑈)
5		hdmap1l6.k	. . . 4 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
6	1, 3, 5	dvhlmod 41370	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ LMod)
7		hdmap1l6cl.x	. . . . . . . 8 ⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 }))
8	7	eldifad 3913	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
9		hdmap1l6e.y	. . . . . . . 8 ⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 }))
10	9	eldifad 3913	. . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
11		hdmap1l6.v	. . . . . . . 8 ⊢ 𝑉 = (Base‘𝑈)
12		hdmap1l6.s	. . . . . . . 8 ⊢ − = (-_g‘𝑈)
13	11, 12	lmodvsubcl 20858	. . . . . . 7 ⊢ ((𝑈 ∈ LMod ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝑋 − 𝑌) ∈ 𝑉)
14	6, 8, 10, 13	syl3anc 1373	. . . . . 6 ⊢ (𝜑 → (𝑋 − 𝑌) ∈ 𝑉)
15		hdmap1l6.n	. . . . . . 7 ⊢ 𝑁 = (LSpan‘𝑈)
16	11, 4, 15	lspsncl 20928	. . . . . 6 ⊢ ((𝑈 ∈ LMod ∧ (𝑋 − 𝑌) ∈ 𝑉) → (𝑁‘{(𝑋 − 𝑌)}) ∈ (LSubSp‘𝑈))
17	6, 14, 16	syl2anc 584	. . . . 5 ⊢ (𝜑 → (𝑁‘{(𝑋 − 𝑌)}) ∈ (LSubSp‘𝑈))
18		hdmap1l6e.z	. . . . . . 7 ⊢ (𝜑 → 𝑍 ∈ (𝑉 ∖ { 0 }))
19	18	eldifad 3913	. . . . . 6 ⊢ (𝜑 → 𝑍 ∈ 𝑉)
20	11, 4, 15	lspsncl 20928	. . . . . 6 ⊢ ((𝑈 ∈ LMod ∧ 𝑍 ∈ 𝑉) → (𝑁‘{𝑍}) ∈ (LSubSp‘𝑈))
21	6, 19, 20	syl2anc 584	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑍}) ∈ (LSubSp‘𝑈))
22		eqid 2736	. . . . . 6 ⊢ (LSSum‘𝑈) = (LSSum‘𝑈)
23	4, 22	lsmcl 21035	. . . . 5 ⊢ ((𝑈 ∈ LMod ∧ (𝑁‘{(𝑋 − 𝑌)}) ∈ (LSubSp‘𝑈) ∧ (𝑁‘{𝑍}) ∈ (LSubSp‘𝑈)) → ((𝑁‘{(𝑋 − 𝑌)})(LSSum‘𝑈)(𝑁‘{𝑍})) ∈ (LSubSp‘𝑈))
24	6, 17, 21, 23	syl3anc 1373	. . . 4 ⊢ (𝜑 → ((𝑁‘{(𝑋 − 𝑌)})(LSSum‘𝑈)(𝑁‘{𝑍})) ∈ (LSubSp‘𝑈))
25	11, 12	lmodvsubcl 20858	. . . . . . 7 ⊢ ((𝑈 ∈ LMod ∧ 𝑋 ∈ 𝑉 ∧ 𝑍 ∈ 𝑉) → (𝑋 − 𝑍) ∈ 𝑉)
26	6, 8, 19, 25	syl3anc 1373	. . . . . 6 ⊢ (𝜑 → (𝑋 − 𝑍) ∈ 𝑉)
27	11, 4, 15	lspsncl 20928	. . . . . 6 ⊢ ((𝑈 ∈ LMod ∧ (𝑋 − 𝑍) ∈ 𝑉) → (𝑁‘{(𝑋 − 𝑍)}) ∈ (LSubSp‘𝑈))
28	6, 26, 27	syl2anc 584	. . . . 5 ⊢ (𝜑 → (𝑁‘{(𝑋 − 𝑍)}) ∈ (LSubSp‘𝑈))
29	11, 4, 15	lspsncl 20928	. . . . . 6 ⊢ ((𝑈 ∈ LMod ∧ 𝑌 ∈ 𝑉) → (𝑁‘{𝑌}) ∈ (LSubSp‘𝑈))
30	6, 10, 29	syl2anc 584	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑌}) ∈ (LSubSp‘𝑈))
31	4, 22	lsmcl 21035	. . . . 5 ⊢ ((𝑈 ∈ LMod ∧ (𝑁‘{(𝑋 − 𝑍)}) ∈ (LSubSp‘𝑈) ∧ (𝑁‘{𝑌}) ∈ (LSubSp‘𝑈)) → ((𝑁‘{(𝑋 − 𝑍)})(LSSum‘𝑈)(𝑁‘{𝑌})) ∈ (LSubSp‘𝑈))
32	6, 28, 30, 31	syl3anc 1373	. . . 4 ⊢ (𝜑 → ((𝑁‘{(𝑋 − 𝑍)})(LSSum‘𝑈)(𝑁‘{𝑌})) ∈ (LSubSp‘𝑈))
33	1, 2, 3, 4, 5, 24, 32	mapdin 41922	. . 3 ⊢ (𝜑 → (𝑀‘(((𝑁‘{(𝑋 − 𝑌)})(LSSum‘𝑈)(𝑁‘{𝑍})) ∩ ((𝑁‘{(𝑋 − 𝑍)})(LSSum‘𝑈)(𝑁‘{𝑌})))) = ((𝑀‘((𝑁‘{(𝑋 − 𝑌)})(LSSum‘𝑈)(𝑁‘{𝑍}))) ∩ (𝑀‘((𝑁‘{(𝑋 − 𝑍)})(LSSum‘𝑈)(𝑁‘{𝑌})))))
34		hdmap1l6.c	. . . . . 6 ⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊)
35		eqid 2736	. . . . . 6 ⊢ (LSSum‘𝐶) = (LSSum‘𝐶)
36	1, 2, 3, 4, 22, 34, 35, 5, 17, 21	mapdlsm 41924	. . . . 5 ⊢ (𝜑 → (𝑀‘((𝑁‘{(𝑋 − 𝑌)})(LSSum‘𝑈)(𝑁‘{𝑍}))) = ((𝑀‘(𝑁‘{(𝑋 − 𝑌)}))(LSSum‘𝐶)(𝑀‘(𝑁‘{𝑍}))))
37	1, 2, 3, 4, 22, 34, 35, 5, 28, 30	mapdlsm 41924	. . . . 5 ⊢ (𝜑 → (𝑀‘((𝑁‘{(𝑋 − 𝑍)})(LSSum‘𝑈)(𝑁‘{𝑌}))) = ((𝑀‘(𝑁‘{(𝑋 − 𝑍)}))(LSSum‘𝐶)(𝑀‘(𝑁‘{𝑌}))))
38	36, 37	ineq12d 4173	. . . 4 ⊢ (𝜑 → ((𝑀‘((𝑁‘{(𝑋 − 𝑌)})(LSSum‘𝑈)(𝑁‘{𝑍}))) ∩ (𝑀‘((𝑁‘{(𝑋 − 𝑍)})(LSSum‘𝑈)(𝑁‘{𝑌})))) = (((𝑀‘(𝑁‘{(𝑋 − 𝑌)}))(LSSum‘𝐶)(𝑀‘(𝑁‘{𝑍}))) ∩ ((𝑀‘(𝑁‘{(𝑋 − 𝑍)}))(LSSum‘𝐶)(𝑀‘(𝑁‘{𝑌})))))
39		hdmap1l6.fg	. . . . . . . 8 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)
40		hdmap1l6c.o	. . . . . . . . 9 ⊢ 0 = (0_g‘𝑈)
41		hdmap1l6.d	. . . . . . . . 9 ⊢ 𝐷 = (Base‘𝐶)
42		hdmap1l6.r	. . . . . . . . 9 ⊢ 𝑅 = (-_g‘𝐶)
43		hdmap1l6.l	. . . . . . . . 9 ⊢ 𝐿 = (LSpan‘𝐶)
44		hdmap1l6.i	. . . . . . . . 9 ⊢ 𝐼 = ((HDMap1‘𝐾)‘𝑊)
45		hdmap1l6.f	. . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ 𝐷)
46		hdmap1l6.mn	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐿‘{𝐹}))
47	1, 3, 5	dvhlvec 41369	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑈 ∈ LVec)
48		hdmap1l6.yz	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))
49		hdmap1l6e.xn	. . . . . . . . . . . . 13 ⊢ (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))
50	11, 40, 15, 47, 10, 18, 8, 48, 49	lspindp2 21090	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}) ∧ ¬ 𝑍 ∈ (𝑁‘{𝑋, 𝑌})))
51	50	simpld 494	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))
52	1, 3, 11, 40, 15, 34, 41, 43, 2, 44, 5, 45, 46, 51, 7, 10	hdmap1cl 42064	. . . . . . . . . 10 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ∈ 𝐷)
53	39, 52	eqeltrrd 2837	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 ∈ 𝐷)
54	1, 3, 11, 12, 40, 15, 34, 41, 42, 43, 2, 44, 5, 7, 45, 9, 53, 51, 46	hdmap1eq 42061	. . . . . . . 8 ⊢ (𝜑 → ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺 ↔ ((𝑀‘(𝑁‘{𝑌})) = (𝐿‘{𝐺}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐿‘{(𝐹𝑅𝐺)}))))
55	39, 54	mpbid 232	. . . . . . 7 ⊢ (𝜑 → ((𝑀‘(𝑁‘{𝑌})) = (𝐿‘{𝐺}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐿‘{(𝐹𝑅𝐺)})))
56	55	simprd 495	. . . . . 6 ⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐿‘{(𝐹𝑅𝐺)}))
57		hdmap1l6.fe	. . . . . . . 8 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) = 𝐸)
58	11, 40, 15, 47, 9, 19, 8, 48, 49	lspindp1 21088	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑁‘{𝑋}) ≠ (𝑁‘{𝑍}) ∧ ¬ 𝑌 ∈ (𝑁‘{𝑋, 𝑍})))
59	58	simpld 494	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑍}))
60	1, 3, 11, 40, 15, 34, 41, 43, 2, 44, 5, 45, 46, 59, 7, 19	hdmap1cl 42064	. . . . . . . . . 10 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) ∈ 𝐷)
61	57, 60	eqeltrrd 2837	. . . . . . . . 9 ⊢ (𝜑 → 𝐸 ∈ 𝐷)
62	1, 3, 11, 12, 40, 15, 34, 41, 42, 43, 2, 44, 5, 7, 45, 18, 61, 59, 46	hdmap1eq 42061	. . . . . . . 8 ⊢ (𝜑 → ((𝐼‘⟨𝑋, 𝐹, 𝑍⟩) = 𝐸 ↔ ((𝑀‘(𝑁‘{𝑍})) = (𝐿‘{𝐸}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑍)})) = (𝐿‘{(𝐹𝑅𝐸)}))))
63	57, 62	mpbid 232	. . . . . . 7 ⊢ (𝜑 → ((𝑀‘(𝑁‘{𝑍})) = (𝐿‘{𝐸}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑍)})) = (𝐿‘{(𝐹𝑅𝐸)})))
64	63	simpld 494	. . . . . 6 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑍})) = (𝐿‘{𝐸}))
65	56, 64	oveq12d 7376	. . . . 5 ⊢ (𝜑 → ((𝑀‘(𝑁‘{(𝑋 − 𝑌)}))(LSSum‘𝐶)(𝑀‘(𝑁‘{𝑍}))) = ((𝐿‘{(𝐹𝑅𝐺)})(LSSum‘𝐶)(𝐿‘{𝐸})))
66	63	simprd 495	. . . . . 6 ⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑋 − 𝑍)})) = (𝐿‘{(𝐹𝑅𝐸)}))
67	55	simpld 494	. . . . . 6 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑌})) = (𝐿‘{𝐺}))
68	66, 67	oveq12d 7376	. . . . 5 ⊢ (𝜑 → ((𝑀‘(𝑁‘{(𝑋 − 𝑍)}))(LSSum‘𝐶)(𝑀‘(𝑁‘{𝑌}))) = ((𝐿‘{(𝐹𝑅𝐸)})(LSSum‘𝐶)(𝐿‘{𝐺})))
69	65, 68	ineq12d 4173	. . . 4 ⊢ (𝜑 → (((𝑀‘(𝑁‘{(𝑋 − 𝑌)}))(LSSum‘𝐶)(𝑀‘(𝑁‘{𝑍}))) ∩ ((𝑀‘(𝑁‘{(𝑋 − 𝑍)}))(LSSum‘𝐶)(𝑀‘(𝑁‘{𝑌})))) = (((𝐿‘{(𝐹𝑅𝐺)})(LSSum‘𝐶)(𝐿‘{𝐸})) ∩ ((𝐿‘{(𝐹𝑅𝐸)})(LSSum‘𝐶)(𝐿‘{𝐺}))))
70	38, 69	eqtrd 2771	. . 3 ⊢ (𝜑 → ((𝑀‘((𝑁‘{(𝑋 − 𝑌)})(LSSum‘𝑈)(𝑁‘{𝑍}))) ∩ (𝑀‘((𝑁‘{(𝑋 − 𝑍)})(LSSum‘𝑈)(𝑁‘{𝑌})))) = (((𝐿‘{(𝐹𝑅𝐺)})(LSSum‘𝐶)(𝐿‘{𝐸})) ∩ ((𝐿‘{(𝐹𝑅𝐸)})(LSSum‘𝐶)(𝐿‘{𝐺}))))
71	33, 70	eqtrd 2771	. 2 ⊢ (𝜑 → (𝑀‘(((𝑁‘{(𝑋 − 𝑌)})(LSSum‘𝑈)(𝑁‘{𝑍})) ∩ ((𝑁‘{(𝑋 − 𝑍)})(LSSum‘𝑈)(𝑁‘{𝑌})))) = (((𝐿‘{(𝐹𝑅𝐺)})(LSSum‘𝐶)(𝐿‘{𝐸})) ∩ ((𝐿‘{(𝐹𝑅𝐸)})(LSSum‘𝐶)(𝐿‘{𝐺}))))
72		hdmap1l6.p	. . . 4 ⊢ + = (+_g‘𝑈)
73	11, 12, 40, 22, 15, 47, 8, 49, 48, 9, 18, 72	baerlem5a 41974	. . 3 ⊢ (𝜑 → (𝑁‘{(𝑋 − (𝑌 + 𝑍))}) = (((𝑁‘{(𝑋 − 𝑌)})(LSSum‘𝑈)(𝑁‘{𝑍})) ∩ ((𝑁‘{(𝑋 − 𝑍)})(LSSum‘𝑈)(𝑁‘{𝑌}))))
74	73	fveq2d 6838	. 2 ⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑋 − (𝑌 + 𝑍))})) = (𝑀‘(((𝑁‘{(𝑋 − 𝑌)})(LSSum‘𝑈)(𝑁‘{𝑍})) ∩ ((𝑁‘{(𝑋 − 𝑍)})(LSSum‘𝑈)(𝑁‘{𝑌})))))
75		hdmap1l6.q	. . 3 ⊢ 𝑄 = (0_g‘𝐶)
76	1, 34, 5	lcdlvec 41851	. . 3 ⊢ (𝜑 → 𝐶 ∈ LVec)
77	1, 2, 3, 11, 15, 34, 41, 43, 5, 45, 46, 8, 10, 53, 67, 19, 61, 64, 49	mapdindp 41931	. . 3 ⊢ (𝜑 → ¬ 𝐹 ∈ (𝐿‘{𝐺, 𝐸}))
78	1, 2, 3, 11, 15, 34, 41, 43, 5, 53, 67, 10, 19, 61, 64, 48	mapdncol 41930	. . 3 ⊢ (𝜑 → (𝐿‘{𝐺}) ≠ (𝐿‘{𝐸}))
79	1, 2, 3, 11, 15, 34, 41, 43, 5, 53, 67, 40, 75, 9	mapdn0 41929	. . 3 ⊢ (𝜑 → 𝐺 ∈ (𝐷 ∖ {𝑄}))
80	1, 2, 3, 11, 15, 34, 41, 43, 5, 61, 64, 40, 75, 18	mapdn0 41929	. . 3 ⊢ (𝜑 → 𝐸 ∈ (𝐷 ∖ {𝑄}))
81		hdmap1l6.a	. . 3 ⊢ ✚ = (+_g‘𝐶)
82	41, 42, 75, 35, 43, 76, 45, 77, 78, 79, 80, 81	baerlem5a 41974	. 2 ⊢ (𝜑 → (𝐿‘{(𝐹𝑅(𝐺 ✚ 𝐸))}) = (((𝐿‘{(𝐹𝑅𝐺)})(LSSum‘𝐶)(𝐿‘{𝐸})) ∩ ((𝐿‘{(𝐹𝑅𝐸)})(LSSum‘𝐶)(𝐿‘{𝐺}))))
83	71, 74, 82	3eqtr4d 2781	1 ⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑋 − (𝑌 + 𝑍))})) = (𝐿‘{(𝐹𝑅(𝐺 ✚ 𝐸))}))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2932 ∖ cdif 3898 ∩ cin 3900 {csn 4580 {cpr 4582 ⟨cotp 4588 ‘cfv 6492 (class class class)co 7358 Basecbs 17136 +_gcplusg 17177 0_gc0g 17359 -_gcsg 18865 LSSumclsm 19563 LModclmod 20811 LSubSpclss 20882 LSpanclspn 20922 HLchlt 39610 LHypclh 40244 DVecHcdvh 41338 LCDualclcd 41846 mapdcmpd 41884 HDMap1chdma1 42051

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 ax-riotaBAD 39213

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-tp 4585 df-op 4587 df-ot 4589 df-uni 4864 df-int 4903 df-iun 4948 df-iin 4949 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-of 7622 df-om 7809 df-1st 7933 df-2nd 7934 df-tpos 8168 df-undef 8215 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-2o 8398 df-er 8635 df-map 8765 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-2 12208 df-3 12209 df-4 12210 df-5 12211 df-6 12212 df-n0 12402 df-z 12489 df-uz 12752 df-fz 13424 df-struct 17074 df-sets 17091 df-slot 17109 df-ndx 17121 df-base 17137 df-ress 17158 df-plusg 17190 df-mulr 17191 df-sca 17193 df-vsca 17194 df-0g 17361 df-mre 17505 df-mrc 17506 df-acs 17508 df-proset 18217 df-poset 18236 df-plt 18251 df-lub 18267 df-glb 18268 df-join 18269 df-meet 18270 df-p0 18346 df-p1 18347 df-lat 18355 df-clat 18422 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-submnd 18709 df-grp 18866 df-minusg 18867 df-sbg 18868 df-subg 19053 df-cntz 19246 df-oppg 19275 df-lsm 19565 df-cmn 19711 df-abl 19712 df-mgp 20076 df-rng 20088 df-ur 20117 df-ring 20170 df-oppr 20273 df-dvdsr 20293 df-unit 20294 df-invr 20324 df-dvr 20337 df-nzr 20446 df-rlreg 20627 df-domn 20628 df-drng 20664 df-lmod 20813 df-lss 20883 df-lsp 20923 df-lvec 21055 df-lsatoms 39236 df-lshyp 39237 df-lcv 39279 df-lfl 39318 df-lkr 39346 df-ldual 39384 df-oposet 39436 df-ol 39438 df-oml 39439 df-covers 39526 df-ats 39527 df-atl 39558 df-cvlat 39582 df-hlat 39611 df-llines 39758 df-lplanes 39759 df-lvols 39760 df-lines 39761 df-psubsp 39763 df-pmap 39764 df-padd 40056 df-lhyp 40248 df-laut 40249 df-ldil 40364 df-ltrn 40365 df-trl 40419 df-tgrp 41003 df-tendo 41015 df-edring 41017 df-dveca 41263 df-disoa 41289 df-dvech 41339 df-dib 41399 df-dic 41433 df-dih 41489 df-doch 41608 df-djh 41655 df-lcdual 41847 df-mapd 41885 df-hdmap1 42053

This theorem is referenced by: hdmap1l6lem2 42068 hdmap1l6a 42069

W3C validator