dchrinvcl - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > dchrinvcl		Structured version Visualization version GIF version

Theorem dchrinvcl 27221

Description: Closure of the group inverse operation on Dirichlet characters. (Contributed by Mario Carneiro, 19-Apr-2016.)

**Hypotheses**
Ref	Expression
dchrmhm.g	⊢ 𝐺 = (DChr‘𝑁)
dchrmhm.z	⊢ 𝑍 = (ℤ/nℤ‘𝑁)
dchrmhm.b	⊢ 𝐷 = (Base‘𝐺)
dchrn0.b	⊢ 𝐵 = (Base‘𝑍)
dchrn0.u	⊢ 𝑈 = (Unit‘𝑍)
dchr1cl.o	⊢ 1 = (𝑘 ∈ 𝐵 ↦ if(𝑘 ∈ 𝑈, 1, 0))
dchrmullid.t	⊢ · = (+_g‘𝐺)
dchrmullid.x	⊢ (𝜑 → 𝑋 ∈ 𝐷)
dchrinvcl.n	⊢ 𝐾 = (𝑘 ∈ 𝐵 ↦ if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0))

**Assertion**
Ref	Expression
dchrinvcl	⊢ (𝜑 → (𝐾 ∈ 𝐷 ∧ (𝐾 · 𝑋) = 1 ))

Distinct variable groups: 𝐵,𝑘 𝑈,𝑘 𝑘,𝑁 𝜑,𝑘 𝑘,𝑋 𝑘,𝑍 Allowed substitution hints: 𝐷(𝑘) · (𝑘) 1 (𝑘) 𝐺(𝑘) 𝐾(𝑘)

