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 25269

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))
dchrmulid2.t	⊢ · = (+_g‘𝐺)
dchrmulid2.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		dchrmulid2.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐷)
7		dchrmhm.b	. . . . . 6 ⊢ 𝐷 = (Base‘𝐺)
8	2, 7	dchrrcl 25256	. . . . 5 ⊢ (𝑋 ∈ 𝐷 → 𝑁 ∈ ℕ)
9	6, 8	syl 17	. . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ)
10		fveq2 6375	. . . . 5 ⊢ (𝑘 = 𝑥 → (𝑋‘𝑘) = (𝑋‘𝑥))
11	10	oveq2d 6858	. . . 4 ⊢ (𝑘 = 𝑥 → (1 / (𝑋‘𝑘)) = (1 / (𝑋‘𝑥)))
12		fveq2 6375	. . . . 5 ⊢ (𝑘 = 𝑦 → (𝑋‘𝑘) = (𝑋‘𝑦))
13	12	oveq2d 6858	. . . 4 ⊢ (𝑘 = 𝑦 → (1 / (𝑋‘𝑘)) = (1 / (𝑋‘𝑦)))
14		fveq2 6375	. . . . 5 ⊢ (𝑘 = (𝑥(._r‘𝑍)𝑦) → (𝑋‘𝑘) = (𝑋‘(𝑥(._r‘𝑍)𝑦)))
15	14	oveq2d 6858	. . . 4 ⊢ (𝑘 = (𝑥(._r‘𝑍)𝑦) → (1 / (𝑋‘𝑘)) = (1 / (𝑋‘(𝑥(._r‘𝑍)𝑦))))
16		fveq2 6375	. . . . 5 ⊢ (𝑘 = (1_r‘𝑍) → (𝑋‘𝑘) = (𝑋‘(1_r‘𝑍)))
17	16	oveq2d 6858	. . . 4 ⊢ (𝑘 = (1_r‘𝑍) → (1 / (𝑋‘𝑘)) = (1 / (𝑋‘(1_r‘𝑍))))
18	2, 3, 7, 4, 6	dchrf 25258	. . . . . 6 ⊢ (𝜑 → 𝑋:𝐵⟶ℂ)
19	4, 5	unitss 18927	. . . . . . 7 ⊢ 𝑈 ⊆ 𝐵
20	19	sseli 3757	. . . . . 6 ⊢ (𝑘 ∈ 𝑈 → 𝑘 ∈ 𝐵)
21		ffvelrn 6547	. . . . . 6 ⊢ ((𝑋:𝐵⟶ℂ ∧ 𝑘 ∈ 𝐵) → (𝑋‘𝑘) ∈ ℂ)
22	18, 20, 21	syl2an 589	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → (𝑋‘𝑘) ∈ ℂ)
23		simpr 477	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝑘 ∈ 𝑈)
24	6	adantr 472	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝑋 ∈ 𝐷)
25	20	adantl 473	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝑘 ∈ 𝐵)
26	2, 3, 7, 4, 5, 24, 25	dchrn0 25266	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → ((𝑋‘𝑘) ≠ 0 ↔ 𝑘 ∈ 𝑈))
27	23, 26	mpbird 248	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → (𝑋‘𝑘) ≠ 0)
28	22, 27	reccld 11048	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → (1 / (𝑋‘𝑘)) ∈ ℂ)
29		1t1e1 11440	. . . . . . . 8 ⊢ (1 · 1) = 1
30	29	eqcomi 2774	. . . . . . 7 ⊢ 1 = (1 · 1)
31	30	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 1 = (1 · 1))
32	2, 3, 7	dchrmhm 25257	. . . . . . . 8 ⊢ 𝐷 ⊆ ((mulGrp‘𝑍) MndHom (mulGrp‘ℂ_fld))
33	6	adantr 472	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 𝑋 ∈ 𝐷)
34	32, 33	sseldi 3759	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 𝑋 ∈ ((mulGrp‘𝑍) MndHom (mulGrp‘ℂ_fld)))
35		simprl 787	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 𝑥 ∈ 𝑈)
36	19, 35	sseldi 3759	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 𝑥 ∈ 𝐵)
37		simprr 789	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 𝑦 ∈ 𝑈)
38	19, 37	sseldi 3759	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 𝑦 ∈ 𝐵)
39		eqid 2765	. . . . . . . . 9 ⊢ (mulGrp‘𝑍) = (mulGrp‘𝑍)
40	39, 4	mgpbas 18762	. . . . . . . 8 ⊢ 𝐵 = (Base‘(mulGrp‘𝑍))
41		eqid 2765	. . . . . . . . 9 ⊢ (._r‘𝑍) = (._r‘𝑍)
42	39, 41	mgpplusg 18760	. . . . . . . 8 ⊢ (._r‘𝑍) = (+_g‘(mulGrp‘𝑍))
43		eqid 2765	. . . . . . . . 9 ⊢ (mulGrp‘ℂ_fld) = (mulGrp‘ℂ_fld)
44		cnfldmul 20025	. . . . . . . . 9 ⊢ · = (._r‘ℂ_fld)
45	43, 44	mgpplusg 18760	. . . . . . . 8 ⊢ · = (+_g‘(mulGrp‘ℂ_fld))
46	40, 42, 45	mhmlin 17608	. . . . . . 7 ⊢ ((𝑋 ∈ ((mulGrp‘𝑍) MndHom (mulGrp‘ℂ_fld)) ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑋‘(𝑥(._r‘𝑍)𝑦)) = ((𝑋‘𝑥) · (𝑋‘𝑦)))
47	34, 36, 38, 46	syl3anc 1490	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → (𝑋‘(𝑥(._r‘𝑍)𝑦)) = ((𝑋‘𝑥) · (𝑋‘𝑦)))
48	31, 47	oveq12d 6860	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → (1 / (𝑋‘(𝑥(._r‘𝑍)𝑦))) = ((1 · 1) / ((𝑋‘𝑥) · (𝑋‘𝑦))))
49		1cnd 10288	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 1 ∈ ℂ)
50	18	adantr 472	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 𝑋:𝐵⟶ℂ)
51	50, 36	ffvelrnd 6550	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → (𝑋‘𝑥) ∈ ℂ)
52	50, 38	ffvelrnd 6550	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → (𝑋‘𝑦) ∈ ℂ)
53	2, 3, 7, 4, 5, 33, 36	dchrn0 25266	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → ((𝑋‘𝑥) ≠ 0 ↔ 𝑥 ∈ 𝑈))
54	35, 53	mpbird 248	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → (𝑋‘𝑥) ≠ 0)
55	2, 3, 7, 4, 5, 33, 38	dchrn0 25266	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → ((𝑋‘𝑦) ≠ 0 ↔ 𝑦 ∈ 𝑈))
56	37, 55	mpbird 248	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → (𝑋‘𝑦) ≠ 0)
57	49, 51, 49, 52, 54, 56	divmuldivd 11096	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → ((1 / (𝑋‘𝑥)) · (1 / (𝑋‘𝑦))) = ((1 · 1) / ((𝑋‘𝑥) · (𝑋‘𝑦))))
58	48, 57	eqtr4d 2802	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → (1 / (𝑋‘(𝑥(._r‘𝑍)𝑦))) = ((1 / (𝑋‘𝑥)) · (1 / (𝑋‘𝑦))))
59	32, 6	sseldi 3759	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ ((mulGrp‘𝑍) MndHom (mulGrp‘ℂ_fld)))
60		eqid 2765	. . . . . . . . 9 ⊢ (1_r‘𝑍) = (1_r‘𝑍)
61	39, 60	ringidval 18770	. . . . . . . 8 ⊢ (1_r‘𝑍) = (0_g‘(mulGrp‘𝑍))
62		cnfld1 20044	. . . . . . . . 9 ⊢ 1 = (1_r‘ℂ_fld)
63	43, 62	ringidval 18770	. . . . . . . 8 ⊢ 1 = (0_g‘(mulGrp‘ℂ_fld))
64	61, 63	mhm0 17609	. . . . . . 7 ⊢ (𝑋 ∈ ((mulGrp‘𝑍) MndHom (mulGrp‘ℂ_fld)) → (𝑋‘(1_r‘𝑍)) = 1)
65	59, 64	syl 17	. . . . . 6 ⊢ (𝜑 → (𝑋‘(1_r‘𝑍)) = 1)
66	65	oveq2d 6858	. . . . 5 ⊢ (𝜑 → (1 / (𝑋‘(1_r‘𝑍))) = (1 / 1))
67		1div1e1 10971	. . . . 5 ⊢ (1 / 1) = 1
68	66, 67	syl6eq 2815	. . . 4 ⊢ (𝜑 → (1 / (𝑋‘(1_r‘𝑍))) = 1)
69	2, 3, 4, 5, 9, 7, 11, 13, 15, 17, 28, 58, 68	dchrelbasd 25255	. . 3 ⊢ (𝜑 → (𝑘 ∈ 𝐵 ↦ if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0)) ∈ 𝐷)
70	1, 69	syl5eqel 2848	. 2 ⊢ (𝜑 → 𝐾 ∈ 𝐷)
71		dchrmulid2.t	. . . 4 ⊢ · = (+_g‘𝐺)
72	2, 3, 7, 71, 70, 6	dchrmul 25264	. . 3 ⊢ (𝜑 → (𝐾 · 𝑋) = (𝐾 ∘_𝑓 · 𝑋))
73	4	fvexi 6389	. . . . . 6 ⊢ 𝐵 ∈ V
74	73	a1i 11	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ V)
75		ovex 6874	. . . . . . 7 ⊢ (1 / (𝑋‘𝑘)) ∈ V
76		c0ex 10287	. . . . . . 7 ⊢ 0 ∈ V
77	75, 76	ifex 4291	. . . . . 6 ⊢ if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0) ∈ V
78	77	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0) ∈ V)
79	18	ffvelrnda 6549	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑋‘𝑘) ∈ ℂ)
80	1	a1i 11	. . . . 5 ⊢ (𝜑 → 𝐾 = (𝑘 ∈ 𝐵 ↦ if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0)))
81	18	feqmptd 6438	. . . . 5 ⊢ (𝜑 → 𝑋 = (𝑘 ∈ 𝐵 ↦ (𝑋‘𝑘)))
82	74, 78, 79, 80, 81	offval2 7112	. . . 4 ⊢ (𝜑 → (𝐾 ∘_𝑓 · 𝑋) = (𝑘 ∈ 𝐵 ↦ (if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0) · (𝑋‘𝑘))))
83		ovif 6935	. . . . . . 7 ⊢ (if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0) · (𝑋‘𝑘)) = if(𝑘 ∈ 𝑈, ((1 / (𝑋‘𝑘)) · (𝑋‘𝑘)), (0 · (𝑋‘𝑘)))
84	79	adantr 472	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐵) ∧ 𝑘 ∈ 𝑈) → (𝑋‘𝑘) ∈ ℂ)
85	6	adantr 472	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝑋 ∈ 𝐷)
86		simpr 477	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝑘 ∈ 𝐵)
87	2, 3, 7, 4, 5, 85, 86	dchrn0 25266	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → ((𝑋‘𝑘) ≠ 0 ↔ 𝑘 ∈ 𝑈))
88	87	biimpar 469	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐵) ∧ 𝑘 ∈ 𝑈) → (𝑋‘𝑘) ≠ 0)
89	84, 88	recid2d 11051	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐵) ∧ 𝑘 ∈ 𝑈) → ((1 / (𝑋‘𝑘)) · (𝑋‘𝑘)) = 1)
90	89	ifeq1da 4273	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → if(𝑘 ∈ 𝑈, ((1 / (𝑋‘𝑘)) · (𝑋‘𝑘)), (0 · (𝑋‘𝑘))) = if(𝑘 ∈ 𝑈, 1, (0 · (𝑋‘𝑘))))
91	79	mul02d 10488	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (0 · (𝑋‘𝑘)) = 0)
92	91	ifeq2d 4262	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → if(𝑘 ∈ 𝑈, 1, (0 · (𝑋‘𝑘))) = if(𝑘 ∈ 𝑈, 1, 0))
93	90, 92	eqtrd 2799	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → if(𝑘 ∈ 𝑈, ((1 / (𝑋‘𝑘)) · (𝑋‘𝑘)), (0 · (𝑋‘𝑘))) = if(𝑘 ∈ 𝑈, 1, 0))
94	83, 93	syl5eq 2811	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0) · (𝑋‘𝑘)) = if(𝑘 ∈ 𝑈, 1, 0))
95	94	mpteq2dva 4903	. . . . 5 ⊢ (𝜑 → (𝑘 ∈ 𝐵 ↦ (if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0) · (𝑋‘𝑘))) = (𝑘 ∈ 𝐵 ↦ if(𝑘 ∈ 𝑈, 1, 0)))
96		dchr1cl.o	. . . . 5 ⊢ 1 = (𝑘 ∈ 𝐵 ↦ if(𝑘 ∈ 𝑈, 1, 0))
97	95, 96	syl6reqr 2818	. . . 4 ⊢ (𝜑 → 1 = (𝑘 ∈ 𝐵 ↦ (if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0) · (𝑋‘𝑘))))
98	82, 97	eqtr4d 2802	. . 3 ⊢ (𝜑 → (𝐾 ∘_𝑓 · 𝑋) = 1 )
99	72, 98	eqtrd 2799	. 2 ⊢ (𝜑 → (𝐾 · 𝑋) = 1 )
100	70, 99	jca 507	1 ⊢ (𝜑 → (𝐾 ∈ 𝐷 ∧ (𝐾 · 𝑋) = 1 ))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 384 = wceq 1652 ∈ wcel 2155 ≠ wne 2937 Vcvv 3350 ifcif 4243 ↦ cmpt 4888 ⟶wf 6064 ‘cfv 6068 (class class class)co 6842 ∘_𝑓 cof 7093 ℂcc 10187 0cc0 10189 1c1 10190 · cmul 10194 / cdiv 10938 ℕcn 11274 Basecbs 16130 +_gcplusg 16214 ._rcmulr 16215 MndHom cmhm 17599 mulGrpcmgp 18756 1_rcur 18768 Unitcui 18906 ℂ_fldccnfld 20019 ℤ/nℤczn 20124 DChrcdchr 25248

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1890 ax-4 1904 ax-5 2005 ax-6 2070 ax-7 2105 ax-8 2157 ax-9 2164 ax-10 2183 ax-11 2198 ax-12 2211 ax-13 2352 ax-ext 2743 ax-rep 4930 ax-sep 4941 ax-nul 4949 ax-pow 5001 ax-pr 5062 ax-un 7147 ax-cnex 10245 ax-resscn 10246 ax-1cn 10247 ax-icn 10248 ax-addcl 10249 ax-addrcl 10250 ax-mulcl 10251 ax-mulrcl 10252 ax-mulcom 10253 ax-addass 10254 ax-mulass 10255 ax-distr 10256 ax-i2m1 10257 ax-1ne0 10258 ax-1rid 10259 ax-rnegex 10260 ax-rrecex 10261 ax-cnre 10262 ax-pre-lttri 10263 ax-pre-lttrn 10264 ax-pre-ltadd 10265 ax-pre-mulgt0 10266 ax-addf 10268 ax-mulf 10269

