Theorem iscrng2 13203

Description: A commutative ring is a ring whose multiplication is a commutative monoid. (Contributed by Mario Carneiro, 15-Jun-2015.)

Hypotheses

Ref	Expression
ringcl.b	|- B = ( Base ` R )
ringcl.t	|- .x. = ( .r ` R )

Assertion

Ref	Expression
iscrng2	|- ( R e. CRing <-> ( R e. Ring /\ A. x e. B A. y e. B ( x .x. y ) = ( y .x. x ) ) )

Distinct variable groups:   x, y, B   x, R, y

Allowed substitution hints:   .x. ( x, y)

Proof of Theorem iscrng2

Step	Hyp	Ref	Expression
1		elex 2750	. 2 |- ( R e. CRing -> R e. _V )
2		elex 2750	. . 3 |- ( R e. Ring -> R e. _V )
3	2	adantr 276	. 2 |- ( ( R e. Ring /\ A. x e. B A. y e. B ( x .x. y ) = ( y .x. x ) ) -> R e. _V )
4		eqid 2177	. . . 4 |- (mulGrp ` R ) = (mulGrp ` R )
5	4	iscrng 13191	. . 3 |- ( R e. CRing <-> ( R e. Ring /\ (mulGrp ` R ) e. CMnd ) )
6	4	ringmgp 13190	. . . . 5 |- ( R e. Ring -> (mulGrp ` R ) e. Mnd )
7		eqid 2177	. . . . . . . 8 |- ( Base ` (mulGrp ` R ) ) = ( Base ` (mulGrp ` R ) )
8		eqid 2177	. . . . . . . 8 |- ( +g ` (mulGrp ` R ) ) = ( +g ` (mulGrp ` R ) )
9	7, 8	iscmn 13101	. . . . . . 7 |- ( (mulGrp ` R ) e. CMnd <-> ( (mulGrp ` R ) e. Mnd /\ A. x e. ( Base ` (mulGrp ` R ) ) A. y e. ( Base ` (mulGrp ` R ) ) ( x ( +g ` (mulGrp ` R ) ) y ) = ( y ( +g ` (mulGrp ` R ) ) x ) ) )
10		ringcl.b	. . . . . . . . . 10 |- B = ( Base ` R )
11	4, 10	mgpbasg 13141	. . . . . . . . 9 |- ( R e. _V -> B = ( Base ` (mulGrp ` R ) ) )
12		ringcl.t	. . . . . . . . . . . . 13 |- .x. = ( .r ` R )
13	4, 12	mgpplusgg 13139	. . . . . . . . . . . 12 |- ( R e. _V -> .x. = ( +g ` (mulGrp ` R ) ) )
14	13	oveqd 5894	. . . . . . . . . . 11 |- ( R e. _V -> ( x .x. y ) = ( x ( +g ` (mulGrp ` R ) ) y ) )
15	13	oveqd 5894	. . . . . . . . . . 11 |- ( R e. _V -> ( y .x. x ) = ( y ( +g ` (mulGrp ` R ) ) x ) )
16	14, 15	eqeq12d 2192	. . . . . . . . . 10 |- ( R e. _V -> ( ( x .x. y ) = ( y .x. x ) <-> ( x ( +g ` (mulGrp ` R ) ) y ) = ( y ( +g ` (mulGrp ` R ) ) x ) ) )
17	11, 16	raleqbidv 2685	. . . . . . . . 9 |- ( R e. _V -> ( A. y e. B ( x .x. y ) = ( y .x. x ) <-> A. y e. ( Base ` (mulGrp ` R ) ) ( x ( +g ` (mulGrp ` R ) ) y ) = ( y ( +g ` (mulGrp ` R ) ) x ) ) )
18	11, 17	raleqbidv 2685	. . . . . . . 8 |- ( R e. _V -> ( A. x e. B A. y e. B ( x .x. y ) = ( y .x. x ) <-> A. x e. ( Base ` (mulGrp ` R ) ) A. y e. ( Base ` (mulGrp ` R ) ) ( x ( +g ` (mulGrp ` R ) ) y ) = ( y ( +g ` (mulGrp ` R ) ) x ) ) )
19	18	anbi2d 464	. . . . . . 7 |- ( R e. _V -> ( ( (mulGrp ` R ) e. Mnd /\ A. x e. B A. y e. B ( x .x. y ) = ( y .x. x ) ) <-> ( (mulGrp ` R ) e. Mnd /\ A. x e. ( Base ` (mulGrp ` R ) ) A. y e. ( Base ` (mulGrp ` R ) ) ( x ( +g ` (mulGrp ` R ) ) y ) = ( y ( +g ` (mulGrp ` R ) ) x ) ) ) )
20	9, 19	bitr4id 199	. . . . . 6 |- ( R e. _V -> ( (mulGrp ` R ) e. CMnd <-> ( (mulGrp ` R ) e. Mnd /\ A. x e. B A. y e. B ( x .x. y ) = ( y .x. x ) ) ) )
21	20	baibd 923	. . . . 5 |- ( ( R e. _V /\ (mulGrp ` R ) e. Mnd ) -> ( (mulGrp ` R ) e. CMnd <-> A. x e. B A. y e. B ( x .x. y ) = ( y .x. x ) ) )
22	6, 21	sylan2 286	. . . 4 |- ( ( R e. _V /\ R e. Ring ) -> ( (mulGrp ` R ) e. CMnd <-> A. x e. B A. y e. B ( x .x. y ) = ( y .x. x ) ) )
23	22	pm5.32da 452	. . 3 |- ( R e. _V -> ( ( R e. Ring /\ (mulGrp ` R ) e. CMnd ) <-> ( R e. Ring /\ A. x e. B A. y e. B ( x .x. y ) = ( y .x. x ) ) ) )
24	5, 23	bitrid 192	. 2 |- ( R e. _V -> ( R e. CRing <-> ( R e. Ring /\ A. x e. B A. y e. B ( x .x. y ) = ( y .x. x ) ) ) )
25	1, 3, 24	pm5.21nii 704	1 |- ( R e. CRing <-> ( R e. Ring /\ A. x e. B A. y e. B ( x .x. y ) = ( y .x. x ) ) )

Syntax hints:   /\ wa 104   <-> wb 105   = wceq 1353   e. wcel 2148   A.wral 2455   _Vcvv 2739   ` cfv 5218  (class class class)co 5877   Basecbs 12464   +g cplusg 12538   .rcmulr 12539   Mndcmnd 12822  CMndccmn 13093  mulGrpcmgp 13135   Ringcrg 13184   CRingccrg 13185

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-cnex 7904  ax-resscn 7905  ax-1cn 7906  ax-1re 7907  ax-icn 7908  ax-addcl 7909  ax-addrcl 7910  ax-mulcl 7911  ax-addcom 7913  ax-addass 7915  ax-i2m1 7918  ax-0lt1 7919  ax-0id 7921  ax-rnegex 7922  ax-pre-ltirr 7925  ax-pre-ltadd 7929

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-iota 5180  df-fun 5220  df-fn 5221  df-fv 5226  df-ov 5880  df-oprab 5881  df-mpo 5882  df-pnf 7996  df-mnf 7997  df-ltxr 7999  df-inn 8922  df-2 8980  df-3 8981  df-ndx 12467  df-slot 12468  df-base 12470  df-sets 12471  df-plusg 12551  df-mulr 12552  df-cmn 13095  df-mgp 13136  df-ring 13186  df-cring 13187

This theorem is referenced by: (None)