Theorem crngpropd 14344

Description: If two structures have the same group components (properties), one is a commutative ring iff the other one is. (Contributed by Mario Carneiro, 8-Feb-2015.)

Hypotheses

Ref	Expression
ringpropd.1	|- ( ph -> B = ( Base ` K ) )
ringpropd.2	|- ( ph -> B = ( Base ` L ) )
ringpropd.3	|- ( ( ph /\ ( x e. B /\ y e. B ) ) -> ( x ( +g ` K ) y ) = ( x ( +g ` L ) y ) )
ringpropd.4	|- ( ( ph /\ ( x e. B /\ y e. B ) ) -> ( x ( .r ` K ) y ) = ( x ( .r ` L ) y ) )

Assertion

Ref	Expression
crngpropd	|- ( ph -> ( K e. CRing <-> L e. CRing ) )

Distinct variable groups:   x, y, B   x, K, y   ph, x, y   x, L, y

Proof of Theorem crngpropd

Step	Hyp	Ref	Expression
1		ringpropd.1	. . . . . 6 |- ( ph -> B = ( Base ` K ) )
2		eqid 2238	. . . . . . 7 |- (mulGrp ` K ) = (mulGrp ` K )
3		eqid 2238	. . . . . . 7 |- ( Base ` K ) = ( Base ` K )
4	2, 3	mgpbasg 14224	. . . . . 6 |- ( K e. Ring -> ( Base ` K ) = ( Base ` (mulGrp ` K ) ) )
5	1, 4	sylan9eq 2291	. . . . 5 |- ( ( ph /\ K e. Ring ) -> B = ( Base ` (mulGrp ` K ) ) )
6		ringpropd.2	. . . . . . 7 |- ( ph -> B = ( Base ` L ) )
7	6	adantr 276	. . . . . 6 |- ( ( ph /\ K e. Ring ) -> B = ( Base ` L ) )
8		ringpropd.3	. . . . . . . . 9 |- ( ( ph /\ ( x e. B /\ y e. B ) ) -> ( x ( +g ` K ) y ) = ( x ( +g ` L ) y ) )
9		ringpropd.4	. . . . . . . . 9 |- ( ( ph /\ ( x e. B /\ y e. B ) ) -> ( x ( .r ` K ) y ) = ( x ( .r ` L ) y ) )
10	1, 6, 8, 9	ringpropd 14343	. . . . . . . 8 |- ( ph -> ( K e. Ring <-> L e. Ring ) )
11	10	biimpa 296	. . . . . . 7 |- ( ( ph /\ K e. Ring ) -> L e. Ring )
12		eqid 2238	. . . . . . . 8 |- (mulGrp ` L ) = (mulGrp ` L )
13		eqid 2238	. . . . . . . 8 |- ( Base ` L ) = ( Base ` L )
14	12, 13	mgpbasg 14224	. . . . . . 7 |- ( L e. Ring -> ( Base ` L ) = ( Base ` (mulGrp ` L ) ) )
15	11, 14	syl 14	. . . . . 6 |- ( ( ph /\ K e. Ring ) -> ( Base ` L ) = ( Base ` (mulGrp ` L ) ) )
16	7, 15	eqtrd 2271	. . . . 5 |- ( ( ph /\ K e. Ring ) -> B = ( Base ` (mulGrp ` L ) ) )
17	9	adantlr 481	. . . . . 6 |- ( ( ( ph /\ K e. Ring ) /\ ( x e. B /\ y e. B ) ) -> ( x ( .r ` K ) y ) = ( x ( .r ` L ) y ) )
18		eqid 2238	. . . . . . . . 9 |- ( .r ` K ) = ( .r ` K )
19	2, 18	mgpplusgg 14221	. . . . . . . 8 |- ( K e. Ring -> ( .r ` K ) = ( +g ` (mulGrp ` K ) ) )
20	19	adantl 277	. . . . . . 7 |- ( ( ph /\ K e. Ring ) -> ( .r ` K ) = ( +g ` (mulGrp ` K ) ) )
21	20	oveqdr 6113	. . . . . 6 |- ( ( ( ph /\ K e. Ring ) /\ ( x e. B /\ y e. B ) ) -> ( x ( .r ` K ) y ) = ( x ( +g ` (mulGrp ` K ) ) y ) )
22		eqid 2238	. . . . . . . . 9 |- ( .r ` L ) = ( .r ` L )
23	12, 22	mgpplusgg 14221	. . . . . . . 8 |- ( L e. Ring -> ( .r ` L ) = ( +g ` (mulGrp ` L ) ) )
24	11, 23	syl 14	. . . . . . 7 |- ( ( ph /\ K e. Ring ) -> ( .r ` L ) = ( +g ` (mulGrp ` L ) ) )
25	24	oveqdr 6113	. . . . . 6 |- ( ( ( ph /\ K e. Ring ) /\ ( x e. B /\ y e. B ) ) -> ( x ( .r ` L ) y ) = ( x ( +g ` (mulGrp ` L ) ) y ) )
26	17, 21, 25	3eqtr3d 2279	. . . . 5 |- ( ( ( ph /\ K e. Ring ) /\ ( x e. B /\ y e. B ) ) -> ( x ( +g ` (mulGrp ` K ) ) y ) = ( x ( +g ` (mulGrp ` L ) ) y ) )
27	5, 16, 26	cmnpropd 14098	. . . 4 |- ( ( ph /\ K e. Ring ) -> ( (mulGrp ` K ) e. CMnd <-> (mulGrp ` L ) e. CMnd ) )
28	27	pm5.32da 456	. . 3 |- ( ph -> ( ( K e. Ring /\ (mulGrp ` K ) e. CMnd ) <-> ( K e. Ring /\ (mulGrp ` L ) e. CMnd ) ) )
29	10	anbi1d 469	. . 3 |- ( ph -> ( ( K e. Ring /\ (mulGrp ` L ) e. CMnd ) <-> ( L e. Ring /\ (mulGrp ` L ) e. CMnd ) ) )
30	28, 29	bitrd 188	. 2 |- ( ph -> ( ( K e. Ring /\ (mulGrp ` K ) e. CMnd ) <-> ( L e. Ring /\ (mulGrp ` L ) e. CMnd ) ) )
31	2	iscrng 14307	. 2 |- ( K e. CRing <-> ( K e. Ring /\ (mulGrp ` K ) e. CMnd ) )
32	12	iscrng 14307	. 2 |- ( L e. CRing <-> ( L e. Ring /\ (mulGrp ` L ) e. CMnd ) )
33	30, 31, 32	3bitr4g 223	1 |- ( ph -> ( K e. CRing <-> L e. CRing ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   ` cfv 5377  (class class class)co 6085   Basecbs 13352   +g cplusg 13431   .rcmulr 13432  CMndccmn 14087  mulGrpcmgp 14217   Ringcrg 14300   CRingccrg 14301

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-pre-ltirr 8291  ax-pre-ltadd 8295

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-inn 9305  df-2 9363  df-3 9364  df-ndx 13355  df-slot 13356  df-base 13358  df-sets 13359  df-plusg 13444  df-mulr 13445  df-0g 13612  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-grp 13808  df-cmn 14089  df-mgp 14218  df-ring 14302  df-cring 14303

This theorem is used by:  zncrng  14980