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 39821

Description: Lemma for hdmap1l6 39835. 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 2738	. . . 4 ⊢ (LSubSp‘𝑈) = (LSubSp‘𝑈)
5		hdmap1l6.k	. . . 4 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
6	1, 3, 5	dvhlmod 39124	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ LMod)
7		hdmap1l6cl.x	. . . . . . . 8 ⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 }))
8	7	eldifad 3899	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
9		hdmap1l6e.y	. . . . . . . 8 ⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 }))
10	9	eldifad 3899	. . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
11		hdmap1l6.v	. . . . . . . 8 ⊢ 𝑉 = (Base‘𝑈)
12		hdmap1l6.s	. . . . . . . 8 ⊢ − = (-_g‘𝑈)
13	11, 12	lmodvsubcl 20168	. . . . . . 7 ⊢ ((𝑈 ∈ LMod ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝑋 − 𝑌) ∈ 𝑉)
14	6, 8, 10, 13	syl3anc 1370	. . . . . 6 ⊢ (𝜑 → (𝑋 − 𝑌) ∈ 𝑉)
15		hdmap1l6.n	. . . . . . 7 ⊢ 𝑁 = (LSpan‘𝑈)
16	11, 4, 15	lspsncl 20239	. . . . . 6 ⊢ ((𝑈 ∈ LMod ∧ (𝑋 − 𝑌) ∈ 𝑉) → (𝑁‘{(𝑋 − 𝑌)}) ∈ (LSubSp‘𝑈))
17	6, 14, 16	syl2anc 584	. . . . 5 ⊢ (𝜑 → (𝑁‘{(𝑋 − 𝑌)}) ∈ (LSubSp‘𝑈))
18		hdmap1l6e.z	. . . . . . 7 ⊢ (𝜑 → 𝑍 ∈ (𝑉 ∖ { 0 }))
19	18	eldifad 3899	. . . . . 6 ⊢ (𝜑 → 𝑍 ∈ 𝑉)
20	11, 4, 15	lspsncl 20239	. . . . . 6 ⊢ ((𝑈 ∈ LMod ∧ 𝑍 ∈ 𝑉) → (𝑁‘{𝑍}) ∈ (LSubSp‘𝑈))
21	6, 19, 20	syl2anc 584	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑍}) ∈ (LSubSp‘𝑈))
22		eqid 2738	. . . . . 6 ⊢ (LSSum‘𝑈) = (LSSum‘𝑈)
23	4, 22	lsmcl 20345	. . . . 5 ⊢ ((𝑈 ∈ LMod ∧ (𝑁‘{(𝑋 − 𝑌)}) ∈ (LSubSp‘𝑈) ∧ (𝑁‘{𝑍}) ∈ (LSubSp‘𝑈)) → ((𝑁‘{(𝑋 − 𝑌)})(LSSum‘𝑈)(𝑁‘{𝑍})) ∈ (LSubSp‘𝑈))
24	6, 17, 21, 23	syl3anc 1370	. . . 4 ⊢ (𝜑 → ((𝑁‘{(𝑋 − 𝑌)})(LSSum‘𝑈)(𝑁‘{𝑍})) ∈ (LSubSp‘𝑈))
25	11, 12	lmodvsubcl 20168	. . . . . . 7 ⊢ ((𝑈 ∈ LMod ∧ 𝑋 ∈ 𝑉 ∧ 𝑍 ∈ 𝑉) → (𝑋 − 𝑍) ∈ 𝑉)
26	6, 8, 19, 25	syl3anc 1370	. . . . . 6 ⊢ (𝜑 → (𝑋 − 𝑍) ∈ 𝑉)
27	11, 4, 15	lspsncl 20239	. . . . . 6 ⊢ ((𝑈 ∈ LMod ∧ (𝑋 − 𝑍) ∈ 𝑉) → (𝑁‘{(𝑋 − 𝑍)}) ∈ (LSubSp‘𝑈))
28	6, 26, 27	syl2anc 584	. . . . 5 ⊢ (𝜑 → (𝑁‘{(𝑋 − 𝑍)}) ∈ (LSubSp‘𝑈))
29	11, 4, 15	lspsncl 20239	. . . . . 6 ⊢ ((𝑈 ∈ LMod ∧ 𝑌 ∈ 𝑉) → (𝑁‘{𝑌}) ∈ (LSubSp‘𝑈))
30	6, 10, 29	syl2anc 584	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑌}) ∈ (LSubSp‘𝑈))
31	4, 22	lsmcl 20345	. . . . 5 ⊢ ((𝑈 ∈ LMod ∧ (𝑁‘{(𝑋 − 𝑍)}) ∈ (LSubSp‘𝑈) ∧ (𝑁‘{𝑌}) ∈ (LSubSp‘𝑈)) → ((𝑁‘{(𝑋 − 𝑍)})(LSSum‘𝑈)(𝑁‘{𝑌})) ∈ (LSubSp‘𝑈))
32	6, 28, 30, 31	syl3anc 1370	. . . 4 ⊢ (𝜑 → ((𝑁‘{(𝑋 − 𝑍)})(LSSum‘𝑈)(𝑁‘{𝑌})) ∈ (LSubSp‘𝑈))
33	1, 2, 3, 4, 5, 24, 32	mapdin 39676	. . 3 ⊢ (𝜑 → (𝑀‘(((𝑁‘{(𝑋 − 𝑌)})(LSSum‘𝑈)(𝑁‘{𝑍})) ∩ ((𝑁‘{(𝑋 − 𝑍)})(LSSum‘𝑈)(𝑁‘{𝑌})))) = ((𝑀‘((𝑁‘{(𝑋 − 𝑌)})(LSSum‘𝑈)(𝑁‘{𝑍}))) ∩ (𝑀‘((𝑁‘{(𝑋 − 𝑍)})(LSSum‘𝑈)(𝑁‘{𝑌})))))
34		hdmap1l6.c	. . . . . 6 ⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊)
35		eqid 2738	. . . . . 6 ⊢ (LSSum‘𝐶) = (LSSum‘𝐶)
36	1, 2, 3, 4, 22, 34, 35, 5, 17, 21	mapdlsm 39678	. . . . 5 ⊢ (𝜑 → (𝑀‘((𝑁‘{(𝑋 − 𝑌)})(LSSum‘𝑈)(𝑁‘{𝑍}))) = ((𝑀‘(𝑁‘{(𝑋 − 𝑌)}))(LSSum‘𝐶)(𝑀‘(𝑁‘{𝑍}))))
37	1, 2, 3, 4, 22, 34, 35, 5, 28, 30	mapdlsm 39678	. . . . 5 ⊢ (𝜑 → (𝑀‘((𝑁‘{(𝑋 − 𝑍)})(LSSum‘𝑈)(𝑁‘{𝑌}))) = ((𝑀‘(𝑁‘{(𝑋 − 𝑍)}))(LSSum‘𝐶)(𝑀‘(𝑁‘{𝑌}))))
38	36, 37	ineq12d 4147	. . . 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 39123	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑈 ∈ LVec)
48		hdmap1l6.yz	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))
49		hdmap1l6e.xn	. . . . . . . . . . . . 13 ⊢ (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))
50	11, 40, 15, 47, 10, 18, 8, 48, 49	lspindp2 20397	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}) ∧ ¬ 𝑍 ∈ (𝑁‘{𝑋, 𝑌})))
51	50	simpld 495	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))
52	1, 3, 11, 40, 15, 34, 41, 43, 2, 44, 5, 45, 46, 51, 7, 10	hdmap1cl 39818	. . . . . . . . . 10 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ∈ 𝐷)
53	39, 52	eqeltrrd 2840	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 ∈ 𝐷)
54	1, 3, 11, 12, 40, 15, 34, 41, 42, 43, 2, 44, 5, 7, 45, 9, 53, 51, 46	hdmap1eq 39815	. . . . . . . 8 ⊢ (𝜑 → ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺 ↔ ((𝑀‘(𝑁‘{𝑌})) = (𝐿‘{𝐺}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐿‘{(𝐹𝑅𝐺)}))))
55	39, 54	mpbid 231	. . . . . . 7 ⊢ (𝜑 → ((𝑀‘(𝑁‘{𝑌})) = (𝐿‘{𝐺}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐿‘{(𝐹𝑅𝐺)})))
56	55	simprd 496	. . . . . 6 ⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐿‘{(𝐹𝑅𝐺)}))
57		hdmap1l6.fe	. . . . . . . 8 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) = 𝐸)
58	11, 40, 15, 47, 9, 19, 8, 48, 49	lspindp1 20395	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑁‘{𝑋}) ≠ (𝑁‘{𝑍}) ∧ ¬ 𝑌 ∈ (𝑁‘{𝑋, 𝑍})))
59	58	simpld 495	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑍}))
60	1, 3, 11, 40, 15, 34, 41, 43, 2, 44, 5, 45, 46, 59, 7, 19	hdmap1cl 39818	. . . . . . . . . 10 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) ∈ 𝐷)
61	57, 60	eqeltrrd 2840	. . . . . . . . 9 ⊢ (𝜑 → 𝐸 ∈ 𝐷)
62	1, 3, 11, 12, 40, 15, 34, 41, 42, 43, 2, 44, 5, 7, 45, 18, 61, 59, 46	hdmap1eq 39815	. . . . . . . 8 ⊢ (𝜑 → ((𝐼‘⟨𝑋, 𝐹, 𝑍⟩) = 𝐸 ↔ ((𝑀‘(𝑁‘{𝑍})) = (𝐿‘{𝐸}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑍)})) = (𝐿‘{(𝐹𝑅𝐸)}))))
63	57, 62	mpbid 231	. . . . . . 7 ⊢ (𝜑 → ((𝑀‘(𝑁‘{𝑍})) = (𝐿‘{𝐸}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑍)})) = (𝐿‘{(𝐹𝑅𝐸)})))
64	63	simpld 495	. . . . . 6 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑍})) = (𝐿‘{𝐸}))
65	56, 64	oveq12d 7293	. . . . 5 ⊢ (𝜑 → ((𝑀‘(𝑁‘{(𝑋 − 𝑌)}))(LSSum‘𝐶)(𝑀‘(𝑁‘{𝑍}))) = ((𝐿‘{(𝐹𝑅𝐺)})(LSSum‘𝐶)(𝐿‘{𝐸})))
66	63	simprd 496	. . . . . 6 ⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑋 − 𝑍)})) = (𝐿‘{(𝐹𝑅𝐸)}))
67	55	simpld 495	. . . . . 6 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑌})) = (𝐿‘{𝐺}))
68	66, 67	oveq12d 7293	. . . . 5 ⊢ (𝜑 → ((𝑀‘(𝑁‘{(𝑋 − 𝑍)}))(LSSum‘𝐶)(𝑀‘(𝑁‘{𝑌}))) = ((𝐿‘{(𝐹𝑅𝐸)})(LSSum‘𝐶)(𝐿‘{𝐺})))
69	65, 68	ineq12d 4147	. . . 4 ⊢ (𝜑 → (((𝑀‘(𝑁‘{(𝑋 − 𝑌)}))(LSSum‘𝐶)(𝑀‘(𝑁‘{𝑍}))) ∩ ((𝑀‘(𝑁‘{(𝑋 − 𝑍)}))(LSSum‘𝐶)(𝑀‘(𝑁‘{𝑌})))) = (((𝐿‘{(𝐹𝑅𝐺)})(LSSum‘𝐶)(𝐿‘{𝐸})) ∩ ((𝐿‘{(𝐹𝑅𝐸)})(LSSum‘𝐶)(𝐿‘{𝐺}))))
70	38, 69	eqtrd 2778	. . 3 ⊢ (𝜑 → ((𝑀‘((𝑁‘{(𝑋 − 𝑌)})(LSSum‘𝑈)(𝑁‘{𝑍}))) ∩ (𝑀‘((𝑁‘{(𝑋 − 𝑍)})(LSSum‘𝑈)(𝑁‘{𝑌})))) = (((𝐿‘{(𝐹𝑅𝐺)})(LSSum‘𝐶)(𝐿‘{𝐸})) ∩ ((𝐿‘{(𝐹𝑅𝐸)})(LSSum‘𝐶)(𝐿‘{𝐺}))))
71	33, 70	eqtrd 2778	. 2 ⊢ (𝜑 → (𝑀‘(((𝑁‘{(𝑋 − 𝑌)})(LSSum‘𝑈)(𝑁‘{𝑍})) ∩ ((𝑁‘{(𝑋 − 𝑍)})(LSSum‘𝑈)(𝑁‘{𝑌})))) = (((𝐿‘{(𝐹𝑅𝐺)})(LSSum‘𝐶)(𝐿‘{𝐸})) ∩ ((𝐿‘{(𝐹𝑅𝐸)})(LSSum‘𝐶)(𝐿‘{𝐺}))))
72		hdmap1l6.p	. . . 4 ⊢ + = (+_g‘𝑈)
73	11, 12, 40, 22, 15, 47, 8, 49, 48, 9, 18, 72	baerlem5a 39728	. . 3 ⊢ (𝜑 → (𝑁‘{(𝑋 − (𝑌 + 𝑍))}) = (((𝑁‘{(𝑋 − 𝑌)})(LSSum‘𝑈)(𝑁‘{𝑍})) ∩ ((𝑁‘{(𝑋 − 𝑍)})(LSSum‘𝑈)(𝑁‘{𝑌}))))
74	73	fveq2d 6778	. 2 ⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑋 − (𝑌 + 𝑍))})) = (𝑀‘(((𝑁‘{(𝑋 − 𝑌)})(LSSum‘𝑈)(𝑁‘{𝑍})) ∩ ((𝑁‘{(𝑋 − 𝑍)})(LSSum‘𝑈)(𝑁‘{𝑌})))))
75		hdmap1l6.q	. . 3 ⊢ 𝑄 = (0_g‘𝐶)
76	1, 34, 5	lcdlvec 39605	. . 3 ⊢ (𝜑 → 𝐶 ∈ LVec)
77	1, 2, 3, 11, 15, 34, 41, 43, 5, 45, 46, 8, 10, 53, 67, 19, 61, 64, 49	mapdindp 39685	. . 3 ⊢ (𝜑 → ¬ 𝐹 ∈ (𝐿‘{𝐺, 𝐸}))
78	1, 2, 3, 11, 15, 34, 41, 43, 5, 53, 67, 10, 19, 61, 64, 48	mapdncol 39684	. . 3 ⊢ (𝜑 → (𝐿‘{𝐺}) ≠ (𝐿‘{𝐸}))
79	1, 2, 3, 11, 15, 34, 41, 43, 5, 53, 67, 40, 75, 9	mapdn0 39683	. . 3 ⊢ (𝜑 → 𝐺 ∈ (𝐷 ∖ {𝑄}))
80	1, 2, 3, 11, 15, 34, 41, 43, 5, 61, 64, 40, 75, 18	mapdn0 39683	. . 3 ⊢ (𝜑 → 𝐸 ∈ (𝐷 ∖ {𝑄}))
81		hdmap1l6.a	. . 3 ⊢ ✚ = (+_g‘𝐶)
82	41, 42, 75, 35, 43, 76, 45, 77, 78, 79, 80, 81	baerlem5a 39728	. 2 ⊢ (𝜑 → (𝐿‘{(𝐹𝑅(𝐺 ✚ 𝐸))}) = (((𝐿‘{(𝐹𝑅𝐺)})(LSSum‘𝐶)(𝐿‘{𝐸})) ∩ ((𝐿‘{(𝐹𝑅𝐸)})(LSSum‘𝐶)(𝐿‘{𝐺}))))
83	71, 74, 82	3eqtr4d 2788	1 ⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑋 − (𝑌 + 𝑍))})) = (𝐿‘{(𝐹𝑅(𝐺 ✚ 𝐸))}))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ≠ wne 2943 ∖ cdif 3884 ∩ cin 3886 {csn 4561 {cpr 4563 ⟨cotp 4569 ‘cfv 6433 (class class class)co 7275 Basecbs 16912 +_gcplusg 16962 0_gc0g 17150 -_gcsg 18579 LSSumclsm 19239 LModclmod 20123 LSubSpclss 20193 LSpanclspn 20233 HLchlt 37364 LHypclh 37998 DVecHcdvh 39092 LCDualclcd 39600 mapdcmpd 39638 HDMap1chdma1 39805

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 ax-riotaBAD 36967

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-ot 4570 df-uni 4840 df-int 4880 df-iun 4926 df-iin 4927 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-of 7533 df-om 7713 df-1st 7831 df-2nd 7832 df-tpos 8042 df-undef 8089 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-er 8498 df-map 8617 df-en 8734 df-dom 8735 df-sdom 8736 df-fin 8737 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-nn 11974 df-2 12036 df-3 12037 df-4 12038 df-5 12039 df-6 12040 df-n0 12234 df-z 12320 df-uz 12583 df-fz 13240 df-struct 16848 df-sets 16865 df-slot 16883 df-ndx 16895 df-base 16913 df-ress 16942 df-plusg 16975 df-mulr 16976 df-sca 16978 df-vsca 16979 df-0g 17152 df-mre 17295 df-mrc 17296 df-acs 17298 df-proset 18013 df-poset 18031 df-plt 18048 df-lub 18064 df-glb 18065 df-join 18066 df-meet 18067 df-p0 18143 df-p1 18144 df-lat 18150 df-clat 18217 df-mgm 18326 df-sgrp 18375 df-mnd 18386 df-submnd 18431 df-grp 18580 df-minusg 18581 df-sbg 18582 df-subg 18752 df-cntz 18923 df-oppg 18950 df-lsm 19241 df-cmn 19388 df-abl 19389 df-mgp 19721 df-ur 19738 df-ring 19785 df-oppr 19862 df-dvdsr 19883 df-unit 19884 df-invr 19914 df-dvr 19925 df-drng 19993 df-lmod 20125 df-lss 20194 df-lsp 20234 df-lvec 20365 df-lsatoms 36990 df-lshyp 36991 df-lcv 37033 df-lfl 37072 df-lkr 37100 df-ldual 37138 df-oposet 37190 df-ol 37192 df-oml 37193 df-covers 37280 df-ats 37281 df-atl 37312 df-cvlat 37336 df-hlat 37365 df-llines 37512 df-lplanes 37513 df-lvols 37514 df-lines 37515 df-psubsp 37517 df-pmap 37518 df-padd 37810 df-lhyp 38002 df-laut 38003 df-ldil 38118 df-ltrn 38119 df-trl 38173 df-tgrp 38757 df-tendo 38769 df-edring 38771 df-dveca 39017 df-disoa 39043 df-dvech 39093 df-dib 39153 df-dic 39187 df-dih 39243 df-doch 39362 df-djh 39409 df-lcdual 39601 df-mapd 39639 df-hdmap1 39807

This theorem is referenced by: hdmap1l6lem2 39822 hdmap1l6a 39823

W3C validator