Theorem isrhm 14171

Description: A function is a ring homomorphism iff it preserves both addition and multiplication. (Contributed by Stefan O'Rear, 7-Mar-2015.)

Hypotheses

Ref	Expression
isrhm.m	|- M = (mulGrp ` R )
isrhm.n	|- N = (mulGrp ` S )

Assertion

Ref	Expression
isrhm	|- ( F e. ( R RingHom S ) <-> ( ( R e. Ring /\ S e. Ring ) /\ ( F e. ( R GrpHom S ) /\ F e. ( M MndHom N ) ) ) )

Proof of Theorem isrhm

Dummy variables r s are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfrhm2 14167	. . 3 |- RingHom = ( r e. Ring , s e. Ring |-> ( ( r GrpHom s ) i^i ( (mulGrp ` r ) MndHom (mulGrp ` s ) ) ) )
2	1	elmpocl 6216	. 2 |- ( F e. ( R RingHom S ) -> ( R e. Ring /\ S e. Ring ) )
3		ringgrp 14013	. . . . . . 7 |- ( R e. Ring -> R e. Grp )
4		ringgrp 14013	. . . . . . 7 |- ( S e. Ring -> S e. Grp )
5		ghmex 13841	. . . . . . 7 |- ( ( R e. Grp /\ S e. Grp ) -> ( R GrpHom S ) e. _V )
6	3, 4, 5	syl2an 289	. . . . . 6 |- ( ( R e. Ring /\ S e. Ring ) -> ( R GrpHom S ) e. _V )
7		inex1g 4225	. . . . . 6 |- ( ( R GrpHom S ) e. _V -> ( ( R GrpHom S ) i^i ( (mulGrp ` R ) MndHom (mulGrp ` S ) ) ) e. _V )
8	6, 7	syl 14	. . . . 5 |- ( ( R e. Ring /\ S e. Ring ) -> ( ( R GrpHom S ) i^i ( (mulGrp ` R ) MndHom (mulGrp ` S ) ) ) e. _V )
9		oveq12 6026	. . . . . . 7 |- ( ( r = R /\ s = S ) -> ( r GrpHom s ) = ( R GrpHom S ) )
10		fveq2 5639	. . . . . . . 8 |- ( r = R -> (mulGrp ` r ) = (mulGrp ` R ) )
11		fveq2 5639	. . . . . . . 8 |- ( s = S -> (mulGrp ` s ) = (mulGrp ` S ) )
12	10, 11	oveqan12d 6036	. . . . . . 7 |- ( ( r = R /\ s = S ) -> ( (mulGrp ` r ) MndHom (mulGrp ` s ) ) = ( (mulGrp ` R ) MndHom (mulGrp ` S ) ) )
13	9, 12	ineq12d 3409	. . . . . 6 |- ( ( r = R /\ s = S ) -> ( ( r GrpHom s ) i^i ( (mulGrp ` r ) MndHom (mulGrp ` s ) ) ) = ( ( R GrpHom S ) i^i ( (mulGrp ` R ) MndHom (mulGrp ` S ) ) ) )
14	13, 1	ovmpoga 6150	. . . . 5 |- ( ( R e. Ring /\ S e. Ring /\ ( ( R GrpHom S ) i^i ( (mulGrp ` R ) MndHom (mulGrp ` S ) ) ) e. _V ) -> ( R RingHom S ) = ( ( R GrpHom S ) i^i ( (mulGrp ` R ) MndHom (mulGrp ` S ) ) ) )
15	8, 14	mpd3an3 1374	. . . 4 |- ( ( R e. Ring /\ S e. Ring ) -> ( R RingHom S ) = ( ( R GrpHom S ) i^i ( (mulGrp ` R ) MndHom (mulGrp ` S ) ) ) )
16	15	eleq2d 2301	. . 3 |- ( ( R e. Ring /\ S e. Ring ) -> ( F e. ( R RingHom S ) <-> F e. ( ( R GrpHom S ) i^i ( (mulGrp ` R ) MndHom (mulGrp ` S ) ) ) ) )
17		elin 3390	. . . 4 |- ( F e. ( ( R GrpHom S ) i^i ( (mulGrp ` R ) MndHom (mulGrp ` S ) ) ) <-> ( F e. ( R GrpHom S ) /\ F e. ( (mulGrp ` R ) MndHom (mulGrp ` S ) ) ) )
18		isrhm.m	. . . . . . . 8 |- M = (mulGrp ` R )
19		isrhm.n	. . . . . . . 8 |- N = (mulGrp ` S )
20	18, 19	oveq12i 6029	. . . . . . 7 |- ( M MndHom N ) = ( (mulGrp ` R ) MndHom (mulGrp ` S ) )
21	20	eqcomi 2235	. . . . . 6 |- ( (mulGrp ` R ) MndHom (mulGrp ` S ) ) = ( M MndHom N )
22	21	eleq2i 2298	. . . . 5 |- ( F e. ( (mulGrp ` R ) MndHom (mulGrp ` S ) ) <-> F e. ( M MndHom N ) )
23	22	anbi2i 457	. . . 4 |- ( ( F e. ( R GrpHom S ) /\ F e. ( (mulGrp ` R ) MndHom (mulGrp ` S ) ) ) <-> ( F e. ( R GrpHom S ) /\ F e. ( M MndHom N ) ) )
24	17, 23	bitri 184	. . 3 |- ( F e. ( ( R GrpHom S ) i^i ( (mulGrp ` R ) MndHom (mulGrp ` S ) ) ) <-> ( F e. ( R GrpHom S ) /\ F e. ( M MndHom N ) ) )
25	16, 24	bitrdi 196	. 2 |- ( ( R e. Ring /\ S e. Ring ) -> ( F e. ( R RingHom S ) <-> ( F e. ( R GrpHom S ) /\ F e. ( M MndHom N ) ) ) )
26	2, 25	biadanii 617	1 |- ( F e. ( R RingHom S ) <-> ( ( R e. Ring /\ S e. Ring ) /\ ( F e. ( R GrpHom S ) /\ F e. ( M MndHom N ) ) ) )

Syntax hints:   /\ wa 104   <-> wb 105   = wceq 1397   e. wcel 2202   _Vcvv 2802   i^i cin 3199   ` cfv 5326  (class class class)co 6017   MndHom cmhm 13539   Grpcgrp 13582   GrpHom cghm 13826  mulGrpcmgp 13932   Ringcrg 14008   RingHom crh 14163

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-i2m1 8136  ax-0lt1 8137  ax-0id 8139  ax-rnegex 8140  ax-pre-ltirr 8143  ax-pre-ltadd 8147

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-map 6818  df-pnf 8215  df-mnf 8216  df-ltxr 8218  df-inn 9143  df-2 9201  df-3 9202  df-ndx 13084  df-slot 13085  df-base 13087  df-sets 13088  df-plusg 13172  df-mulr 13173  df-0g 13340  df-mgm 13438  df-sgrp 13484  df-mnd 13499  df-mhm 13541  df-grp 13585  df-ghm 13827  df-mgp 13933  df-ur 13972  df-ring 14010  df-rhm 14165

This theorem is referenced by:  rhmmhm  14172  rhmghm  14175  isrhm2d  14178  rhmf1o  14181  rhmco  14187  resrhm  14261  resrhm2b  14262  rhmpropd  14267