mapdval2N - Mathbox for Norm Megill

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

Theorem mapdval2N 40489

Description: Value of projectivity from vector space H to dual space. (Contributed by NM, 31-Jan-2015.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
mapdval2.h	⊢ 𝐻 = (LHyp‘𝐾)
mapdval2.u	⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
mapdval2.s	⊢ 𝑆 = (LSubSp‘𝑈)
mapdval2.n	⊢ 𝑁 = (LSpan‘𝑈)
mapdval2.f	⊢ 𝐹 = (LFnl‘𝑈)
mapdval2.l	⊢ 𝐿 = (LKer‘𝑈)
mapdval2.o	⊢ 𝑂 = ((ocH‘𝐾)‘𝑊)
mapdval2.m	⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
mapdval2.k	⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
mapdval2.t	⊢ (𝜑 → 𝑇 ∈ 𝑆)
mapdval2.c	⊢ 𝐶 = {𝑔 ∈ 𝐹 ∣ (𝑂‘(𝑂‘(𝐿‘𝑔))) = (𝐿‘𝑔)}

**Assertion**
Ref	Expression
mapdval2N	⊢ (𝜑 → (𝑀‘𝑇) = {𝑓 ∈ 𝐶 ∣ ∃𝑣 ∈ 𝑇 (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})})

Distinct variable groups: 𝑣,𝐶 𝑓,𝑔,𝐹 𝑓,𝐾 𝑣,𝑔,𝐿 𝑣,𝑁 𝑔,𝑂,𝑣 𝑣,𝑓,𝑇 𝑣,𝑈 𝑓,𝑊 𝜑,𝑓,𝑣 Allowed substitution hints: 𝜑(𝑔) 𝐶(𝑓,𝑔) 𝑆(𝑣,𝑓,𝑔) 𝑇(𝑔) 𝑈(𝑓,𝑔) 𝐹(𝑣) 𝐻(𝑣,𝑓,𝑔) 𝐾(𝑣,𝑔) 𝐿(𝑓) 𝑀(𝑣,𝑓,𝑔) 𝑁(𝑓,𝑔) 𝑂(𝑓) 𝑊(𝑣,𝑔)

