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 25837

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 25824	. . . . 5 ⊢ (𝑋 ∈ 𝐷 → 𝑁 ∈ ℕ)
9	6, 8	syl 17	. . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ)
10		fveq2 6645	. . . . 5 ⊢ (𝑘 = 𝑥 → (𝑋‘𝑘) = (𝑋‘𝑥))
11	10	oveq2d 7151	. . . 4 ⊢ (𝑘 = 𝑥 → (1 / (𝑋‘𝑘)) = (1 / (𝑋‘𝑥)))
12		fveq2 6645	. . . . 5 ⊢ (𝑘 = 𝑦 → (𝑋‘𝑘) = (𝑋‘𝑦))
13	12	oveq2d 7151	. . . 4 ⊢ (𝑘 = 𝑦 → (1 / (𝑋‘𝑘)) = (1 / (𝑋‘𝑦)))
14		fveq2 6645	. . . . 5 ⊢ (𝑘 = (𝑥(._r‘𝑍)𝑦) → (𝑋‘𝑘) = (𝑋‘(𝑥(._r‘𝑍)𝑦)))
15	14	oveq2d 7151	. . . 4 ⊢ (𝑘 = (𝑥(._r‘𝑍)𝑦) → (1 / (𝑋‘𝑘)) = (1 / (𝑋‘(𝑥(._r‘𝑍)𝑦))))
16		fveq2 6645	. . . . 5 ⊢ (𝑘 = (1_r‘𝑍) → (𝑋‘𝑘) = (𝑋‘(1_r‘𝑍)))
17	16	oveq2d 7151	. . . 4 ⊢ (𝑘 = (1_r‘𝑍) → (1 / (𝑋‘𝑘)) = (1 / (𝑋‘(1_r‘𝑍))))
18	2, 3, 7, 4, 6	dchrf 25826	. . . . . 6 ⊢ (𝜑 → 𝑋:𝐵⟶ℂ)
19	4, 5	unitss 19406	. . . . . . 7 ⊢ 𝑈 ⊆ 𝐵
20	19	sseli 3911	. . . . . 6 ⊢ (𝑘 ∈ 𝑈 → 𝑘 ∈ 𝐵)
21		ffvelrn 6826	. . . . . 6 ⊢ ((𝑋:𝐵⟶ℂ ∧ 𝑘 ∈ 𝐵) → (𝑋‘𝑘) ∈ ℂ)
22	18, 20, 21	syl2an 598	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → (𝑋‘𝑘) ∈ ℂ)
23		simpr 488	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝑘 ∈ 𝑈)
24	6	adantr 484	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝑋 ∈ 𝐷)
25	20	adantl 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝑘 ∈ 𝐵)
26	2, 3, 7, 4, 5, 24, 25	dchrn0 25834	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → ((𝑋‘𝑘) ≠ 0 ↔ 𝑘 ∈ 𝑈))
27	23, 26	mpbird 260	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → (𝑋‘𝑘) ≠ 0)
28	22, 27	reccld 11398	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → (1 / (𝑋‘𝑘)) ∈ ℂ)
29		1t1e1 11787	. . . . . . . 8 ⊢ (1 · 1) = 1
30	29	eqcomi 2807	. . . . . . 7 ⊢ 1 = (1 · 1)
31	30	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 1 = (1 · 1))
32	2, 3, 7	dchrmhm 25825	. . . . . . . 8 ⊢ 𝐷 ⊆ ((mulGrp‘𝑍) MndHom (mulGrp‘ℂ_fld))
33	6	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 𝑋 ∈ 𝐷)
34	32, 33	sseldi 3913	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 𝑋 ∈ ((mulGrp‘𝑍) MndHom (mulGrp‘ℂ_fld)))
35		simprl 770	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 𝑥 ∈ 𝑈)
36	19, 35	sseldi 3913	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 𝑥 ∈ 𝐵)
37		simprr 772	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 𝑦 ∈ 𝑈)
38	19, 37	sseldi 3913	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 𝑦 ∈ 𝐵)
39		eqid 2798	. . . . . . . . 9 ⊢ (mulGrp‘𝑍) = (mulGrp‘𝑍)
40	39, 4	mgpbas 19238	. . . . . . . 8 ⊢ 𝐵 = (Base‘(mulGrp‘𝑍))
41		eqid 2798	. . . . . . . . 9 ⊢ (._r‘𝑍) = (._r‘𝑍)
42	39, 41	mgpplusg 19236	. . . . . . . 8 ⊢ (._r‘𝑍) = (+_g‘(mulGrp‘𝑍))
43		eqid 2798	. . . . . . . . 9 ⊢ (mulGrp‘ℂ_fld) = (mulGrp‘ℂ_fld)
44		cnfldmul 20097	. . . . . . . . 9 ⊢ · = (._r‘ℂ_fld)
45	43, 44	mgpplusg 19236	. . . . . . . 8 ⊢ · = (+_g‘(mulGrp‘ℂ_fld))
46	40, 42, 45	mhmlin 17955	. . . . . . 7 ⊢ ((𝑋 ∈ ((mulGrp‘𝑍) MndHom (mulGrp‘ℂ_fld)) ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑋‘(𝑥(._r‘𝑍)𝑦)) = ((𝑋‘𝑥) · (𝑋‘𝑦)))
47	34, 36, 38, 46	syl3anc 1368	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → (𝑋‘(𝑥(._r‘𝑍)𝑦)) = ((𝑋‘𝑥) · (𝑋‘𝑦)))
48	31, 47	oveq12d 7153	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → (1 / (𝑋‘(𝑥(._r‘𝑍)𝑦))) = ((1 · 1) / ((𝑋‘𝑥) · (𝑋‘𝑦))))
49		1cnd 10625	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 1 ∈ ℂ)
50	18	adantr 484	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → 𝑋:𝐵⟶ℂ)
51	50, 36	ffvelrnd 6829	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → (𝑋‘𝑥) ∈ ℂ)
52	50, 38	ffvelrnd 6829	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → (𝑋‘𝑦) ∈ ℂ)
53	2, 3, 7, 4, 5, 33, 36	dchrn0 25834	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → ((𝑋‘𝑥) ≠ 0 ↔ 𝑥 ∈ 𝑈))
54	35, 53	mpbird 260	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → (𝑋‘𝑥) ≠ 0)
55	2, 3, 7, 4, 5, 33, 38	dchrn0 25834	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → ((𝑋‘𝑦) ≠ 0 ↔ 𝑦 ∈ 𝑈))
56	37, 55	mpbird 260	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → (𝑋‘𝑦) ≠ 0)
57	49, 51, 49, 52, 54, 56	divmuldivd 11446	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → ((1 / (𝑋‘𝑥)) · (1 / (𝑋‘𝑦))) = ((1 · 1) / ((𝑋‘𝑥) · (𝑋‘𝑦))))
58	48, 57	eqtr4d 2836	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑈)) → (1 / (𝑋‘(𝑥(._r‘𝑍)𝑦))) = ((1 / (𝑋‘𝑥)) · (1 / (𝑋‘𝑦))))
59	32, 6	sseldi 3913	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ ((mulGrp‘𝑍) MndHom (mulGrp‘ℂ_fld)))
60		eqid 2798	. . . . . . . . 9 ⊢ (1_r‘𝑍) = (1_r‘𝑍)
61	39, 60	ringidval 19246	. . . . . . . 8 ⊢ (1_r‘𝑍) = (0_g‘(mulGrp‘𝑍))
62		cnfld1 20116	. . . . . . . . 9 ⊢ 1 = (1_r‘ℂ_fld)
63	43, 62	ringidval 19246	. . . . . . . 8 ⊢ 1 = (0_g‘(mulGrp‘ℂ_fld))
64	61, 63	mhm0 17956	. . . . . . 7 ⊢ (𝑋 ∈ ((mulGrp‘𝑍) MndHom (mulGrp‘ℂ_fld)) → (𝑋‘(1_r‘𝑍)) = 1)
65	59, 64	syl 17	. . . . . 6 ⊢ (𝜑 → (𝑋‘(1_r‘𝑍)) = 1)
66	65	oveq2d 7151	. . . . 5 ⊢ (𝜑 → (1 / (𝑋‘(1_r‘𝑍))) = (1 / 1))
67		1div1e1 11319	. . . . 5 ⊢ (1 / 1) = 1
68	66, 67	eqtrdi 2849	. . . 4 ⊢ (𝜑 → (1 / (𝑋‘(1_r‘𝑍))) = 1)
69	2, 3, 4, 5, 9, 7, 11, 13, 15, 17, 28, 58, 68	dchrelbasd 25823	. . 3 ⊢ (𝜑 → (𝑘 ∈ 𝐵 ↦ if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0)) ∈ 𝐷)
70	1, 69	eqeltrid 2894	. 2 ⊢ (𝜑 → 𝐾 ∈ 𝐷)
71		dchrmulid2.t	. . . 4 ⊢ · = (+_g‘𝐺)
72	2, 3, 7, 71, 70, 6	dchrmul 25832	. . 3 ⊢ (𝜑 → (𝐾 · 𝑋) = (𝐾 ∘_f · 𝑋))
73	4	fvexi 6659	. . . . . 6 ⊢ 𝐵 ∈ V
74	73	a1i 11	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ V)
75		ovex 7168	. . . . . . 7 ⊢ (1 / (𝑋‘𝑘)) ∈ V
76		c0ex 10624	. . . . . . 7 ⊢ 0 ∈ V
77	75, 76	ifex 4473	. . . . . 6 ⊢ if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0) ∈ V
78	77	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0) ∈ V)
79	18	ffvelrnda 6828	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑋‘𝑘) ∈ ℂ)
80	1	a1i 11	. . . . 5 ⊢ (𝜑 → 𝐾 = (𝑘 ∈ 𝐵 ↦ if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0)))
81	18	feqmptd 6708	. . . . 5 ⊢ (𝜑 → 𝑋 = (𝑘 ∈ 𝐵 ↦ (𝑋‘𝑘)))
82	74, 78, 79, 80, 81	offval2 7406	. . . 4 ⊢ (𝜑 → (𝐾 ∘_f · 𝑋) = (𝑘 ∈ 𝐵 ↦ (if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0) · (𝑋‘𝑘))))
83		dchr1cl.o	. . . . 5 ⊢ 1 = (𝑘 ∈ 𝐵 ↦ if(𝑘 ∈ 𝑈, 1, 0))
84		ovif 7230	. . . . . . 7 ⊢ (if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0) · (𝑋‘𝑘)) = if(𝑘 ∈ 𝑈, ((1 / (𝑋‘𝑘)) · (𝑋‘𝑘)), (0 · (𝑋‘𝑘)))
85	79	adantr 484	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐵) ∧ 𝑘 ∈ 𝑈) → (𝑋‘𝑘) ∈ ℂ)
86	6	adantr 484	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝑋 ∈ 𝐷)
87		simpr 488	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝑘 ∈ 𝐵)
88	2, 3, 7, 4, 5, 86, 87	dchrn0 25834	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → ((𝑋‘𝑘) ≠ 0 ↔ 𝑘 ∈ 𝑈))
89	88	biimpar 481	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐵) ∧ 𝑘 ∈ 𝑈) → (𝑋‘𝑘) ≠ 0)
90	85, 89	recid2d 11401	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐵) ∧ 𝑘 ∈ 𝑈) → ((1 / (𝑋‘𝑘)) · (𝑋‘𝑘)) = 1)
91	90	ifeq1da 4455	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → if(𝑘 ∈ 𝑈, ((1 / (𝑋‘𝑘)) · (𝑋‘𝑘)), (0 · (𝑋‘𝑘))) = if(𝑘 ∈ 𝑈, 1, (0 · (𝑋‘𝑘))))
92	79	mul02d 10827	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (0 · (𝑋‘𝑘)) = 0)
93	92	ifeq2d 4444	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → if(𝑘 ∈ 𝑈, 1, (0 · (𝑋‘𝑘))) = if(𝑘 ∈ 𝑈, 1, 0))
94	91, 93	eqtrd 2833	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → if(𝑘 ∈ 𝑈, ((1 / (𝑋‘𝑘)) · (𝑋‘𝑘)), (0 · (𝑋‘𝑘))) = if(𝑘 ∈ 𝑈, 1, 0))
95	84, 94	syl5eq 2845	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0) · (𝑋‘𝑘)) = if(𝑘 ∈ 𝑈, 1, 0))
96	95	mpteq2dva 5125	. . . . 5 ⊢ (𝜑 → (𝑘 ∈ 𝐵 ↦ (if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0) · (𝑋‘𝑘))) = (𝑘 ∈ 𝐵 ↦ if(𝑘 ∈ 𝑈, 1, 0)))
97	83, 96	eqtr4id 2852	. . . 4 ⊢ (𝜑 → 1 = (𝑘 ∈ 𝐵 ↦ (if(𝑘 ∈ 𝑈, (1 / (𝑋‘𝑘)), 0) · (𝑋‘𝑘))))
98	82, 97	eqtr4d 2836	. . 3 ⊢ (𝜑 → (𝐾 ∘_f · 𝑋) = 1 )
99	72, 98	eqtrd 2833	. 2 ⊢ (𝜑 → (𝐾 · 𝑋) = 1 )
100	70, 99	jca 515	1 ⊢ (𝜑 → (𝐾 ∈ 𝐷 ∧ (𝐾 · 𝑋) = 1 ))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 Vcvv 3441 ifcif 4425 ↦ cmpt 5110 ⟶wf 6320 ‘cfv 6324 (class class class)co 7135 ∘_f cof 7387 ℂcc 10524 0cc0 10526 1c1 10527 · cmul 10531 / cdiv 11286 ℕcn 11625 Basecbs 16475 +_gcplusg 16557 ._rcmulr 16558 MndHom cmhm 17946 mulGrpcmgp 19232 1_rcur 19244 Unitcui 19385 ℂ_fldccnfld 20091 ℤ/nℤczn 20196 DChrcdchr 25816

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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-addf 10605 ax-mulf 10606

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-of 7389 df-om 7561 df-1st 7671 df-2nd 7672 df-tpos 7875 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-ec 8274 df-qs 8278 df-map 8391 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-sup 8890 df-inf 8891 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 df-nn 11626 df-2 11688 df-3 11689 df-4 11690 df-5 11691 df-6 11692 df-7 11693 df-8 11694 df-9 11695 df-n0 11886 df-z 11970 df-dec 12087 df-uz 12232 df-fz 12886 df-struct 16477 df-ndx 16478 df-slot 16479 df-base 16481 df-sets 16482 df-ress 16483 df-plusg 16570 df-mulr 16571 df-starv 16572 df-sca 16573 df-vsca 16574 df-ip 16575 df-tset 16576 df-ple 16577 df-ds 16579 df-unif 16580 df-0g 16707 df-imas 16773 df-qus 16774 df-mgm 17844 df-sgrp 17893 df-mnd 17904 df-mhm 17948 df-grp 18098 df-minusg 18099 df-sbg 18100 df-subg 18268 df-nsg 18269 df-eqg 18270 df-cmn 18900 df-abl 18901 df-mgp 19233 df-ur 19245 df-ring 19292 df-cring 19293 df-oppr 19369 df-dvdsr 19387 df-unit 19388 df-invr 19418 df-subrg 19526 df-lmod 19629 df-lss 19697 df-lsp 19737 df-sra 19937 df-rgmod 19938 df-lidl 19939 df-rsp 19940 df-2idl 19998 df-cnfld 20092 df-zring 20164 df-zn 20200 df-dchr 25817

This theorem is referenced by: dchrabl 25838

W3C validator