Proof of Theorem dchrinvcl Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dchrinvcl.n	. . 3 ⊢ 𝐾 = (𝑘 ∈ 𝐵 ↦ if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0))
2		dchrmhm.g	. . . 4 ⊢ 𝐺 = (DChr‘𝑁)
3		dchrmhm.z	. . . 4 ⊢ 𝑍 = (ℤ/nℤ‘𝑁)
4		dchrn0.b	. . . 4 ⊢ 𝐵 = (Base‘𝑍)
5		dchrn0.u	. . . 4 ⊢ 𝑈 = (Unit‘𝑍)
6		dchrmullid.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐷)
7		dchrmhm.b	. . . . . 6 ⊢ 𝐷 = (Base‘𝐺)
8	2, 7	dchrrcl 27208	. . . . 5 ⊢ (𝑋 ∈ 𝐷 → 𝑁 ∈ ℕ)
9	6, 8	syl 17	. . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ)
10		fveq2 6881	. . . . 5 ⊢ (𝑘 = 𝑥 → (𝑋‘𝑘) = (𝑋‘𝑥))
11	10	oveq2d 7426	. . . 4 ⊢ (𝑘 = 𝑥 → (1 / (𝑋‘𝑘)) = (1 / (𝑋‘𝑥)))
12		fveq2 6881	. . . . 5 ⊢ (𝑘 = 𝑦 → (𝑋‘𝑘) = (𝑋‘𝑦))
13	12	oveq2d 7426	. . . 4 ⊢ (𝑘 = 𝑦 → (1 / (𝑋‘𝑘)) = (1 / (𝑋‘𝑦)))
14		fveq2 6881	. . . . 5 ⊢ (𝑘 = (𝑥(._r‘𝑍)𝑦) → (𝑋‘𝑘) = (𝑋‘(𝑥(._r‘𝑍)𝑦)))
15	14	oveq2d 7426	. . . 4 ⊢ (𝑘 = (𝑥(._r‘𝑍)𝑦) → (1 / (𝑋‘𝑘)) = (1 / (𝑋‘(𝑥(._r‘𝑍)𝑦))))
16		fveq2 6881	. . . . 5 ⊢ (𝑘 = (1_r‘𝑍) → (𝑋‘𝑘) = (𝑋‘(1_r‘𝑍)))
17	16	oveq2d 7426	. . . 4 ⊢ (𝑘 = (1_r‘𝑍) → (1 / (𝑋‘𝑘)) = (1 / (𝑋‘(1_r‘𝑍))))
18	2, 3, 7, 4, 6	dchrf 27210	. . . . . 6 ⊢ (𝜑 → 𝑋:𝐵⟶ℂ)
19	4, 5	unitss 20341	. . . . . . 7 ⊢ 𝑈 ⊆ 𝐵
20	19	sseli 3959	. . . . . 6 ⊢ (𝑘 ∈ 𝑈 → 𝑘 ∈ 𝐵)
21		ffvelcdm 7076	. . . . . 6 ⊢ ((𝑋:𝐵⟶ℂ ∧ 𝑘 ∈ 𝐵) → (𝑋‘𝑘) ∈ ℂ)
22	18, 20, 21	syl2an 596	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → (𝑋‘𝑘) ∈ ℂ)
23		simpr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝑘 ∈ 𝑈)
24	6	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝑋 ∈ 𝐷)
25	20	adantl 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝑘 ∈ 𝐵)
26	2, 3, 7, 4, 5, 24, 25	dchrn0 27218	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → ((𝑋‘𝑘) ≠ 0 ↔ 𝑘 ∈ 𝑈))
27	23, 26	mpbird 257	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → (𝑋‘𝑘) ≠ 0)
28	22, 27	reccld 12015	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → (1 / (𝑋‘𝑘)) ∈ ℂ)
29		1t1e1 12407	. . . . . . . 8 ⊢ (1 · 1) = 1
30	29	eqcomi 2745	. . . . . . 7 ⊢ 1 = (1 · 1)
31	30	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 1 = (1 · 1))
32	2, 3, 7	dchrmhm 27209	. . . . . . . 8 ⊢ 𝐷 ⊆ ((mulGrp‘𝑍) MndHom (mulGrp‘ℂ_fld))
33	6	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 𝑋 ∈ 𝐷)
34	32, 33	sselid 3961	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 𝑋 ∈ ((mulGrp‘𝑍) MndHom (mulGrp‘ℂ_fld)))
35		simprl 770	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 𝑥 ∈ 𝑈)
36	19, 35	sselid 3961	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 𝑥 ∈ 𝐵)
37		simprr 772	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 𝑦 ∈ 𝑈)
38	19, 37	sselid 3961	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 𝑦 ∈ 𝐵)
39		eqid 2736	. . . . . . . . 9 ⊢ (mulGrp‘𝑍) = (mulGrp‘𝑍)
40	39, 4	mgpbas 20110	. . . . . . . 8 ⊢ 𝐵 = (Base‘(mulGrp‘𝑍))
41		eqid 2736	. . . . . . . . 9 ⊢ (._r‘𝑍) = (._r‘𝑍)
42	39, 41	mgpplusg 20109	. . . . . . . 8 ⊢ (._r‘𝑍) = (+_g‘(mulGrp‘𝑍))
43		eqid 2736	. . . . . . . . 9 ⊢ (mulGrp‘ℂ_fld) = (mulGrp‘ℂ_fld)
44		cnfldmul 21328	. . . . . . . . 9 ⊢ · = (._r‘ℂ_fld)
45	43, 44	mgpplusg 20109	. . . . . . . 8 ⊢ · = (+_g‘(mulGrp‘ℂ_fld))
46	40, 42, 45	mhmlin 18776	. . . . . . 7 ⊢ ((𝑋 ∈ ((mulGrp‘𝑍) MndHom (mulGrp‘ℂ_fld)) ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑋‘(𝑥(._r‘𝑍)𝑦)) = ((𝑋‘𝑥) · (𝑋‘𝑦)))
47	34, 36, 38, 46	syl3anc 1373	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → (𝑋‘(𝑥(._r‘𝑍)𝑦)) = ((𝑋‘𝑥) · (𝑋‘𝑦)))
48	31, 47	oveq12d 7428	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → (1 / (𝑋‘(𝑥(._r‘𝑍)𝑦))) = ((1 · 1) / ((𝑋‘𝑥) · (𝑋‘𝑦))))
49		1cnd 11235	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 1 ∈ ℂ)
50	18	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 𝑋:𝐵⟶ℂ)
51	50, 36	ffvelcdmd 7080	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → (𝑋‘𝑥) ∈ ℂ)
52	50, 38	ffvelcdmd 7080	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → (𝑋‘𝑦) ∈ ℂ)
53	2, 3, 7, 4, 5, 33, 36	dchrn0 27218	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → ((𝑋‘𝑥) ≠ 0 ↔ 𝑥 ∈ 𝑈))
54	35, 53	mpbird 257	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → (𝑋‘𝑥) ≠ 0)
55	2, 3, 7, 4, 5, 33, 38	dchrn0 27218	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → ((𝑋‘𝑦) ≠ 0 ↔ 𝑦 ∈ 𝑈))
56	37, 55	mpbird 257	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → (𝑋‘𝑦) ≠ 0)
57	49, 51, 49, 52, 54, 56	divmuldivd 12063	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → ((1 / (𝑋‘𝑥)) · (1 / (𝑋‘𝑦))) = ((1 · 1) / ((𝑋‘𝑥) · (𝑋‘𝑦))))
58	48, 57	eqtr4d 2774	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → (1 / (𝑋‘(𝑥(._r‘𝑍)𝑦))) = ((1 / (𝑋‘𝑥)) · (1 / (𝑋‘𝑦))))
59	32, 6	sselid 3961	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ ((mulGrp‘𝑍) MndHom (mulGrp‘ℂ_fld)))
60		eqid 2736	. . . . . . . . 9 ⊢ (1_r‘𝑍) = (1_r‘𝑍)
61	39, 60	ringidval 20148	. . . . . . . 8 ⊢ (1_r‘𝑍) = (0_g‘(mulGrp‘𝑍))
62		cnfld1 21361	. . . . . . . . 9 ⊢ 1 = (1_r‘ℂ_fld)
63	43, 62	ringidval 20148	. . . . . . . 8 ⊢ 1 = (0_g‘(mulGrp‘ℂ_fld))
64	61, 63	mhm0 18777	. . . . . . 7 ⊢ (𝑋 ∈ ((mulGrp‘𝑍) MndHom (mulGrp‘ℂ_fld)) → (𝑋‘(1_r‘𝑍)) = 1)
65	59, 64	syl 17	. . . . . 6 ⊢ (𝜑 → (𝑋‘(1_r‘𝑍)) = 1)
66	65	oveq2d 7426	. . . . 5 ⊢ (𝜑 → (1 / (𝑋‘(1_r‘𝑍))) = (1 / 1))
67		1div1e1 11937	. . . . 5 ⊢ (1 / 1) = 1
68	66, 67	eqtrdi 2787	. . . 4 ⊢ (𝜑 → (1 / (𝑋‘(1_r‘𝑍))) = 1)
69	2, 3, 4, 5, 9, 7, 11, 13, 15, 17, 28, 58, 68	dchrelbasd 27207	. . 3 ⊢ (𝜑 → (𝑘 ∈ 𝐵 ↦ if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0)) ∈ 𝐷)
70	1, 69	eqeltrid 2839	. 2 ⊢ (𝜑 → 𝐾 ∈ 𝐷)
71		dchrmullid.t	. . . 4 ⊢ · = (+_g‘𝐺)
72	2, 3, 7, 71, 70, 6	dchrmul 27216	. . 3 ⊢ (𝜑 → (𝐾 · 𝑋) = (𝐾 ∘_f · 𝑋))
73	4	fvexi 6895	. . . . . 6 ⊢ 𝐵 ∈ V
74	73	a1i 11	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ V)
75		ovex 7443	. . . . . . 7 ⊢ (1 / (𝑋‘𝑘)) ∈ V
76		c0ex 11234	. . . . . . 7 ⊢ 0 ∈ V
77	75, 76	ifex 4556	. . . . . 6 ⊢ if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0) ∈ V
78	77	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0) ∈ V)
79	18	ffvelcdmda 7079	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑋‘𝑘) ∈ ℂ)
80	1	a1i 11	. . . . 5 ⊢ (𝜑 → 𝐾 = (𝑘 ∈ 𝐵 ↦ if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0)))
81	18	feqmptd 6952	. . . . 5 ⊢ (𝜑 → 𝑋 = (𝑘 ∈ 𝐵 ↦ (𝑋‘𝑘)))
82	74, 78, 79, 80, 81	offval2 7696	. . . 4 ⊢ (𝜑 → (𝐾 ∘_f · 𝑋) = (𝑘 ∈ 𝐵 ↦ (if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0) · (𝑋‘𝑘))))
83		dchr1cl.o	. . . . 5 ⊢ 1 = (𝑘 ∈ 𝐵 ↦ if(𝑘 ∈ 𝑈, 1, 0))
84		ovif 7510	. . . . . . 7 ⊢ (if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0) · (𝑋‘𝑘)) = if(𝑘 ∈ 𝑈, ((1 / (𝑋‘𝑘)) · (𝑋‘𝑘)), (0 · (𝑋‘𝑘)))
85	79	adantr 480	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐵) ∧ 𝑘 ∈ 𝑈) → (𝑋‘𝑘) ∈ ℂ)
86	6	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝑋 ∈ 𝐷)
87		simpr 484	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝑘 ∈ 𝐵)
88	2, 3, 7, 4, 5, 86, 87	dchrn0 27218	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → ((𝑋‘𝑘) ≠ 0 ↔ 𝑘 ∈ 𝑈))
89	88	biimpar 477	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐵) ∧ 𝑘 ∈ 𝑈) → (𝑋‘𝑘) ≠ 0)
90	85, 89	recid2d 12018	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐵) ∧ 𝑘 ∈ 𝑈) → ((1 / (𝑋‘𝑘)) · (𝑋‘𝑘)) = 1)
91	90	ifeq1da 4537	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → if(𝑘 ∈ 𝑈, ((1 / (𝑋‘𝑘)) · (𝑋‘𝑘)), (0 · (𝑋‘𝑘))) = if(𝑘 ∈ 𝑈, 1, (0 · (𝑋‘𝑘))))
92	79	mul02d 11438	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (0 · (𝑋‘𝑘)) = 0)
93	92	ifeq2d 4526	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → if(𝑘 ∈ 𝑈, 1, (0 · (𝑋‘𝑘))) = if(𝑘 ∈ 𝑈, 1, 0))
94	91, 93	eqtrd 2771	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → if(𝑘 ∈ 𝑈, ((1 / (𝑋‘𝑘)) · (𝑋‘𝑘)), (0 · (𝑋‘𝑘))) = if(𝑘 ∈ 𝑈, 1, 0))
95	84, 94	eqtrid 2783	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0) · (𝑋‘𝑘)) = if(𝑘 ∈ 𝑈, 1, 0))
96	95	mpteq2dva 5219	. . . . 5 ⊢ (𝜑 → (𝑘 ∈ 𝐵 ↦ (if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0) · (𝑋‘𝑘))) = (𝑘 ∈ 𝐵 ↦ if(𝑘 ∈ 𝑈, 1, 0)))
97	83, 96	eqtr4id 2790	. . . 4 ⊢ (𝜑 → 1 = (𝑘 ∈ 𝐵 ↦ (if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0) · (𝑋‘𝑘))))
98	82, 97	eqtr4d 2774	. . 3 ⊢ (𝜑 → (𝐾 ∘_f · 𝑋) = 1 )
99	72, 98	eqtrd 2771	. 2 ⊢ (𝜑 → (𝐾 · 𝑋) = 1 )
100	70, 99	jca 511	1 ⊢ (𝜑 → (𝐾 ∈ 𝐷 ∧ (𝐾 · 𝑋) = 1 ))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2933 Vcvv 3464 ifcif 4505 ↦ cmpt 5206 ⟶wf 6532 ‘cfv 6536 (class class class)co 7410 ∘_f cof 7674 ℂcc 11132 0cc0 11134 1c1 11135 · cmul 11139 / cdiv 11899 ℕcn 12245 Basecbs 17233 +_gcplusg 17276 ._rcmulr 17277 MndHom cmhm 18764 mulGrpcmgp 20105 1_rcur 20146 Unitcui 20320 ℂ_fldccnfld 21320 ℤ/nℤczn 21468 DChrcdchr 27200

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-rep 5254 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 ax-cnex 11190 ax-resscn 11191 ax-1cn 11192 ax-icn 11193 ax-addcl 11194 ax-addrcl 11195 ax-mulcl 11196 ax-mulrcl 11197 ax-mulcom 11198 ax-addass 11199 ax-mulass 11200 ax-distr 11201 ax-i2m1 11202 ax-1ne0 11203 ax-1rid 11204 ax-rnegex 11205 ax-rrecex 11206 ax-cnre 11207 ax-pre-lttri 11208 ax-pre-lttrn 11209 ax-pre-ltadd 11210 ax-pre-mulgt0 11211 ax-addf 11213 ax-mulf 11214

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rmo 3364 df-reu 3365 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-tp 4611 df-op 4613 df-uni 4889 df-int 4928 df-iun 4974 df-br 5125 df-opab 5187 df-mpt 5207 df-tr 5235 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 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 6295 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-of 7676 df-om 7867 df-1st 7993 df-2nd 7994 df-tpos 8230 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-er 8724 df-ec 8726 df-qs 8730 df-map 8847 df-en 8965 df-dom 8966 df-sdom 8967 df-fin 8968 df-sup 9459 df-inf 9460 df-pnf 11276 df-mnf 11277 df-xr 11278 df-ltxr 11279 df-le 11280 df-sub 11473 df-neg 11474 df-div 11900 df-nn 12246 df-2 12308 df-3 12309 df-4 12310 df-5 12311 df-6 12312 df-7 12313 df-8 12314 df-9 12315 df-n0 12507 df-z 12594 df-dec 12714 df-uz 12858 df-fz 13530 df-struct 17171 df-sets 17188 df-slot 17206 df-ndx 17218 df-base 17234 df-ress 17257 df-plusg 17289 df-mulr 17290 df-starv 17291 df-sca 17292 df-vsca 17293 df-ip 17294 df-tset 17295 df-ple 17296 df-ds 17298 df-unif 17299 df-0g 17460 df-imas 17527 df-qus 17528 df-mgm 18623 df-sgrp 18702 df-mnd 18718 df-mhm 18766 df-grp 18924 df-minusg 18925 df-sbg 18926 df-subg 19111 df-nsg 19112 df-eqg 19113 df-cmn 19768 df-abl 19769 df-mgp 20106 df-rng 20118 df-ur 20147 df-ring 20200 df-cring 20201 df-oppr 20302 df-dvdsr 20322 df-unit 20323 df-invr 20353 df-subrng 20511 df-subrg 20535 df-lmod 20824 df-lss 20894 df-lsp 20934 df-sra 21136 df-rgmod 21137 df-lidl 21174 df-rsp 21175 df-2idl 21216 df-cnfld 21321 df-zring 21413 df-zn 21472 df-dchr 27201

This theorem is referenced by: dchrabl 27222

W3C validator