This theorem depends on definitions: df-bi 198 df-an 385 df-or 874 df-3or 1108 df-3an 1109 df-tru 1656 df-ex 1875 df-nf 1879 df-sb 2063 df-mo 2565 df-eu 2582 df-clab 2752 df-cleq 2758 df-clel 2761 df-nfc 2896 df-ne 2938 df-nel 3041 df-ral 3060 df-rex 3061 df-reu 3062 df-rmo 3063 df-rab 3064 df-v 3352 df-sbc 3597 df-csb 3692 df-dif 3735 df-un 3737 df-in 3739 df-ss 3746 df-pss 3748 df-nul 4080 df-if 4244 df-pw 4317 df-sn 4335 df-pr 4337 df-tp 4339 df-op 4341 df-uni 4595 df-int 4634 df-iun 4678 df-br 4810 df-opab 4872 df-mpt 4889 df-tr 4912 df-id 5185 df-eprel 5190 df-po 5198 df-so 5199 df-fr 5236 df-we 5238 df-xp 5283 df-rel 5284 df-cnv 5285 df-co 5286 df-dm 5287 df-rn 5288 df-res 5289 df-ima 5290 df-pred 5865 df-ord 5911 df-on 5912 df-lim 5913 df-suc 5914 df-iota 6031 df-fun 6070 df-fn 6071 df-f 6072 df-f1 6073 df-fo 6074 df-f1o 6075 df-fv 6076 df-riota 6803 df-ov 6845 df-oprab 6846 df-mpt2 6847 df-of 7095 df-om 7264 df-1st 7366 df-2nd 7367 df-tpos 7555 df-wrecs 7610 df-recs 7672 df-rdg 7710 df-1o 7764 df-oadd 7768 df-er 7947 df-ec 7949 df-qs 7953 df-map 8062 df-en 8161 df-dom 8162 df-sdom 8163 df-fin 8164 df-sup 8555 df-inf 8556 df-pnf 10330 df-mnf 10331 df-xr 10332 df-ltxr 10333 df-le 10334 df-sub 10522 df-neg 10523 df-div 10939 df-nn 11275 df-2 11335 df-3 11336 df-4 11337 df-5 11338 df-6 11339 df-7 11340 df-8 11341 df-9 11342 df-n0 11539 df-z 11625 df-dec 11741 df-uz 11887 df-fz 12534 df-struct 16132 df-ndx 16133 df-slot 16134 df-base 16136 df-sets 16137 df-ress 16138 df-plusg 16227 df-mulr 16228 df-starv 16229 df-sca 16230 df-vsca 16231 df-ip 16232 df-tset 16233 df-ple 16234 df-ds 16236 df-unif 16237 df-0g 16368 df-imas 16434 df-qus 16435 df-mgm 17508 df-sgrp 17550 df-mnd 17561 df-mhm 17601 df-grp 17692 df-minusg 17693 df-sbg 17694 df-subg 17855 df-nsg 17856 df-eqg 17857 df-cmn 18461 df-abl 18462 df-mgp 18757 df-ur 18769 df-ring 18816 df-cring 18817 df-oppr 18890 df-dvdsr 18908 df-unit 18909 df-invr 18939 df-subrg 19047 df-lmod 19134 df-lss 19202 df-lsp 19244 df-sra 19446 df-rgmod 19447 df-lidl 19448 df-rsp 19449 df-2idl 19506 df-cnfld 20020 df-zring 20092 df-zn 20128 df-dchr 25249

This theorem is referenced by: dchrabl 25270

W3C validator