Theorem ringideu 14428

Description: The unity element of a ring is unique. (Contributed by NM, 27-Aug-2011.) (Revised by Mario Carneiro, 6-Jan-2015.)

Hypotheses

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

Assertion

Ref	Expression
ringideu	|- ( R e. Ring -> E! u e. B A. x e. B ( ( u .x. x ) = x /\ ( x .x. u ) = x ) )

Distinct variable groups:   x, B   x, R, u   u, B   u, R   u, .x. , x

Proof of Theorem ringideu

Step	Hyp	Ref	Expression
1		eqid 2238	. . . 4 |- (mulGrp ` R ) = (mulGrp ` R )
2	1	ringmgp 14413	. . 3 |- ( R e. Ring -> (mulGrp ` R ) e. Mnd )
3		eqid 2238	. . . 4 |- ( Base ` (mulGrp ` R ) ) = ( Base ` (mulGrp ` R ) )
4		eqid 2238	. . . 4 |- ( +g ` (mulGrp ` R ) ) = ( +g ` (mulGrp ` R ) )
5	3, 4	mndideu 13798	. . 3 |- ( (mulGrp ` R ) e. Mnd -> E! u e. ( Base ` (mulGrp ` R ) ) A. x e. ( Base ` (mulGrp ` R ) ) ( ( u ( +g ` (mulGrp ` R ) ) x ) = x /\ ( x ( +g ` (mulGrp ` R ) ) u ) = x ) )
6	2, 5	syl 14	. 2 |- ( R e. Ring -> E! u e. ( Base ` (mulGrp ` R ) ) A. x e. ( Base ` (mulGrp ` R ) ) ( ( u ( +g ` (mulGrp ` R ) ) x ) = x /\ ( x ( +g ` (mulGrp ` R ) ) u ) = x ) )
7		ringcl.b	. . . . . 6 |- B = ( Base ` R )
8	1, 7	mgpbasg 14331	. . . . 5 |- ( R e. Ring -> B = ( Base ` (mulGrp ` R ) ) )
9		ringcl.t	. . . . . . . . 9 |- .x. = ( .r ` R )
10	1, 9	mgpplusgg 14328	. . . . . . . 8 |- ( R e. Ring -> .x. = ( +g ` (mulGrp ` R ) ) )
11	10	oveqd 6105	. . . . . . 7 |- ( R e. Ring -> ( u .x. x ) = ( u ( +g ` (mulGrp ` R ) ) x ) )
12	11	eqeq1d 2247	. . . . . 6 |- ( R e. Ring -> ( ( u .x. x ) = x <-> ( u ( +g ` (mulGrp ` R ) ) x ) = x ) )
13	10	oveqd 6105	. . . . . . 7 |- ( R e. Ring -> ( x .x. u ) = ( x ( +g ` (mulGrp ` R ) ) u ) )
14	13	eqeq1d 2247	. . . . . 6 |- ( R e. Ring -> ( ( x .x. u ) = x <-> ( x ( +g ` (mulGrp ` R ) ) u ) = x ) )
15	12, 14	anbi12d 477	. . . . 5 |- ( R e. Ring -> ( ( ( u .x. x ) = x /\ ( x .x. u ) = x ) <-> ( ( u ( +g ` (mulGrp ` R ) ) x ) = x /\ ( x ( +g ` (mulGrp ` R ) ) u ) = x ) ) )
16	8, 15	raleqbidv 2765	. . . 4 |- ( R e. Ring -> ( A. x e. B ( ( u .x. x ) = x /\ ( x .x. u ) = x ) <-> A. x e. ( Base ` (mulGrp ` R ) ) ( ( u ( +g ` (mulGrp ` R ) ) x ) = x /\ ( x ( +g ` (mulGrp ` R ) ) u ) = x ) ) )
17	16	reubidv 2737	. . 3 |- ( R e. Ring -> ( E! u e. B A. x e. B ( ( u .x. x ) = x /\ ( x .x. u ) = x ) <-> E! u e. B A. x e. ( Base ` (mulGrp ` R ) ) ( ( u ( +g ` (mulGrp ` R ) ) x ) = x /\ ( x ( +g ` (mulGrp ` R ) ) u ) = x ) ) )
18		reueq1 2751	. . . 4 |- ( B = ( Base ` (mulGrp ` R ) ) -> ( E! u e. B A. x e. ( Base ` (mulGrp ` R ) ) ( ( u ( +g ` (mulGrp ` R ) ) x ) = x /\ ( x ( +g ` (mulGrp ` R ) ) u ) = x ) <-> E! u e. ( Base ` (mulGrp ` R ) ) A. x e. ( Base ` (mulGrp ` R ) ) ( ( u ( +g ` (mulGrp ` R ) ) x ) = x /\ ( x ( +g ` (mulGrp ` R ) ) u ) = x ) ) )
19	8, 18	syl 14	. . 3 |- ( R e. Ring -> ( E! u e. B A. x e. ( Base ` (mulGrp ` R ) ) ( ( u ( +g ` (mulGrp ` R ) ) x ) = x /\ ( x ( +g ` (mulGrp ` R ) ) u ) = x ) <-> E! u e. ( Base ` (mulGrp ` R ) ) A. x e. ( Base ` (mulGrp ` R ) ) ( ( u ( +g ` (mulGrp ` R ) ) x ) = x /\ ( x ( +g ` (mulGrp ` R ) ) u ) = x ) ) )
20	17, 19	bitrd 188	. 2 |- ( R e. Ring -> ( E! u e. B A. x e. B ( ( u .x. x ) = x /\ ( x .x. u ) = x ) <-> E! u e. ( Base ` (mulGrp ` R ) ) A. x e. ( Base ` (mulGrp ` R ) ) ( ( u ( +g ` (mulGrp ` R ) ) x ) = x /\ ( x ( +g ` (mulGrp ` R ) ) u ) = x ) ) )
21	6, 20	mpbird 167	1 |- ( R e. Ring -> E! u e. B A. x e. B ( ( u .x. x ) = x /\ ( x .x. u ) = x ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   A.wral 2528   E!wreu 2530   ` cfv 5380  (class class class)co 6088   Basecbs 13410   +g cplusg 13490   .rcmulr 13491   Mndcmnd 13788  mulGrpcmgp 14324   Ringcrg 14407

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 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-pre-ltirr 8297  ax-pre-ltadd 8301

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-reu 2535  df-rmo 2536  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 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-iota 5340  df-fun 5382  df-fn 5383  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-pnf 8368  df-mnf 8369  df-ltxr 8371  df-inn 9314  df-2 9372  df-3 9373  df-ndx 13413  df-slot 13414  df-base 13416  df-sets 13417  df-plusg 13503  df-mulr 13504  df-mgm 13735  df-sgrp 13776  df-mnd 13789  df-mgp 14325  df-ring 14409

This theorem is used by:  isringid  14437