rngogrphom - Mathbox for Jeff Madsen

	Mathbox for Jeff Madsen		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > rngogrphom		Structured version Visualization version GIF version

Theorem rngogrphom 38251

Description: A ring homomorphism is a group homomorphism. (Contributed by Jeff Madsen, 2-Jan-2011.)

**Hypotheses**
Ref	Expression
rnggrphom.1	⊢ 𝐺 = (1^st ‘𝑅)
rnggrphom.2	⊢ 𝐽 = (1^st ‘𝑆)

**Assertion**
Ref	Expression
rngogrphom	⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → 𝐹 ∈ (𝐺 GrpOpHom 𝐽))

Proof of Theorem rngogrphom Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rnggrphom.1	. . 3 ⊢ 𝐺 = (1^st ‘𝑅)
2		eqid 2737	. . 3 ⊢ ran 𝐺 = ran 𝐺
3		rnggrphom.2	. . 3 ⊢ 𝐽 = (1^st ‘𝑆)
4		eqid 2737	. . 3 ⊢ ran 𝐽 = ran 𝐽
5	1, 2, 3, 4	rngohomf 38246	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → 𝐹:ran 𝐺⟶ran 𝐽)
6	1, 2, 3	rngohomadd 38249	. . . 4 ⊢ (((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) ∧ (𝑥 ∈ ran 𝐺 ∧ 𝑦 ∈ ran 𝐺)) → (𝐹‘(𝑥𝐺𝑦)) = ((𝐹‘𝑥)𝐽(𝐹‘𝑦)))
7	6	eqcomd 2743	. . 3 ⊢ (((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) ∧ (𝑥 ∈ ran 𝐺 ∧ 𝑦 ∈ ran 𝐺)) → ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) = (𝐹‘(𝑥𝐺𝑦)))
8	7	ralrimivva 3181	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → ∀𝑥 ∈ ran 𝐺∀𝑦 ∈ ran 𝐺((𝐹‘𝑥)𝐽(𝐹‘𝑦)) = (𝐹‘(𝑥𝐺𝑦)))
9	1	rngogrpo 38190	. . . 4 ⊢ (𝑅 ∈ RingOps → 𝐺 ∈ GrpOp)
10	3	rngogrpo 38190	. . . 4 ⊢ (𝑆 ∈ RingOps → 𝐽 ∈ GrpOp)
11	2, 4	elghomOLD 38167	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐽 ∈ GrpOp) → (𝐹 ∈ (𝐺 GrpOpHom 𝐽) ↔ (𝐹:ran 𝐺⟶ran 𝐽 ∧ ∀𝑥 ∈ ran 𝐺∀𝑦 ∈ ran 𝐺((𝐹‘𝑥)𝐽(𝐹‘𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
12	9, 10, 11	syl2an 597	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps) → (𝐹 ∈ (𝐺 GrpOpHom 𝐽) ↔ (𝐹:ran 𝐺⟶ran 𝐽 ∧ ∀𝑥 ∈ ran 𝐺∀𝑦 ∈ ran 𝐺((𝐹‘𝑥)𝐽(𝐹‘𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
13	12	3adant3 1133	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → (𝐹 ∈ (𝐺 GrpOpHom 𝐽) ↔ (𝐹:ran 𝐺⟶ran 𝐽 ∧ ∀𝑥 ∈ ran 𝐺∀𝑦 ∈ ran 𝐺((𝐹‘𝑥)𝐽(𝐹‘𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
14	5, 8, 13	mpbir2and 714	1 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → 𝐹 ∈ (𝐺 GrpOpHom 𝐽))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ran crn 5635 ⟶wf 6498 ‘cfv 6502 (class class class)co 7370 1^st c1st 7943 GrpOpcgr 30583 GrpOpHom cghomOLD 38163 RingOpscrngo 38174 RingOpsHom crngohom 38240

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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5529 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-ov 7373 df-oprab 7374 df-mpo 7375 df-1st 7945 df-2nd 7946 df-map 8779 df-ablo 30639 df-ghomOLD 38164 df-rngo 38175 df-rngohom 38243

This theorem is referenced by: rngohom0 38252 rngohomsub 38253 rngokerinj 38255

W3C validator