Theorem isrnghm 46738

Description: A function is a non-unital ring homomorphism iff it is a group homomorphism and preserves multiplication. (Contributed by AV, 22-Feb-2020.)

Hypotheses

Ref	Expression
isrnghm.b	⊢ 𝐵 = (Base‘𝑅)
isrnghm.t	⊢ · = (.r‘𝑅)
isrnghm.m	⊢ ∗ = (.r‘𝑆)

Assertion

Ref	Expression
isrnghm	⊢ (𝐹 ∈ (𝑅 RngHomo 𝑆) ↔ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦)))))

Distinct variable groups:   𝑥,𝐵,𝑦   𝑥,𝑅,𝑦   𝑥,𝑆,𝑦   𝑥,𝐹,𝑦

Allowed substitution hints:   · (𝑥,𝑦)   ∗ (𝑥,𝑦)

Proof of Theorem isrnghm

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		rnghmrcl 46735	. 2 ⊢ (𝐹 ∈ (𝑅 RngHomo 𝑆) → (𝑅 ∈ Rng ∧ 𝑆 ∈ Rng))
2		isrnghm.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑅)
3		isrnghm.t	. . . . 5 ⊢ · = (.r‘𝑅)
4		isrnghm.m	. . . . 5 ⊢ ∗ = (.r‘𝑆)
5		eqid 2733	. . . . 5 ⊢ (Base‘𝑆) = (Base‘𝑆)
6		eqid 2733	. . . . 5 ⊢ (+g‘𝑅) = (+g‘𝑅)
7		eqid 2733	. . . . 5 ⊢ (+g‘𝑆) = (+g‘𝑆)
8	2, 3, 4, 5, 6, 7	rnghmval 46737	. . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) → (𝑅 RngHomo 𝑆) = {𝑓 ∈ ((Base‘𝑆) ↑m 𝐵) ∣ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥(+g‘𝑅)𝑦)) = ((𝑓‘𝑥)(+g‘𝑆)(𝑓‘𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) ∗ (𝑓‘𝑦)))})
9	8	eleq2d 2820	. . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) → (𝐹 ∈ (𝑅 RngHomo 𝑆) ↔ 𝐹 ∈ {𝑓 ∈ ((Base‘𝑆) ↑m 𝐵) ∣ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥(+g‘𝑅)𝑦)) = ((𝑓‘𝑥)(+g‘𝑆)(𝑓‘𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) ∗ (𝑓‘𝑦)))}))
10		fveq1 6891	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑓‘(𝑥(+g‘𝑅)𝑦)) = (𝐹‘(𝑥(+g‘𝑅)𝑦)))
11		fveq1 6891	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥))
12		fveq1 6891	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑦) = (𝐹‘𝑦))
13	11, 12	oveq12d 7427	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑥)(+g‘𝑆)(𝑓‘𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)))
14	10, 13	eqeq12d 2749	. . . . . . 7 ⊢ (𝑓 = 𝐹 → ((𝑓‘(𝑥(+g‘𝑅)𝑦)) = ((𝑓‘𝑥)(+g‘𝑆)(𝑓‘𝑦)) ↔ (𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦))))
15		fveq1 6891	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑓‘(𝑥 · 𝑦)) = (𝐹‘(𝑥 · 𝑦)))
16	11, 12	oveq12d 7427	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑥) ∗ (𝑓‘𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦)))
17	15, 16	eqeq12d 2749	. . . . . . 7 ⊢ (𝑓 = 𝐹 → ((𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) ∗ (𝑓‘𝑦)) ↔ (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦))))
18	14, 17	anbi12d 632	. . . . . 6 ⊢ (𝑓 = 𝐹 → (((𝑓‘(𝑥(+g‘𝑅)𝑦)) = ((𝑓‘𝑥)(+g‘𝑆)(𝑓‘𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) ∗ (𝑓‘𝑦))) ↔ ((𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)) ∧ (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦)))))
19	18	2ralbidv 3219	. . . . 5 ⊢ (𝑓 = 𝐹 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥(+g‘𝑅)𝑦)) = ((𝑓‘𝑥)(+g‘𝑆)(𝑓‘𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) ∗ (𝑓‘𝑦))) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)) ∧ (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦)))))
20	19	elrab 3684	. . . 4 ⊢ (𝐹 ∈ {𝑓 ∈ ((Base‘𝑆) ↑m 𝐵) ∣ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥(+g‘𝑅)𝑦)) = ((𝑓‘𝑥)(+g‘𝑆)(𝑓‘𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) ∗ (𝑓‘𝑦)))} ↔ (𝐹 ∈ ((Base‘𝑆) ↑m 𝐵) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)) ∧ (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦)))))
21		r19.26-2 3139	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)) ∧ (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦))) ↔ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦))))
22	21	anbi2i 624	. . . . . 6 ⊢ ((𝐹 ∈ ((Base‘𝑆) ↑m 𝐵) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)) ∧ (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦)))) ↔ (𝐹 ∈ ((Base‘𝑆) ↑m 𝐵) ∧ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦)))))
23		anass 470	. . . . . 6 ⊢ (((𝐹 ∈ ((Base‘𝑆) ↑m 𝐵) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦))) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦))) ↔ (𝐹 ∈ ((Base‘𝑆) ↑m 𝐵) ∧ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦)))))
24	22, 23	bitr4i 278	. . . . 5 ⊢ ((𝐹 ∈ ((Base‘𝑆) ↑m 𝐵) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)) ∧ (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦)))) ↔ ((𝐹 ∈ ((Base‘𝑆) ↑m 𝐵) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦))) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦))))
25	2, 5, 6, 7	isghm 19092	. . . . . . 7 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) ↔ ((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp) ∧ (𝐹:𝐵⟶(Base‘𝑆) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)))))
26		fvex 6905	. . . . . . . . . . 11 ⊢ (Base‘𝑆) ∈ V
27	2	fvexi 6906	. . . . . . . . . . 11 ⊢ 𝐵 ∈ V
28	26, 27	pm3.2i 472	. . . . . . . . . 10 ⊢ ((Base‘𝑆) ∈ V ∧ 𝐵 ∈ V)
29		elmapg 8833	. . . . . . . . . 10 ⊢ (((Base‘𝑆) ∈ V ∧ 𝐵 ∈ V) → (𝐹 ∈ ((Base‘𝑆) ↑m 𝐵) ↔ 𝐹:𝐵⟶(Base‘𝑆)))
30	28, 29	mp1i 13	. . . . . . . . 9 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) → (𝐹 ∈ ((Base‘𝑆) ↑m 𝐵) ↔ 𝐹:𝐵⟶(Base‘𝑆)))
31	30	anbi1d 631	. . . . . . . 8 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) → ((𝐹 ∈ ((Base‘𝑆) ↑m 𝐵) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦))) ↔ (𝐹:𝐵⟶(Base‘𝑆) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)))))
32		rngabl 46699	. . . . . . . . . 10 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Abel)
33		ablgrp 19653	. . . . . . . . . 10 ⊢ (𝑅 ∈ Abel → 𝑅 ∈ Grp)
34	32, 33	syl 17	. . . . . . . . 9 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp)
35		rngabl 46699	. . . . . . . . . 10 ⊢ (𝑆 ∈ Rng → 𝑆 ∈ Abel)
36		ablgrp 19653	. . . . . . . . . 10 ⊢ (𝑆 ∈ Abel → 𝑆 ∈ Grp)
37	35, 36	syl 17	. . . . . . . . 9 ⊢ (𝑆 ∈ Rng → 𝑆 ∈ Grp)
38		ibar 530	. . . . . . . . 9 ⊢ ((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp) → ((𝐹:𝐵⟶(Base‘𝑆) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦))) ↔ ((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp) ∧ (𝐹:𝐵⟶(Base‘𝑆) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦))))))
39	34, 37, 38	syl2an 597	. . . . . . . 8 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) → ((𝐹:𝐵⟶(Base‘𝑆) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦))) ↔ ((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp) ∧ (𝐹:𝐵⟶(Base‘𝑆) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦))))))
40	31, 39	bitr2d 280	. . . . . . 7 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) → (((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp) ∧ (𝐹:𝐵⟶(Base‘𝑆) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)))) ↔ (𝐹 ∈ ((Base‘𝑆) ↑m 𝐵) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)))))
41	25, 40	bitr2id 284	. . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) → ((𝐹 ∈ ((Base‘𝑆) ↑m 𝐵) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦))) ↔ 𝐹 ∈ (𝑅 GrpHom 𝑆)))
42	41	anbi1d 631	. . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) → (((𝐹 ∈ ((Base‘𝑆) ↑m 𝐵) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦))) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦))) ↔ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦)))))
43	24, 42	bitrid 283	. . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) → ((𝐹 ∈ ((Base‘𝑆) ↑m 𝐵) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)) ∧ (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦)))) ↔ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦)))))
44	20, 43	bitrid 283	. . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) → (𝐹 ∈ {𝑓 ∈ ((Base‘𝑆) ↑m 𝐵) ∣ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥(+g‘𝑅)𝑦)) = ((𝑓‘𝑥)(+g‘𝑆)(𝑓‘𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) ∗ (𝑓‘𝑦)))} ↔ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦)))))
45	9, 44	bitrd 279	. 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) → (𝐹 ∈ (𝑅 RngHomo 𝑆) ↔ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦)))))
46	1, 45	biadanii 821	1 ⊢ (𝐹 ∈ (𝑅 RngHomo 𝑆) ↔ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦)))))

Syntax hints:   ↔ wb 205   ∧ wa 397   = wceq 1542   ∈ wcel 2107  ∀wral 3062  {crab 3433  Vcvv 3475  ⟶wf 6540  ‘cfv 6544  (class class class)co 7409   ↑_m cmap 8820  Basecbs 17144  +_gcplusg 17197  ._rcmulr 17198  Grpcgrp 18819   GrpHom cghm 19089  Abelcabl 19649  Rngcrng 46696   RngHomo crngh 46731

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5286  ax-sep 5300  ax-nul 5307  ax-pow 5364  ax-pr 5428  ax-un 7725

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-iun 5000  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5575  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551  df-fv 6552  df-ov 7412  df-oprab 7413  df-mpo 7414  df-map 8822  df-ghm 19090  df-abl 19651  df-rng 46697  df-rnghomo 46733

This theorem is referenced by:  isrnghmmul  46739  rnghmghm  46744  rnghmmul  46746  isrnghm2d  46747  zrrnghm  46764  rngqiprngho  46836