Theorem isrhm 13654

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 13650	. . 3 |- RingHom = ( r e. Ring , s e. Ring |-> ( ( r GrpHom s ) i^i ( (mulGrp ` r ) MndHom (mulGrp ` s ) ) ) )
2	1	elmpocl 6113	. 2 |- ( F e. ( R RingHom S ) -> ( R e. Ring /\ S e. Ring ) )
3		ringgrp 13497	. . . . . . 7 |- ( R e. Ring -> R e. Grp )
4		ringgrp 13497	. . . . . . 7 |- ( S e. Ring -> S e. Grp )
5		ghmex 13325	. . . . . . 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 4165	. . . . . 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 5927	. . . . . . 7 |- ( ( r = R /\ s = S ) -> ( r GrpHom s ) = ( R GrpHom S ) )
10		fveq2 5554	. . . . . . . 8 |- ( r = R -> (mulGrp ` r ) = (mulGrp ` R ) )
11		fveq2 5554	. . . . . . . 8 |- ( s = S -> (mulGrp ` s ) = (mulGrp ` S ) )
12	10, 11	oveqan12d 5937	. . . . . . 7 |- ( ( r = R /\ s = S ) -> ( (mulGrp ` r ) MndHom (mulGrp ` s ) ) = ( (mulGrp ` R ) MndHom (mulGrp ` S ) ) )
13	9, 12	ineq12d 3361	. . . . . 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 6048	. . . . 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 1349	. . . 4 |- ( ( R e. Ring /\ S e. Ring ) -> ( R RingHom S ) = ( ( R GrpHom S ) i^i ( (mulGrp ` R ) MndHom (mulGrp ` S ) ) ) )
16	15	eleq2d 2263	. . 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 3342	. . . 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 5930	. . . . . . 7 |- ( M MndHom N ) = ( (mulGrp ` R ) MndHom (mulGrp ` S ) )
21	20	eqcomi 2197	. . . . . 6 |- ( (mulGrp ` R ) MndHom (mulGrp ` S ) ) = ( M MndHom N )
22	21	eleq2i 2260	. . . . 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 613	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 1364   e. wcel 2164   _Vcvv 2760   i^i cin 3152   ` cfv 5254  (class class class)co 5918   MndHom cmhm 13029   Grpcgrp 13072   GrpHom cghm 13310  mulGrpcmgp 13416   Ringcrg 13492   RingHom crh 13646

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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-addcom 7972  ax-addass 7974  ax-i2m1 7977  ax-0lt1 7978  ax-0id 7980  ax-rnegex 7981  ax-pre-ltirr 7984  ax-pre-ltadd 7988

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1st 6193  df-2nd 6194  df-map 6704  df-pnf 8056  df-mnf 8057  df-ltxr 8059  df-inn 8983  df-2 9041  df-3 9042  df-ndx 12621  df-slot 12622  df-base 12624  df-sets 12625  df-plusg 12708  df-mulr 12709  df-0g 12869  df-mgm 12939  df-sgrp 12985  df-mnd 12998  df-mhm 13031  df-grp 13075  df-ghm 13311  df-mgp 13417  df-ur 13456  df-ring 13494  df-rhm 13648

This theorem is referenced by:  rhmmhm  13655  rhmghm  13658  isrhm2d  13661  rhmf1o  13664  rhmco  13670  resrhm  13744  resrhm2b  13745  rhmpropd  13750