imacrhmcl - Mathbox for Steven Nguyen

	Mathbox for Steven Nguyen		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > imacrhmcl		Structured version Visualization version GIF version

Theorem imacrhmcl 41086

Description: The image of a commutative ring homomorphism is a commutative ring. (Contributed by SN, 10-Jan-2025.)

**Hypotheses**
Ref	Expression
imacrhmcl.c	⊢ 𝐶 = (𝑁 ↾_s (𝐹 “ 𝑆))
imacrhmcl.h	⊢ (𝜑 → 𝐹 ∈ (𝑀 RingHom 𝑁))
imacrhmcl.m	⊢ (𝜑 → 𝑀 ∈ CRing)
imacrhmcl.s	⊢ (𝜑 → 𝑆 ∈ (SubRing‘𝑀))

**Assertion**
Ref	Expression
imacrhmcl	⊢ (𝜑 → 𝐶 ∈ CRing)

Proof of Theorem imacrhmcl Dummy variables 𝑎 𝑏 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		imacrhmcl.h	. . . 4 ⊢ (𝜑 → 𝐹 ∈ (𝑀 RingHom 𝑁))
2		imacrhmcl.s	. . . 4 ⊢ (𝜑 → 𝑆 ∈ (SubRing‘𝑀))
3		rhmima 20388	. . . 4 ⊢ ((𝐹 ∈ (𝑀 RingHom 𝑁) ∧ 𝑆 ∈ (SubRing‘𝑀)) → (𝐹 “ 𝑆) ∈ (SubRing‘𝑁))
4	1, 2, 3	syl2anc 584	. . 3 ⊢ (𝜑 → (𝐹 “ 𝑆) ∈ (SubRing‘𝑁))
5		imacrhmcl.c	. . . 4 ⊢ 𝐶 = (𝑁 ↾_s (𝐹 “ 𝑆))
6	5	subrgring 20358	. . 3 ⊢ ((𝐹 “ 𝑆) ∈ (SubRing‘𝑁) → 𝐶 ∈ Ring)
7	4, 6	syl 17	. 2 ⊢ (𝜑 → 𝐶 ∈ Ring)
8	5	ressbasss2 17181	. . . . . 6 ⊢ (Base‘𝐶) ⊆ (𝐹 “ 𝑆)
9	8	sseli 3977	. . . . 5 ⊢ (𝑥 ∈ (Base‘𝐶) → 𝑥 ∈ (𝐹 “ 𝑆))
10	8	sseli 3977	. . . . 5 ⊢ (𝑦 ∈ (Base‘𝐶) → 𝑦 ∈ (𝐹 “ 𝑆))
11	9, 10	anim12i 613	. . . 4 ⊢ ((𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) → (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆)))
12		eqid 2732	. . . . . . . . . 10 ⊢ (Base‘𝑀) = (Base‘𝑀)
13		eqid 2732	. . . . . . . . . 10 ⊢ (Base‘𝑁) = (Base‘𝑁)
14	12, 13	rhmf 20255	. . . . . . . . 9 ⊢ (𝐹 ∈ (𝑀 RingHom 𝑁) → 𝐹:(Base‘𝑀)⟶(Base‘𝑁))
15	1, 14	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐹:(Base‘𝑀)⟶(Base‘𝑁))
16	15	ffund 6718	. . . . . . 7 ⊢ (𝜑 → Fun 𝐹)
17		fvelima 6954	. . . . . . 7 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ (𝐹 “ 𝑆)) → ∃𝑎 ∈ 𝑆 (𝐹‘𝑎) = 𝑥)
18	16, 17	sylan 580	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐹 “ 𝑆)) → ∃𝑎 ∈ 𝑆 (𝐹‘𝑎) = 𝑥)
19	18	adantrr 715	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆))) → ∃𝑎 ∈ 𝑆 (𝐹‘𝑎) = 𝑥)
20		fvelima 6954	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑦 ∈ (𝐹 “ 𝑆)) → ∃𝑏 ∈ 𝑆 (𝐹‘𝑏) = 𝑦)
21	16, 20	sylan 580	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐹 “ 𝑆)) → ∃𝑏 ∈ 𝑆 (𝐹‘𝑏) = 𝑦)
22	21	adantrl 714	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆))) → ∃𝑏 ∈ 𝑆 (𝐹‘𝑏) = 𝑦)
23	22	adantr 481	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆))) ∧ (𝑎 ∈ 𝑆 ∧ (𝐹‘𝑎) = 𝑥)) → ∃𝑏 ∈ 𝑆 (𝐹‘𝑏) = 𝑦)
24		imacrhmcl.m	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑀 ∈ CRing)
25	24	ad3antrrr 728	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆))) ∧ (𝑎 ∈ 𝑆 ∧ (𝐹‘𝑎) = 𝑥)) ∧ (𝑏 ∈ 𝑆 ∧ (𝐹‘𝑏) = 𝑦)) → 𝑀 ∈ CRing)
26	12	subrgss 20356	. . . . . . . . . . . . 13 ⊢ (𝑆 ∈ (SubRing‘𝑀) → 𝑆 ⊆ (Base‘𝑀))
27	2, 26	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑆 ⊆ (Base‘𝑀))
28	27	ad3antrrr 728	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆))) ∧ (𝑎 ∈ 𝑆 ∧ (𝐹‘𝑎) = 𝑥)) ∧ (𝑏 ∈ 𝑆 ∧ (𝐹‘𝑏) = 𝑦)) → 𝑆 ⊆ (Base‘𝑀))
29		simplrl 775	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆))) ∧ (𝑎 ∈ 𝑆 ∧ (𝐹‘𝑎) = 𝑥)) ∧ (𝑏 ∈ 𝑆 ∧ (𝐹‘𝑏) = 𝑦)) → 𝑎 ∈ 𝑆)
30	28, 29	sseldd 3982	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆))) ∧ (𝑎 ∈ 𝑆 ∧ (𝐹‘𝑎) = 𝑥)) ∧ (𝑏 ∈ 𝑆 ∧ (𝐹‘𝑏) = 𝑦)) → 𝑎 ∈ (Base‘𝑀))
31		simprl 769	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆))) ∧ (𝑎 ∈ 𝑆 ∧ (𝐹‘𝑎) = 𝑥)) ∧ (𝑏 ∈ 𝑆 ∧ (𝐹‘𝑏) = 𝑦)) → 𝑏 ∈ 𝑆)
32	28, 31	sseldd 3982	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆))) ∧ (𝑎 ∈ 𝑆 ∧ (𝐹‘𝑎) = 𝑥)) ∧ (𝑏 ∈ 𝑆 ∧ (𝐹‘𝑏) = 𝑦)) → 𝑏 ∈ (Base‘𝑀))
33		eqid 2732	. . . . . . . . . . 11 ⊢ (._r‘𝑀) = (._r‘𝑀)
34	12, 33	crngcom 20067	. . . . . . . . . 10 ⊢ ((𝑀 ∈ CRing ∧ 𝑎 ∈ (Base‘𝑀) ∧ 𝑏 ∈ (Base‘𝑀)) → (𝑎(._r‘𝑀)𝑏) = (𝑏(._r‘𝑀)𝑎))
35	25, 30, 32, 34	syl3anc 1371	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆))) ∧ (𝑎 ∈ 𝑆 ∧ (𝐹‘𝑎) = 𝑥)) ∧ (𝑏 ∈ 𝑆 ∧ (𝐹‘𝑏) = 𝑦)) → (𝑎(._r‘𝑀)𝑏) = (𝑏(._r‘𝑀)𝑎))
36	35	fveq2d 6892	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆))) ∧ (𝑎 ∈ 𝑆 ∧ (𝐹‘𝑎) = 𝑥)) ∧ (𝑏 ∈ 𝑆 ∧ (𝐹‘𝑏) = 𝑦)) → (𝐹‘(𝑎(._r‘𝑀)𝑏)) = (𝐹‘(𝑏(._r‘𝑀)𝑎)))
37	1	ad3antrrr 728	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆))) ∧ (𝑎 ∈ 𝑆 ∧ (𝐹‘𝑎) = 𝑥)) ∧ (𝑏 ∈ 𝑆 ∧ (𝐹‘𝑏) = 𝑦)) → 𝐹 ∈ (𝑀 RingHom 𝑁))
38		eqid 2732	. . . . . . . . . 10 ⊢ (._r‘𝑁) = (._r‘𝑁)
39	12, 33, 38	rhmmul 20256	. . . . . . . . 9 ⊢ ((𝐹 ∈ (𝑀 RingHom 𝑁) ∧ 𝑎 ∈ (Base‘𝑀) ∧ 𝑏 ∈ (Base‘𝑀)) → (𝐹‘(𝑎(._r‘𝑀)𝑏)) = ((𝐹‘𝑎)(._r‘𝑁)(𝐹‘𝑏)))
40	37, 30, 32, 39	syl3anc 1371	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆))) ∧ (𝑎 ∈ 𝑆 ∧ (𝐹‘𝑎) = 𝑥)) ∧ (𝑏 ∈ 𝑆 ∧ (𝐹‘𝑏) = 𝑦)) → (𝐹‘(𝑎(._r‘𝑀)𝑏)) = ((𝐹‘𝑎)(._r‘𝑁)(𝐹‘𝑏)))
41	12, 33, 38	rhmmul 20256	. . . . . . . . 9 ⊢ ((𝐹 ∈ (𝑀 RingHom 𝑁) ∧ 𝑏 ∈ (Base‘𝑀) ∧ 𝑎 ∈ (Base‘𝑀)) → (𝐹‘(𝑏(._r‘𝑀)𝑎)) = ((𝐹‘𝑏)(._r‘𝑁)(𝐹‘𝑎)))
42	37, 32, 30, 41	syl3anc 1371	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆))) ∧ (𝑎 ∈ 𝑆 ∧ (𝐹‘𝑎) = 𝑥)) ∧ (𝑏 ∈ 𝑆 ∧ (𝐹‘𝑏) = 𝑦)) → (𝐹‘(𝑏(._r‘𝑀)𝑎)) = ((𝐹‘𝑏)(._r‘𝑁)(𝐹‘𝑎)))
43	36, 40, 42	3eqtr3d 2780	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆))) ∧ (𝑎 ∈ 𝑆 ∧ (𝐹‘𝑎) = 𝑥)) ∧ (𝑏 ∈ 𝑆 ∧ (𝐹‘𝑏) = 𝑦)) → ((𝐹‘𝑎)(._r‘𝑁)(𝐹‘𝑏)) = ((𝐹‘𝑏)(._r‘𝑁)(𝐹‘𝑎)))
44		imaexg 7902	. . . . . . . . . 10 ⊢ (𝐹 ∈ (𝑀 RingHom 𝑁) → (𝐹 “ 𝑆) ∈ V)
45	5, 38	ressmulr 17248	. . . . . . . . . 10 ⊢ ((𝐹 “ 𝑆) ∈ V → (._r‘𝑁) = (._r‘𝐶))
46	1, 44, 45	3syl 18	. . . . . . . . 9 ⊢ (𝜑 → (._r‘𝑁) = (._r‘𝐶))
47	46	ad3antrrr 728	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆))) ∧ (𝑎 ∈ 𝑆 ∧ (𝐹‘𝑎) = 𝑥)) ∧ (𝑏 ∈ 𝑆 ∧ (𝐹‘𝑏) = 𝑦)) → (._r‘𝑁) = (._r‘𝐶))
48		simplrr 776	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆))) ∧ (𝑎 ∈ 𝑆 ∧ (𝐹‘𝑎) = 𝑥)) ∧ (𝑏 ∈ 𝑆 ∧ (𝐹‘𝑏) = 𝑦)) → (𝐹‘𝑎) = 𝑥)
49		simprr 771	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆))) ∧ (𝑎 ∈ 𝑆 ∧ (𝐹‘𝑎) = 𝑥)) ∧ (𝑏 ∈ 𝑆 ∧ (𝐹‘𝑏) = 𝑦)) → (𝐹‘𝑏) = 𝑦)
50	47, 48, 49	oveq123d 7426	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆))) ∧ (𝑎 ∈ 𝑆 ∧ (𝐹‘𝑎) = 𝑥)) ∧ (𝑏 ∈ 𝑆 ∧ (𝐹‘𝑏) = 𝑦)) → ((𝐹‘𝑎)(._r‘𝑁)(𝐹‘𝑏)) = (𝑥(._r‘𝐶)𝑦))
51	47, 49, 48	oveq123d 7426	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆))) ∧ (𝑎 ∈ 𝑆 ∧ (𝐹‘𝑎) = 𝑥)) ∧ (𝑏 ∈ 𝑆 ∧ (𝐹‘𝑏) = 𝑦)) → ((𝐹‘𝑏)(._r‘𝑁)(𝐹‘𝑎)) = (𝑦(._r‘𝐶)𝑥))
52	43, 50, 51	3eqtr3d 2780	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆))) ∧ (𝑎 ∈ 𝑆 ∧ (𝐹‘𝑎) = 𝑥)) ∧ (𝑏 ∈ 𝑆 ∧ (𝐹‘𝑏) = 𝑦)) → (𝑥(._r‘𝐶)𝑦) = (𝑦(._r‘𝐶)𝑥))
53	23, 52	rexlimddv 3161	. . . . 5 ⊢ (((𝜑 ∧ (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆))) ∧ (𝑎 ∈ 𝑆 ∧ (𝐹‘𝑎) = 𝑥)) → (𝑥(._r‘𝐶)𝑦) = (𝑦(._r‘𝐶)𝑥))
54	19, 53	rexlimddv 3161	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝐹 “ 𝑆) ∧ 𝑦 ∈ (𝐹 “ 𝑆))) → (𝑥(._r‘𝐶)𝑦) = (𝑦(._r‘𝐶)𝑥))
55	11, 54	sylan2 593	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (𝑥(._r‘𝐶)𝑦) = (𝑦(._r‘𝐶)𝑥))
56	55	ralrimivva 3200	. 2 ⊢ (𝜑 → ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)(𝑥(._r‘𝐶)𝑦) = (𝑦(._r‘𝐶)𝑥))
57		eqid 2732	. . 3 ⊢ (Base‘𝐶) = (Base‘𝐶)
58		eqid 2732	. . 3 ⊢ (._r‘𝐶) = (._r‘𝐶)
59	57, 58	iscrng2 20068	. 2 ⊢ (𝐶 ∈ CRing ↔ (𝐶 ∈ Ring ∧ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)(𝑥(._r‘𝐶)𝑦) = (𝑦(._r‘𝐶)𝑥)))
60	7, 56, 59	sylanbrc 583	1 ⊢ (𝜑 → 𝐶 ∈ CRing)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∀wral 3061 ∃wrex 3070 Vcvv 3474 ⊆ wss 3947 “ cima 5678 Fun wfun 6534 ⟶wf 6536 ‘cfv 6540 (class class class)co 7405 Basecbs 17140 ↾_s cress 17169 ._rcmulr 17194 Ringcrg 20049 CRingccrg 20050 RingHom crh 20240 SubRingcsubrg 20351

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-2nd 7972 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-er 8699 df-map 8818 df-en 8936 df-dom 8937 df-sdom 8938 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-nn 12209 df-2 12271 df-3 12272 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17141 df-ress 17170 df-plusg 17206 df-mulr 17207 df-0g 17383 df-mgm 18557 df-sgrp 18606 df-mnd 18622 df-mhm 18667 df-submnd 18668 df-grp 18818 df-minusg 18819 df-subg 18997 df-ghm 19084 df-cmn 19644 df-mgp 19982 df-ur 19999 df-ring 20051 df-cring 20052 df-rnghom 20243 df-subrg 20353

This theorem is referenced by: riccrng1 41093

W3C validator