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 41159

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 41158	. 2 ⊢ (𝜑 → (𝑀‘𝑇) = {𝑓 ∈ 𝐶 ∣ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇})
12	1, 2, 8	dvhlmod 40639	. . . . . . . . 9 ⊢ (𝜑 → 𝑈 ∈ LMod)
13	12	ad3antrrr 728	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) → 𝑈 ∈ LMod)
14		simplr 767	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) → (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈))
15		eqid 2725	. . . . . . . . 9 ⊢ (Base‘𝑈) = (Base‘𝑈)
16		mapdval2.n	. . . . . . . . 9 ⊢ 𝑁 = (LSpan‘𝑈)
17		eqid 2725	. . . . . . . . 9 ⊢ (LSAtoms‘𝑈) = (LSAtoms‘𝑈)
18	15, 16, 17	islsati 38522	. . . . . . . 8 ⊢ ((𝑈 ∈ LMod ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) → ∃𝑣 ∈ (Base‘𝑈)(𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))
19	13, 14, 18	syl2anc 582	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) → ∃𝑣 ∈ (Base‘𝑈)(𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))
20		simprr 771	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) ∧ (𝑣 ∈ (Base‘𝑈) ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))) → (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))
21		simplr 767	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) ∧ (𝑣 ∈ (Base‘𝑈) ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))) → (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇)
22	20, 21	eqsstrrd 4012	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) ∧ (𝑣 ∈ (Base‘𝑈) ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))) → (𝑁‘{𝑣}) ⊆ 𝑇)
23	12	adantr 479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → 𝑈 ∈ LMod)
24	23	ad3antrrr 728	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) ∧ (𝑣 ∈ (Base‘𝑈) ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))) → 𝑈 ∈ LMod)
25	9	adantr 479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → 𝑇 ∈ 𝑆)
26	25	ad3antrrr 728	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) ∧ (𝑣 ∈ (Base‘𝑈) ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))) → 𝑇 ∈ 𝑆)
27		simprl 769	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) ∧ (𝑣 ∈ (Base‘𝑈) ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))) → 𝑣 ∈ (Base‘𝑈))
28	15, 3, 16, 24, 26, 27	lspsnel5 20883	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) ∧ (𝑣 ∈ (Base‘𝑈) ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))) → (𝑣 ∈ 𝑇 ↔ (𝑁‘{𝑣}) ⊆ 𝑇))
29	22, 28	mpbird 256	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) ∧ (𝑣 ∈ (Base‘𝑈) ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))) → 𝑣 ∈ 𝑇)
30	19, 29, 20	reximssdv 3163	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) ∧ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇) → ∃𝑣 ∈ 𝑇 (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))
31	30	ex 411	. . . . 5 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈)) → ((𝑂‘(𝐿‘𝑓)) ⊆ 𝑇 → ∃𝑣 ∈ 𝑇 (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})))
32		eqid 2725	. . . . . . . . . . 11 ⊢ (0_g‘𝑈) = (0_g‘𝑈)
33	32, 3	lss0cl 20835	. . . . . . . . . 10 ⊢ ((𝑈 ∈ LMod ∧ 𝑇 ∈ 𝑆) → (0_g‘𝑈) ∈ 𝑇)
34	12, 9, 33	syl2anc 582	. . . . . . . . 9 ⊢ (𝜑 → (0_g‘𝑈) ∈ 𝑇)
35	34	adantr 479	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑂‘(𝐿‘𝑓)) = {(0_g‘𝑈)}) → (0_g‘𝑈) ∈ 𝑇)
36		simpr 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑂‘(𝐿‘𝑓)) = {(0_g‘𝑈)}) → (𝑂‘(𝐿‘𝑓)) = {(0_g‘𝑈)})
37	12	adantr 479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑂‘(𝐿‘𝑓)) = {(0_g‘𝑈)}) → 𝑈 ∈ LMod)
38	32, 16	lspsn0 20896	. . . . . . . . . 10 ⊢ (𝑈 ∈ LMod → (𝑁‘{(0_g‘𝑈)}) = {(0_g‘𝑈)})
39	37, 38	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑂‘(𝐿‘𝑓)) = {(0_g‘𝑈)}) → (𝑁‘{(0_g‘𝑈)}) = {(0_g‘𝑈)})
40	36, 39	eqtr4d 2768	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑂‘(𝐿‘𝑓)) = {(0_g‘𝑈)}) → (𝑂‘(𝐿‘𝑓)) = (𝑁‘{(0_g‘𝑈)}))
41		sneq 4634	. . . . . . . . . 10 ⊢ (𝑣 = (0_g‘𝑈) → {𝑣} = {(0_g‘𝑈)})
42	41	fveq2d 6896	. . . . . . . . 9 ⊢ (𝑣 = (0_g‘𝑈) → (𝑁‘{𝑣}) = (𝑁‘{(0_g‘𝑈)}))
43	42	rspceeqv 3623	. . . . . . . 8 ⊢ (((0_g‘𝑈) ∈ 𝑇 ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{(0_g‘𝑈)})) → ∃𝑣 ∈ 𝑇 (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))
44	35, 40, 43	syl2anc 582	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑂‘(𝐿‘𝑓)) = {(0_g‘𝑈)}) → ∃𝑣 ∈ 𝑇 (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))
45	44	adantlr 713	. . . . . 6 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) = {(0_g‘𝑈)}) → ∃𝑣 ∈ 𝑇 (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))
46	45	a1d 25	. . . . 5 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ (𝑂‘(𝐿‘𝑓)) = {(0_g‘𝑈)}) → ((𝑂‘(𝐿‘𝑓)) ⊆ 𝑇 → ∃𝑣 ∈ 𝑇 (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})))
47	8	adantr 479	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
48	10	lcfl1lem 41020	. . . . . . . 8 ⊢ (𝑓 ∈ 𝐶 ↔ (𝑓 ∈ 𝐹 ∧ (𝑂‘(𝑂‘(𝐿‘𝑓))) = (𝐿‘𝑓)))
49	48	simplbi 496	. . . . . . 7 ⊢ (𝑓 ∈ 𝐶 → 𝑓 ∈ 𝐹)
50	49	adantl 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → 𝑓 ∈ 𝐹)
51	1, 6, 2, 32, 17, 4, 5, 47, 50	dochsat0 40986	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → ((𝑂‘(𝐿‘𝑓)) ∈ (LSAtoms‘𝑈) ∨ (𝑂‘(𝐿‘𝑓)) = {(0_g‘𝑈)}))
52	31, 46, 51	mpjaodan 956	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → ((𝑂‘(𝐿‘𝑓)) ⊆ 𝑇 → ∃𝑣 ∈ 𝑇 (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})))
53		simp3 1135	. . . . . 6 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ 𝑣 ∈ 𝑇 ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})) → (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}))
54	23	3ad2ant1 1130	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ 𝑣 ∈ 𝑇 ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})) → 𝑈 ∈ LMod)
55	25	3ad2ant1 1130	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ 𝑣 ∈ 𝑇 ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})) → 𝑇 ∈ 𝑆)
56		simp2 1134	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ 𝑣 ∈ 𝑇 ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})) → 𝑣 ∈ 𝑇)
57	3, 16, 54, 55, 56	lspsnel5a 20884	. . . . . 6 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ 𝑣 ∈ 𝑇 ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})) → (𝑁‘{𝑣}) ⊆ 𝑇)
58	53, 57	eqsstrd 4011	. . . . 5 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐶) ∧ 𝑣 ∈ 𝑇 ∧ (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})) → (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇)
59	58	rexlimdv3a 3149	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → (∃𝑣 ∈ 𝑇 (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣}) → (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇))
60	52, 59	impbid 211	. . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → ((𝑂‘(𝐿‘𝑓)) ⊆ 𝑇 ↔ ∃𝑣 ∈ 𝑇 (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})))
61	60	rabbidva 3426	. 2 ⊢ (𝜑 → {𝑓 ∈ 𝐶 ∣ (𝑂‘(𝐿‘𝑓)) ⊆ 𝑇} = {𝑓 ∈ 𝐶 ∣ ∃𝑣 ∈ 𝑇 (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})})
62	11, 61	eqtrd 2765	1 ⊢ (𝜑 → (𝑀‘𝑇) = {𝑓 ∈ 𝐶 ∣ ∃𝑣 ∈ 𝑇 (𝑂‘(𝐿‘𝑓)) = (𝑁‘{𝑣})})

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 394 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ∃wrex 3060 {crab 3419 ⊆ wss 3939 {csn 4624 ‘cfv 6543 Basecbs 17179 0_gc0g 17420 LModclmod 20747 LSubSpclss 20819 LSpanclspn 20859 LSAtomsclsa 38502 LFnlclfn 38585 LKerclk 38613 HLchlt 38878 LHypclh 39513 DVecHcdvh 40607 ocHcoch 40876 mapdcmpd 41153

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-rep 5280 ax-sep 5294 ax-nul 5301 ax-pow 5359 ax-pr 5423 ax-un 7738 ax-cnex 11194 ax-resscn 11195 ax-1cn 11196 ax-icn 11197 ax-addcl 11198 ax-addrcl 11199 ax-mulcl 11200 ax-mulrcl 11201 ax-mulcom 11202 ax-addass 11203 ax-mulass 11204 ax-distr 11205 ax-i2m1 11206 ax-1ne0 11207 ax-1rid 11208 ax-rnegex 11209 ax-rrecex 11210 ax-cnre 11211 ax-pre-lttri 11212 ax-pre-lttrn 11213 ax-pre-ltadd 11214 ax-pre-mulgt0 11215 ax-riotaBAD 38481

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3769 df-csb 3885 df-dif 3942 df-un 3944 df-in 3946 df-ss 3956 df-pss 3959 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-tp 4629 df-op 4631 df-uni 4904 df-int 4945 df-iun 4993 df-iin 4994 df-br 5144 df-opab 5206 df-mpt 5227 df-tr 5261 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7372 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7869 df-1st 7991 df-2nd 7992 df-tpos 8230 df-undef 8277 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-er 8723 df-map 8845 df-en 8963 df-dom 8964 df-sdom 8965 df-fin 8966 df-pnf 11280 df-mnf 11281 df-xr 11282 df-ltxr 11283 df-le 11284 df-sub 11476 df-neg 11477 df-nn 12243 df-2 12305 df-3 12306 df-4 12307 df-5 12308 df-6 12309 df-n0 12503 df-z 12589 df-uz 12853 df-fz 13517 df-struct 17115 df-sets 17132 df-slot 17150 df-ndx 17162 df-base 17180 df-ress 17209 df-plusg 17245 df-mulr 17246 df-sca 17248 df-vsca 17249 df-0g 17422 df-proset 18286 df-poset 18304 df-plt 18321 df-lub 18337 df-glb 18338 df-join 18339 df-meet 18340 df-p0 18416 df-p1 18417 df-lat 18423 df-clat 18490 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-submnd 18740 df-grp 18897 df-minusg 18898 df-sbg 18899 df-subg 19082 df-cntz 19272 df-lsm 19595 df-cmn 19741 df-abl 19742 df-mgp 20079 df-rng 20097 df-ur 20126 df-ring 20179 df-oppr 20277 df-dvdsr 20300 df-unit 20301 df-invr 20331 df-dvr 20344 df-drng 20630 df-lmod 20749 df-lss 20820 df-lsp 20860 df-lvec 20992 df-lsatoms 38504 df-lshyp 38505 df-lfl 38586 df-lkr 38614 df-oposet 38704 df-ol 38706 df-oml 38707 df-covers 38794 df-ats 38795 df-atl 38826 df-cvlat 38850 df-hlat 38879 df-llines 39027 df-lplanes 39028 df-lvols 39029 df-lines 39030 df-psubsp 39032 df-pmap 39033 df-padd 39325 df-lhyp 39517 df-laut 39518 df-ldil 39633 df-ltrn 39634 df-trl 39688 df-tgrp 40272 df-tendo 40284 df-edring 40286 df-dveca 40532 df-disoa 40558 df-dvech 40608 df-dib 40668 df-dic 40702 df-dih 40758 df-doch 40877 df-djh 40924 df-mapd 41154

This theorem is referenced by: mapdval3N 41160 mapdval4N 41161

W3C validator