Theorem isrnghm 20375

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	⊢ (𝐹 ∈ (𝑅 RngHom 𝑆) ↔ ((𝑅 ∈ 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 20372	. 2 ⊢ (𝐹 ∈ (𝑅 RngHom 𝑆) → (𝑅 ∈ Rng ∧ 𝑆 ∈ Rng))
2		isrnghm.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑅)
3		isrnghm.t	. . . . 5 ⊢ · = (.r‘𝑅)
4		isrnghm.m	. . . . 5 ⊢ ∗ = (.r‘𝑆)
5		eqid 2734	. . . . 5 ⊢ (Base‘𝑆) = (Base‘𝑆)
6		eqid 2734	. . . . 5 ⊢ (+g‘𝑅) = (+g‘𝑅)
7		eqid 2734	. . . . 5 ⊢ (+g‘𝑆) = (+g‘𝑆)
8	2, 3, 4, 5, 6, 7	rnghmval 20374	. . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) → (𝑅 RngHom 𝑆) = {𝑓 ∈ ((Base‘𝑆) ↑m 𝐵) ∣ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥(+g‘𝑅)𝑦)) = ((𝑓‘𝑥)(+g‘𝑆)(𝑓‘𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) ∗ (𝑓‘𝑦)))})
9	8	eleq2d 2820	. . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) → (𝐹 ∈ (𝑅 RngHom 𝑆) ↔ 𝐹 ∈ {𝑓 ∈ ((Base‘𝑆) ↑m 𝐵) ∣ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥(+g‘𝑅)𝑦)) = ((𝑓‘𝑥)(+g‘𝑆)(𝑓‘𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) ∗ (𝑓‘𝑦)))}))
10		fveq1 6831	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑓‘(𝑥(+g‘𝑅)𝑦)) = (𝐹‘(𝑥(+g‘𝑅)𝑦)))
11		fveq1 6831	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥))
12		fveq1 6831	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑦) = (𝐹‘𝑦))
13	11, 12	oveq12d 7374	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑥)(+g‘𝑆)(𝑓‘𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)))
14	10, 13	eqeq12d 2750	. . . . . . 7 ⊢ (𝑓 = 𝐹 → ((𝑓‘(𝑥(+g‘𝑅)𝑦)) = ((𝑓‘𝑥)(+g‘𝑆)(𝑓‘𝑦)) ↔ (𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦))))
15		fveq1 6831	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑓‘(𝑥 · 𝑦)) = (𝐹‘(𝑥 · 𝑦)))
16	11, 12	oveq12d 7374	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑥) ∗ (𝑓‘𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦)))
17	15, 16	eqeq12d 2750	. . . . . . 7 ⊢ (𝑓 = 𝐹 → ((𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) ∗ (𝑓‘𝑦)) ↔ (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦))))
18	14, 17	anbi12d 632	. . . . . 6 ⊢ (𝑓 = 𝐹 → (((𝑓‘(𝑥(+g‘𝑅)𝑦)) = ((𝑓‘𝑥)(+g‘𝑆)(𝑓‘𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) ∗ (𝑓‘𝑦))) ↔ ((𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)) ∧ (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦)))))
19	18	2ralbidv 3198	. . . . 5 ⊢ (𝑓 = 𝐹 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥(+g‘𝑅)𝑦)) = ((𝑓‘𝑥)(+g‘𝑆)(𝑓‘𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) ∗ (𝑓‘𝑦))) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)) ∧ (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦)))))
20	19	elrab 3644	. . . 4 ⊢ (𝐹 ∈ {𝑓 ∈ ((Base‘𝑆) ↑m 𝐵) ∣ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥(+g‘𝑅)𝑦)) = ((𝑓‘𝑥)(+g‘𝑆)(𝑓‘𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) ∗ (𝑓‘𝑦)))} ↔ (𝐹 ∈ ((Base‘𝑆) ↑m 𝐵) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)) ∧ (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦)))))
21		r19.26-2 3119	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)) ∧ (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦))) ↔ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦))))
22	21	anbi2i 623	. . . . . 6 ⊢ ((𝐹 ∈ ((Base‘𝑆) ↑m 𝐵) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)) ∧ (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦)))) ↔ (𝐹 ∈ ((Base‘𝑆) ↑m 𝐵) ∧ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦)))))
23		anass 468	. . . . . 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 19142	. . . . . . 7 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) ↔ ((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp) ∧ (𝐹:𝐵⟶(Base‘𝑆) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦)))))
26		fvex 6845	. . . . . . . . . . 11 ⊢ (Base‘𝑆) ∈ V
27	2	fvexi 6846	. . . . . . . . . . 11 ⊢ 𝐵 ∈ V
28	26, 27	pm3.2i 470	. . . . . . . . . 10 ⊢ ((Base‘𝑆) ∈ V ∧ 𝐵 ∈ V)
29		elmapg 8774	. . . . . . . . . 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 20088	. . . . . . . . . 10 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Abel)
33		ablgrp 19712	. . . . . . . . . 10 ⊢ (𝑅 ∈ Abel → 𝑅 ∈ Grp)
34	32, 33	syl 17	. . . . . . . . 9 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp)
35		rngabl 20088	. . . . . . . . . 10 ⊢ (𝑆 ∈ Rng → 𝑆 ∈ Abel)
36		ablgrp 19712	. . . . . . . . . 10 ⊢ (𝑆 ∈ Abel → 𝑆 ∈ Grp)
37	35, 36	syl 17	. . . . . . . . 9 ⊢ (𝑆 ∈ Rng → 𝑆 ∈ Grp)
38		ibar 528	. . . . . . . . 9 ⊢ ((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp) → ((𝐹:𝐵⟶(Base‘𝑆) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦))) ↔ ((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp) ∧ (𝐹:𝐵⟶(Base‘𝑆) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥(+g‘𝑅)𝑦)) = ((𝐹‘𝑥)(+g‘𝑆)(𝐹‘𝑦))))))
39	34, 37, 38	syl2an 596	. . . . . . . 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) → (𝐹 ∈ (𝑅 RngHom 𝑆) ↔ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦)))))
46	1, 45	biadanii 821	1 ⊢ (𝐹 ∈ (𝑅 RngHom 𝑆) ↔ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) ∗ (𝐹‘𝑦)))))

Syntax hints:   ↔ wb 206   ∧ wa 395   = wceq 1541   ∈ wcel 2113  ∀wral 3049  {crab 3397  Vcvv 3438  ⟶wf 6486  ‘cfv 6490  (class class class)co 7356   ↑_m cmap 8761  Basecbs 17134  +_gcplusg 17175  ._rcmulr 17176  Grpcgrp 18861   GrpHom cghm 19139  Abelcabl 19708  Rngcrng 20085   RngHom crnghm 20368

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-fv 6498  df-ov 7359  df-oprab 7360  df-mpo 7361  df-1st 7931  df-2nd 7932  df-map 8763  df-ghm 19140  df-abl 19710  df-rng 20086  df-rnghm 20370

This theorem is referenced by:  isrnghmmul  20376  rnghmghm  20381  rnghmmul  20383  isrnghm2d  20384  zrrnghm  20467  rngqiprngho  21256