**Proof of Theorem mapdval2N**
Step	Hyp	Ref	Expression
1		mapdval2.h	. . 3 ⊢ 𝐻 = (LHyp‘𝐾)
2		mapdval2.u	. . 3 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
3		mapdval2.s	. . 3 ⊢ 𝑆 = (LSubSp‘𝑈)
4		mapdval2.f	. . 3 ⊢ 𝐹 = (LFnl‘𝑈)
5		mapdval2.l	. . 3 ⊢ 𝐿 = (LKer‘𝑈)
6		mapdval2.o	. . 3 ⊢ 𝑂 = ((ocH‘𝐾)‘𝑊)
7		mapdval2.m	. . 3 ⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
8		mapdval2.k	. . 3 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
9		mapdval2.t	. . 3 ⊢ (𝜑 → 𝑇 ∈ 𝑆)
10		mapdval2.c	. . 3 ⊢ 𝐶 = {𝑔 ∈ 𝐹 ∣ (𝑂‘(𝑂‘(𝐿‘𝑔))) = (𝐿‘𝑔)}
11	1, 2, 3, 4, 5, 6, 7, 8, 9, 10	mapdvalc 40488	. 2 ⊢ (𝜑 → (𝑀‘𝑇) = {𝑓 ∈ 𝐶 ∣ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇})
12	1, 2, 8	dvhlmod 39969	. . . . . . . . 9 ⊢ (𝜑 → 𝑈 ∈ LMod)
13	12	ad3antrrr 728	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) → 𝑈 ∈ LMod)
14		simplr 767	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) → (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈))
15		eqid 2732	. . . . . . . . 9 ⊢ (Base‘𝑈) = (Base‘𝑈)
16		mapdval2.n	. . . . . . . . 9 ⊢ 𝑁 = (LSpan‘𝑈)
17		eqid 2732	. . . . . . . . 9 ⊢ (LSAtoms‘𝑈) = (LSAtoms‘𝑈)
18	15, 16, 17	islsati 37852	. . . . . . . 8 ⊢ ((𝑈 ∈ LMod ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) → ∃𝑣 ∈ (Base‘𝑈)(𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))
19	13, 14, 18	syl2anc 584	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) → ∃𝑣 ∈ (Base‘𝑈)(𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))
20		simprr 771	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) ∧ (𝑣 ∈ (Base‘𝑈) ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))) → (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))
21		simplr 767	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) ∧ (𝑣 ∈ (Base‘𝑈) ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))) → (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇)
22	20, 21	eqsstrrd 4020	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) ∧ (𝑣 ∈ (Base‘𝑈) ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))) → (𝑁‘{𝑣}) ⊆ 𝑇)
23	12	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → 𝑈 ∈ LMod)
24	23	ad3antrrr 728	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) ∧ (𝑣 ∈ (Base‘𝑈) ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))) → 𝑈 ∈ LMod)
25	9	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → 𝑇 ∈ 𝑆)
26	25	ad3antrrr 728	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) ∧ (𝑣 ∈ (Base‘𝑈) ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))) → 𝑇 ∈ 𝑆)
27		simprl 769	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) ∧ (𝑣 ∈ (Base‘𝑈) ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))) → 𝑣 ∈ (Base‘𝑈))
28	15, 3, 16, 24, 26, 27	lspsnel5 20598	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) ∧ (𝑣 ∈ (Base‘𝑈) ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))) → (𝑣 ∈ 𝑇 ↔ (𝑁‘{𝑣}) ⊆ 𝑇))
29	22, 28	mpbird 256	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) ∧ (𝑣 ∈ (Base‘𝑈) ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))) → 𝑣 ∈ 𝑇)
30	19, 29, 20	reximssdv 3172	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) → ∃𝑣 ∈ 𝑇 (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))
31	30	ex 413	. . . . 5 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) → ((𝑂‘(𝐿‘𝑓)) ⊆ 𝑇 → ∃𝑣 ∈ 𝑇 (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})))
32		eqid 2732	. . . . . . . . . . 11 ⊢ (0_g‘𝑈) = (0_g‘𝑈)
33	32, 3	lss0cl 20549	. . . . . . . . . 10 ⊢ ((𝑈 ∈ LMod ∧ 𝑇 ∈ 𝑆) → (0_g‘𝑈) ∈ 𝑇)
34	12, 9, 33	syl2anc 584	. . . . . . . . 9 ⊢ (𝜑 → (0_g‘𝑈) ∈ 𝑇)
35	34	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑂‘(𝐿‘𝑓)) = {(0_g‘𝑈)}) → (0_g‘𝑈) ∈ 𝑇)
36		simpr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑂‘(𝐿‘𝑓)) = {(0_g‘𝑈)}) → (𝑂‘(𝐿‘𝑓)) = {(0_g‘𝑈)})
37	12	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑂‘(𝐿‘𝑓)) = {(0_g‘𝑈)}) → 𝑈 ∈ LMod)
38	32, 16	lspsn0 20611	. . . . . . . . . 10 ⊢ (𝑈 ∈ LMod → (𝑁‘{(0_g‘𝑈)}) = {(0_g‘𝑈)})
39	37, 38	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑂‘(𝐿‘𝑓)) = {(0_g‘𝑈)}) → (𝑁‘{(0_g‘𝑈)}) = {(0_g‘𝑈)})
40	36, 39	eqtr4d 2775	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑂‘(𝐿‘𝑓)) = {(0_g‘𝑈)}) → (𝑂‘(𝐿‘𝑓)) = (𝑁‘{(0_g‘𝑈)}))
41		sneq 4637	. . . . . . . . . 10 ⊢ (𝑣 = (0_g‘𝑈) → {𝑣} = {(0_g‘𝑈)})
42	41	fveq2d 6892	. . . . . . . . 9 ⊢ (𝑣 = (0_g‘𝑈) → (𝑁‘{𝑣}) = (𝑁‘{(0_g‘𝑈)}))
43	42	rspceeqv 3632	. . . . . . . 8 ⊢ (((0_g‘𝑈) ∈ 𝑇 ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{(0_g‘𝑈)})) → ∃𝑣 ∈ 𝑇 (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))
44	35, 40, 43	syl2anc 584	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑂‘(𝐿‘𝑓)) = {(0_g‘𝑈)}) → ∃𝑣 ∈ 𝑇 (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))
45	44	adantlr 713	. . . . . 6 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) = {(0_g‘𝑈)}) → ∃𝑣 ∈ 𝑇 (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))
46	45	a1d 25	. . . . 5 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) = {(0_g‘𝑈)}) → ((𝑂‘(𝐿‘𝑓)) ⊆ 𝑇 → ∃𝑣 ∈ 𝑇 (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})))
47	8	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
48	10	lcfl1lem 40350	. . . . . . . 8 ⊢ (𝑓 ∈ 𝐶 ↔ (𝑓 ∈ 𝐹 ∧ (𝑂‘(𝑂‘(𝐿‘𝑓))) = (𝐿‘𝑓)))
49	48	simplbi 498	. . . . . . 7 ⊢ (𝑓 ∈ 𝐶 → 𝑓 ∈ 𝐹)
50	49	adantl 482	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → 𝑓 ∈ 𝐹)
51	1, 6, 2, 32, 17, 4, 5, 47, 50	dochsat0 40316	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → ((𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈) ∨ (𝑂‘(𝐿‘𝑓)) = {(0_g‘𝑈)}))
52	31, 46, 51	mpjaodan 957	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → ((𝑂‘(𝐿‘𝑓)) ⊆ 𝑇 → ∃𝑣 ∈ 𝑇 (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})))
53		simp3 1138	. . . . . 6 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ 𝑣 ∈ 𝑇 ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})) → (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))
54	23	3ad2ant1 1133	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ 𝑣 ∈ 𝑇 ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})) → 𝑈 ∈ LMod)
55	25	3ad2ant1 1133	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ 𝑣 ∈ 𝑇 ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})) → 𝑇 ∈ 𝑆)
56		simp2 1137	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ 𝑣 ∈ 𝑇 ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})) → 𝑣 ∈ 𝑇)
57	3, 16, 54, 55, 56	lspsnel5a 20599	. . . . . 6 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ 𝑣 ∈ 𝑇 ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})) → (𝑁‘{𝑣}) ⊆ 𝑇)
58	53, 57	eqsstrd 4019	. . . . 5 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ 𝑣 ∈ 𝑇 ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})) → (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇)
59	58	rexlimdv3a 3159	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → (∃𝑣 ∈ 𝑇 (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}) → (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇))
60	52, 59	impbid 211	. . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → ((𝑂‘(𝐿‘𝑓)) ⊆ 𝑇 ↔ ∃𝑣 ∈ 𝑇 (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})))
61	60	rabbidva 3439	. 2 ⊢ (𝜑 → {𝑓 ∈ 𝐶 ∣ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇} = {𝑓 ∈ 𝐶 ∣ ∃𝑣 ∈ 𝑇 (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})})
62	11, 61	eqtrd 2772	1 ⊢ (𝜑 → (𝑀‘𝑇) = {𝑓 ∈ 𝐶 ∣ ∃𝑣 ∈ 𝑇 (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})})

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ∃wrex 3070 {crab 3432 ⊆ wss 3947 {csn 4627 ‘cfv 6540 Basecbs 17140 0_gc0g 17381 LModclmod 20463 LSubSpclss 20534 LSpanclspn 20574 LSAtomsclsa 37832 LFnlclfn 37915 LKerclk 37943 HLchlt 38208 LHypclh 38843 DVecHcdvh 39937 ocHcoch 40206 mapdcmpd 40483

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 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 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-riotaBAD 37811

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-tp 4632 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-iin 4999 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-tpos 8207 df-undef 8254 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8699 df-map 8818 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-nn 12209 df-2 12271 df-3 12272 df-4 12273 df-5 12274 df-6 12275 df-n0 12469 df-z 12555 df-uz 12819 df-fz 13481 df-struct 17076 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17141 df-ress 17170 df-plusg 17206 df-mulr 17207 df-sca 17209 df-vsca 17210 df-0g 17383 df-proset 18244 df-poset 18262 df-plt 18279 df-lub 18295 df-glb 18296 df-join 18297 df-meet 18298 df-p0 18374 df-p1 18375 df-lat 18381 df-clat 18448 df-mgm 18557 df-sgrp 18606 df-mnd 18622 df-submnd 18668 df-grp 18818 df-minusg 18819 df-sbg 18820 df-subg 18997 df-cntz 19175 df-lsm 19498 df-cmn 19644 df-abl 19645 df-mgp 19982 df-ur 19999 df-ring 20051 df-oppr 20142 df-dvdsr 20163 df-unit 20164 df-invr 20194 df-dvr 20207 df-drng 20309 df-lmod 20465 df-lss 20535 df-lsp 20575 df-lvec 20706 df-lsatoms 37834 df-lshyp 37835 df-lfl 37916 df-lkr 37944 df-oposet 38034 df-ol 38036 df-oml 38037 df-covers 38124 df-ats 38125 df-atl 38156 df-cvlat 38180 df-hlat 38209 df-llines 38357 df-lplanes 38358 df-lvols 38359 df-lines 38360 df-psubsp 38362 df-pmap 38363 df-padd 38655 df-lhyp 38847 df-laut 38848 df-ldil 38963 df-ltrn 38964 df-trl 39018 df-tgrp 39602 df-tendo 39614 df-edring 39616 df-dveca 39862 df-disoa 39888 df-dvech 39938 df-dib 39998 df-dic 40032 df-dih 40088 df-doch 40207 df-djh 40254 df-mapd 40484

This theorem is referenced by: mapdval3N 40490 mapdval4N 40491

W3C validator