Theorem zrrnghm 41917

Description: The constant mapping to zero is a nonunital ring homomorphism from the zero ring to any nonunital ring. (Contributed by AV, 17-Apr-2020.)

Hypotheses

Ref	Expression
zrrhm.b	⊢ 𝐵 = (Base‘𝑇)
zrrhm.0	⊢ 0 = (0g‘𝑆)
zrrhm.h	⊢ 𝐻 = (𝑥 ∈ 𝐵 ↦ 0 )

Assertion

Ref	Expression
zrrnghm	⊢ ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝐻 ∈ (𝑇 RngHomo 𝑆))

Distinct variable groups:   𝑥,𝐵   𝑥,𝑆   𝑥,𝑇   𝑥, 0

Allowed substitution hint:   𝐻(𝑥)

Proof of Theorem zrrnghm

Dummy variables 𝑎 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eldifi 3732	. . . . 5 ⊢ (𝑇 ∈ (Ring ∖ NzRing) → 𝑇 ∈ Ring)
2		ringrng 41879	. . . . 5 ⊢ (𝑇 ∈ Ring → 𝑇 ∈ Rng)
3	1, 2	syl 17	. . . 4 ⊢ (𝑇 ∈ (Ring ∖ NzRing) → 𝑇 ∈ Rng)
4	3	anim1i 592	. . 3 ⊢ ((𝑇 ∈ (Ring ∖ NzRing) ∧ 𝑆 ∈ Rng) → (𝑇 ∈ Rng ∧ 𝑆 ∈ Rng))
5	4	ancoms 469	. 2 ⊢ ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → (𝑇 ∈ Rng ∧ 𝑆 ∈ Rng))
6		rngabl 41877	. . . . . 6 ⊢ (𝑆 ∈ Rng → 𝑆 ∈ Abel)
7		ablgrp 18198	. . . . . 6 ⊢ (𝑆 ∈ Abel → 𝑆 ∈ Grp)
8	6, 7	syl 17	. . . . 5 ⊢ (𝑆 ∈ Rng → 𝑆 ∈ Grp)
9	8	adantr 481	. . . 4 ⊢ ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝑆 ∈ Grp)
10		ringgrp 18552	. . . . . 6 ⊢ (𝑇 ∈ Ring → 𝑇 ∈ Grp)
11	1, 10	syl 17	. . . . 5 ⊢ (𝑇 ∈ (Ring ∖ NzRing) → 𝑇 ∈ Grp)
12	11	adantl 482	. . . 4 ⊢ ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝑇 ∈ Grp)
13		zrrhm.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑇)
14		eqid 2622	. . . . . 6 ⊢ (0g‘𝑇) = (0g‘𝑇)
15	13, 14	0ringbas 41871	. . . . 5 ⊢ (𝑇 ∈ (Ring ∖ NzRing) → 𝐵 = {(0g‘𝑇)})
16	15	adantl 482	. . . 4 ⊢ ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝐵 = {(0g‘𝑇)})
17		zrrhm.0	. . . . 5 ⊢ 0 = (0g‘𝑆)
18		zrrhm.h	. . . . 5 ⊢ 𝐻 = (𝑥 ∈ 𝐵 ↦ 0 )
19	13, 17, 18, 14	c0snghm 41916	. . . 4 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp ∧ 𝐵 = {(0g‘𝑇)}) → 𝐻 ∈ (𝑇 GrpHom 𝑆))
20	9, 12, 16, 19	syl3anc 1326	. . 3 ⊢ ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝐻 ∈ (𝑇 GrpHom 𝑆))
21	18	a1i 11	. . . . . . . 8 ⊢ (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g‘𝑇)}) → 𝐻 = (𝑥 ∈ 𝐵 ↦ 0 ))
22		eqidd 2623	. . . . . . . 8 ⊢ ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g‘𝑇)}) ∧ 𝑥 = (0g‘𝑇)) → 0 = 0 )
23	13, 14	ring0cl 18569	. . . . . . . . . 10 ⊢ (𝑇 ∈ Ring → (0g‘𝑇) ∈ 𝐵)
24	1, 23	syl 17	. . . . . . . . 9 ⊢ (𝑇 ∈ (Ring ∖ NzRing) → (0g‘𝑇) ∈ 𝐵)
25	24	ad2antlr 763	. . . . . . . 8 ⊢ (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g‘𝑇)}) → (0g‘𝑇) ∈ 𝐵)
26		fvex 6201	. . . . . . . . . 10 ⊢ (0g‘𝑆) ∈ V
27	17, 26	eqeltri 2697	. . . . . . . . 9 ⊢ 0 ∈ V
28	27	a1i 11	. . . . . . . 8 ⊢ (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g‘𝑇)}) → 0 ∈ V)
29	21, 22, 25, 28	fvmptd 6288	. . . . . . 7 ⊢ (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g‘𝑇)}) → (𝐻‘(0g‘𝑇)) = 0 )
30		eqid 2622	. . . . . . . . . . . . . 14 ⊢ (Base‘𝑆) = (Base‘𝑆)
31	30, 17	grpidcl 17450	. . . . . . . . . . . . 13 ⊢ (𝑆 ∈ Grp → 0 ∈ (Base‘𝑆))
32	8, 31	syl 17	. . . . . . . . . . . 12 ⊢ (𝑆 ∈ Rng → 0 ∈ (Base‘𝑆))
33		eqid 2622	. . . . . . . . . . . . 13 ⊢ (.r‘𝑆) = (.r‘𝑆)
34	30, 33, 17	rnglz 41884	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ Rng ∧ 0 ∈ (Base‘𝑆)) → ( 0 (.r‘𝑆) 0 ) = 0 )
35	32, 34	mpdan 702	. . . . . . . . . . 11 ⊢ (𝑆 ∈ Rng → ( 0 (.r‘𝑆) 0 ) = 0 )
36	35	adantr 481	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → ( 0 (.r‘𝑆) 0 ) = 0 )
37	36	adantr 481	. . . . . . . . 9 ⊢ (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g‘𝑇)}) → ( 0 (.r‘𝑆) 0 ) = 0 )
38	37	adantr 481	. . . . . . . 8 ⊢ ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g‘𝑇)}) ∧ (𝐻‘(0g‘𝑇)) = 0 ) → ( 0 (.r‘𝑆) 0 ) = 0 )
39		simpr 477	. . . . . . . . 9 ⊢ ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g‘𝑇)}) ∧ (𝐻‘(0g‘𝑇)) = 0 ) → (𝐻‘(0g‘𝑇)) = 0 )
40	39, 39	oveq12d 6668	. . . . . . . 8 ⊢ ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g‘𝑇)}) ∧ (𝐻‘(0g‘𝑇)) = 0 ) → ((𝐻‘(0g‘𝑇))(.r‘𝑆)(𝐻‘(0g‘𝑇))) = ( 0 (.r‘𝑆) 0 ))
41		eqid 2622	. . . . . . . . . . . . . . 15 ⊢ (.r‘𝑇) = (.r‘𝑇)
42	13, 41, 14	ringlz 18587	. . . . . . . . . . . . . 14 ⊢ ((𝑇 ∈ Ring ∧ (0g‘𝑇) ∈ 𝐵) → ((0g‘𝑇)(.r‘𝑇)(0g‘𝑇)) = (0g‘𝑇))
43	23, 42	mpdan 702	. . . . . . . . . . . . 13 ⊢ (𝑇 ∈ Ring → ((0g‘𝑇)(.r‘𝑇)(0g‘𝑇)) = (0g‘𝑇))
44	1, 43	syl 17	. . . . . . . . . . . 12 ⊢ (𝑇 ∈ (Ring ∖ NzRing) → ((0g‘𝑇)(.r‘𝑇)(0g‘𝑇)) = (0g‘𝑇))
45	44	ad2antlr 763	. . . . . . . . . . 11 ⊢ (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g‘𝑇)}) → ((0g‘𝑇)(.r‘𝑇)(0g‘𝑇)) = (0g‘𝑇))
46	45	adantr 481	. . . . . . . . . 10 ⊢ ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g‘𝑇)}) ∧ (𝐻‘(0g‘𝑇)) = 0 ) → ((0g‘𝑇)(.r‘𝑇)(0g‘𝑇)) = (0g‘𝑇))
47	46	fveq2d 6195	. . . . . . . . 9 ⊢ ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g‘𝑇)}) ∧ (𝐻‘(0g‘𝑇)) = 0 ) → (𝐻‘((0g‘𝑇)(.r‘𝑇)(0g‘𝑇))) = (𝐻‘(0g‘𝑇)))
48	47, 39	eqtrd 2656	. . . . . . . 8 ⊢ ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g‘𝑇)}) ∧ (𝐻‘(0g‘𝑇)) = 0 ) → (𝐻‘((0g‘𝑇)(.r‘𝑇)(0g‘𝑇))) = 0 )
49	38, 40, 48	3eqtr4rd 2667	. . . . . . 7 ⊢ ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g‘𝑇)}) ∧ (𝐻‘(0g‘𝑇)) = 0 ) → (𝐻‘((0g‘𝑇)(.r‘𝑇)(0g‘𝑇))) = ((𝐻‘(0g‘𝑇))(.r‘𝑆)(𝐻‘(0g‘𝑇))))
50	29, 49	mpdan 702	. . . . . 6 ⊢ (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g‘𝑇)}) → (𝐻‘((0g‘𝑇)(.r‘𝑇)(0g‘𝑇))) = ((𝐻‘(0g‘𝑇))(.r‘𝑆)(𝐻‘(0g‘𝑇))))
51	23, 23	jca 554	. . . . . . . . 9 ⊢ (𝑇 ∈ Ring → ((0g‘𝑇) ∈ 𝐵 ∧ (0g‘𝑇) ∈ 𝐵))
52	1, 51	syl 17	. . . . . . . 8 ⊢ (𝑇 ∈ (Ring ∖ NzRing) → ((0g‘𝑇) ∈ 𝐵 ∧ (0g‘𝑇) ∈ 𝐵))
53	52	ad2antlr 763	. . . . . . 7 ⊢ (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g‘𝑇)}) → ((0g‘𝑇) ∈ 𝐵 ∧ (0g‘𝑇) ∈ 𝐵))
54		oveq1 6657	. . . . . . . . . 10 ⊢ (𝑎 = (0g‘𝑇) → (𝑎(.r‘𝑇)𝑐) = ((0g‘𝑇)(.r‘𝑇)𝑐))
55	54	fveq2d 6195	. . . . . . . . 9 ⊢ (𝑎 = (0g‘𝑇) → (𝐻‘(𝑎(.r‘𝑇)𝑐)) = (𝐻‘((0g‘𝑇)(.r‘𝑇)𝑐)))
56		fveq2 6191	. . . . . . . . . 10 ⊢ (𝑎 = (0g‘𝑇) → (𝐻‘𝑎) = (𝐻‘(0g‘𝑇)))
57	56	oveq1d 6665	. . . . . . . . 9 ⊢ (𝑎 = (0g‘𝑇) → ((𝐻‘𝑎)(.r‘𝑆)(𝐻‘𝑐)) = ((𝐻‘(0g‘𝑇))(.r‘𝑆)(𝐻‘𝑐)))
58	55, 57	eqeq12d 2637	. . . . . . . 8 ⊢ (𝑎 = (0g‘𝑇) → ((𝐻‘(𝑎(.r‘𝑇)𝑐)) = ((𝐻‘𝑎)(.r‘𝑆)(𝐻‘𝑐)) ↔ (𝐻‘((0g‘𝑇)(.r‘𝑇)𝑐)) = ((𝐻‘(0g‘𝑇))(.r‘𝑆)(𝐻‘𝑐))))
59		oveq2 6658	. . . . . . . . . 10 ⊢ (𝑐 = (0g‘𝑇) → ((0g‘𝑇)(.r‘𝑇)𝑐) = ((0g‘𝑇)(.r‘𝑇)(0g‘𝑇)))
60	59	fveq2d 6195	. . . . . . . . 9 ⊢ (𝑐 = (0g‘𝑇) → (𝐻‘((0g‘𝑇)(.r‘𝑇)𝑐)) = (𝐻‘((0g‘𝑇)(.r‘𝑇)(0g‘𝑇))))
61		fveq2 6191	. . . . . . . . . 10 ⊢ (𝑐 = (0g‘𝑇) → (𝐻‘𝑐) = (𝐻‘(0g‘𝑇)))
62	61	oveq2d 6666	. . . . . . . . 9 ⊢ (𝑐 = (0g‘𝑇) → ((𝐻‘(0g‘𝑇))(.r‘𝑆)(𝐻‘𝑐)) = ((𝐻‘(0g‘𝑇))(.r‘𝑆)(𝐻‘(0g‘𝑇))))
63	60, 62	eqeq12d 2637	. . . . . . . 8 ⊢ (𝑐 = (0g‘𝑇) → ((𝐻‘((0g‘𝑇)(.r‘𝑇)𝑐)) = ((𝐻‘(0g‘𝑇))(.r‘𝑆)(𝐻‘𝑐)) ↔ (𝐻‘((0g‘𝑇)(.r‘𝑇)(0g‘𝑇))) = ((𝐻‘(0g‘𝑇))(.r‘𝑆)(𝐻‘(0g‘𝑇)))))
64	58, 63	2ralsng 4220	. . . . . . 7 ⊢ (((0g‘𝑇) ∈ 𝐵 ∧ (0g‘𝑇) ∈ 𝐵) → (∀𝑎 ∈ {(0g‘𝑇)}∀𝑐 ∈ {(0g‘𝑇)} (𝐻‘(𝑎(.r‘𝑇)𝑐)) = ((𝐻‘𝑎)(.r‘𝑆)(𝐻‘𝑐)) ↔ (𝐻‘((0g‘𝑇)(.r‘𝑇)(0g‘𝑇))) = ((𝐻‘(0g‘𝑇))(.r‘𝑆)(𝐻‘(0g‘𝑇)))))
65	53, 64	syl 17	. . . . . 6 ⊢ (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g‘𝑇)}) → (∀𝑎 ∈ {(0g‘𝑇)}∀𝑐 ∈ {(0g‘𝑇)} (𝐻‘(𝑎(.r‘𝑇)𝑐)) = ((𝐻‘𝑎)(.r‘𝑆)(𝐻‘𝑐)) ↔ (𝐻‘((0g‘𝑇)(.r‘𝑇)(0g‘𝑇))) = ((𝐻‘(0g‘𝑇))(.r‘𝑆)(𝐻‘(0g‘𝑇)))))
66	50, 65	mpbird 247	. . . . 5 ⊢ (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g‘𝑇)}) → ∀𝑎 ∈ {(0g‘𝑇)}∀𝑐 ∈ {(0g‘𝑇)} (𝐻‘(𝑎(.r‘𝑇)𝑐)) = ((𝐻‘𝑎)(.r‘𝑆)(𝐻‘𝑐)))
67		raleq 3138	. . . . . . 7 ⊢ (𝐵 = {(0g‘𝑇)} → (∀𝑐 ∈ 𝐵 (𝐻‘(𝑎(.r‘𝑇)𝑐)) = ((𝐻‘𝑎)(.r‘𝑆)(𝐻‘𝑐)) ↔ ∀𝑐 ∈ {(0g‘𝑇)} (𝐻‘(𝑎(.r‘𝑇)𝑐)) = ((𝐻‘𝑎)(.r‘𝑆)(𝐻‘𝑐))))
68	67	raleqbi1dv 3146	. . . . . 6 ⊢ (𝐵 = {(0g‘𝑇)} → (∀𝑎 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝐻‘(𝑎(.r‘𝑇)𝑐)) = ((𝐻‘𝑎)(.r‘𝑆)(𝐻‘𝑐)) ↔ ∀𝑎 ∈ {(0g‘𝑇)}∀𝑐 ∈ {(0g‘𝑇)} (𝐻‘(𝑎(.r‘𝑇)𝑐)) = ((𝐻‘𝑎)(.r‘𝑆)(𝐻‘𝑐))))
69	68	adantl 482	. . . . 5 ⊢ (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g‘𝑇)}) → (∀𝑎 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝐻‘(𝑎(.r‘𝑇)𝑐)) = ((𝐻‘𝑎)(.r‘𝑆)(𝐻‘𝑐)) ↔ ∀𝑎 ∈ {(0g‘𝑇)}∀𝑐 ∈ {(0g‘𝑇)} (𝐻‘(𝑎(.r‘𝑇)𝑐)) = ((𝐻‘𝑎)(.r‘𝑆)(𝐻‘𝑐))))
70	66, 69	mpbird 247	. . . 4 ⊢ (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g‘𝑇)}) → ∀𝑎 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝐻‘(𝑎(.r‘𝑇)𝑐)) = ((𝐻‘𝑎)(.r‘𝑆)(𝐻‘𝑐)))
71	16, 70	mpdan 702	. . 3 ⊢ ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → ∀𝑎 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝐻‘(𝑎(.r‘𝑇)𝑐)) = ((𝐻‘𝑎)(.r‘𝑆)(𝐻‘𝑐)))
72	20, 71	jca 554	. 2 ⊢ ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → (𝐻 ∈ (𝑇 GrpHom 𝑆) ∧ ∀𝑎 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝐻‘(𝑎(.r‘𝑇)𝑐)) = ((𝐻‘𝑎)(.r‘𝑆)(𝐻‘𝑐))))
73	13, 41, 33	isrnghm 41892	. 2 ⊢ (𝐻 ∈ (𝑇 RngHomo 𝑆) ↔ ((𝑇 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐻 ∈ (𝑇 GrpHom 𝑆) ∧ ∀𝑎 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝐻‘(𝑎(.r‘𝑇)𝑐)) = ((𝐻‘𝑎)(.r‘𝑆)(𝐻‘𝑐)))))
74	5, 72, 73	sylanbrc 698	1 ⊢ ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝐻 ∈ (𝑇 RngHomo 𝑆))

Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   = wceq 1483   ∈ wcel 1990  ∀wral 2912  Vcvv 3200   ∖ cdif 3571  {csn 4177   ↦ cmpt 4729  ‘cfv 5888  (class class class)co 6650  Basecbs 15857  ._rcmulr 15942  0_gc0g 16100  Grpcgrp 17422   GrpHom cghm 17657  Abelcabl 18194  Ringcrg 18547  NzRingcnzr 19257  Rngcrng 41874   RngHomo crngh 41885

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-cnex 9992  ax-resscn 9993  ax-1cn 9994  ax-icn 9995  ax-addcl 9996  ax-addrcl 9997  ax-mulcl 9998  ax-mulrcl 9999  ax-mulcom 10000  ax-addass 10001  ax-mulass 10002  ax-distr 10003  ax-i2m1 10004  ax-1ne0 10005  ax-1rid 10006  ax-rnegex 10007  ax-rrecex 10008  ax-cnre 10009  ax-pre-lttri 10010  ax-pre-lttrn 10011  ax-pre-ltadd 10012  ax-pre-mulgt0 10013

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-1st 7168  df-2nd 7169  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-1o 7560  df-oadd 7564  df-er 7742  df-map 7859  df-en 7956  df-dom 7957  df-sdom 7958  df-fin 7959  df-card 8765  df-cda 8990  df-pnf 10076  df-mnf 10077  df-xr 10078  df-ltxr 10079  df-le 10080  df-sub 10268  df-neg 10269  df-nn 11021  df-2 11079  df-n0 11293  df-xnn0 11364  df-z 11378  df-uz 11688  df-fz 12327  df-hash 13118  df-ndx 15860  df-slot 15861  df-base 15863  df-sets 15864  df-plusg 15954  df-0g 16102  df-mgm 17242  df-sgrp 17284  df-mnd 17295  df-mhm 17335  df-grp 17425  df-minusg 17426  df-ghm 17658  df-cmn 18195  df-abl 18196  df-mgp 18490  df-ur 18502  df-ring 18549  df-nzr 19258  df-mgmhm 41779  df-rng0 41875  df-rnghomo 41887

This theorem is referenced by:  zrinitorngc  42000