ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  isringid Unicode version

Theorem isringid 14003
Description: Properties showing that an element  I is the unity element of a ring. (Contributed by NM, 7-Aug-2013.)
Hypotheses
Ref Expression
rngidm.b  |-  B  =  ( Base `  R
)
rngidm.t  |-  .x.  =  ( .r `  R )
rngidm.u  |-  .1.  =  ( 1r `  R )
Assertion
Ref Expression
isringid  |-  ( R  e.  Ring  ->  ( ( I  e.  B  /\  A. x  e.  B  ( ( I  .x.  x
)  =  x  /\  ( x  .x.  I )  =  x ) )  <-> 
.1.  =  I ) )
Distinct variable groups:    x, B    x, I    x, R    x,  .x.    x,  .1.

Proof of Theorem isringid
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 eqid 2229 . . 3  |-  ( Base `  (mulGrp `  R )
)  =  ( Base `  (mulGrp `  R )
)
2 eqid 2229 . . 3  |-  ( 0g
`  (mulGrp `  R )
)  =  ( 0g
`  (mulGrp `  R )
)
3 eqid 2229 . . 3  |-  ( +g  `  (mulGrp `  R )
)  =  ( +g  `  (mulGrp `  R )
)
4 rngidm.b . . . . . 6  |-  B  =  ( Base `  R
)
5 rngidm.t . . . . . 6  |-  .x.  =  ( .r `  R )
64, 5ringideu 13995 . . . . 5  |-  ( R  e.  Ring  ->  E! y  e.  B  A. x  e.  B  ( (
y  .x.  x )  =  x  /\  (
x  .x.  y )  =  x ) )
7 reurex 2750 . . . . 5  |-  ( E! y  e.  B  A. x  e.  B  (
( y  .x.  x
)  =  x  /\  ( x  .x.  y )  =  x )  ->  E. y  e.  B  A. x  e.  B  ( ( y  .x.  x )  =  x  /\  ( x  .x.  y )  =  x ) )
86, 7syl 14 . . . 4  |-  ( R  e.  Ring  ->  E. y  e.  B  A. x  e.  B  ( (
y  .x.  x )  =  x  /\  (
x  .x.  y )  =  x ) )
9 eqid 2229 . . . . . 6  |-  (mulGrp `  R )  =  (mulGrp `  R )
109, 4mgpbasg 13904 . . . . 5  |-  ( R  e.  Ring  ->  B  =  ( Base `  (mulGrp `  R ) ) )
119, 5mgpplusgg 13902 . . . . . . . . 9  |-  ( R  e.  Ring  ->  .x.  =  ( +g  `  (mulGrp `  R ) ) )
1211oveqd 6024 . . . . . . . 8  |-  ( R  e.  Ring  ->  ( y 
.x.  x )  =  ( y ( +g  `  (mulGrp `  R )
) x ) )
1312eqeq1d 2238 . . . . . . 7  |-  ( R  e.  Ring  ->  ( ( y  .x.  x )  =  x  <->  ( y
( +g  `  (mulGrp `  R ) ) x )  =  x ) )
1411oveqd 6024 . . . . . . . 8  |-  ( R  e.  Ring  ->  ( x 
.x.  y )  =  ( x ( +g  `  (mulGrp `  R )
) y ) )
1514eqeq1d 2238 . . . . . . 7  |-  ( R  e.  Ring  ->  ( ( x  .x.  y )  =  x  <->  ( x
( +g  `  (mulGrp `  R ) ) y )  =  x ) )
1613, 15anbi12d 473 . . . . . 6  |-  ( R  e.  Ring  ->  ( ( ( y  .x.  x
)  =  x  /\  ( x  .x.  y )  =  x )  <->  ( (
y ( +g  `  (mulGrp `  R ) ) x )  =  x  /\  ( x ( +g  `  (mulGrp `  R )
) y )  =  x ) ) )
1710, 16raleqbidv 2744 . . . . 5  |-  ( R  e.  Ring  ->  ( A. x  e.  B  (
( y  .x.  x
)  =  x  /\  ( x  .x.  y )  =  x )  <->  A. x  e.  ( Base `  (mulGrp `  R ) ) ( ( y ( +g  `  (mulGrp `  R )
) x )  =  x  /\  ( x ( +g  `  (mulGrp `  R ) ) y )  =  x ) ) )
1810, 17rexeqbidv 2745 . . . 4  |-  ( R  e.  Ring  ->  ( E. y  e.  B  A. x  e.  B  (
( y  .x.  x
)  =  x  /\  ( x  .x.  y )  =  x )  <->  E. y  e.  ( Base `  (mulGrp `  R ) ) A. x  e.  ( Base `  (mulGrp `  R )
) ( ( y ( +g  `  (mulGrp `  R ) ) x )  =  x  /\  ( x ( +g  `  (mulGrp `  R )
) y )  =  x ) ) )
198, 18mpbid 147 . . 3  |-  ( R  e.  Ring  ->  E. y  e.  ( Base `  (mulGrp `  R ) ) A. x  e.  ( Base `  (mulGrp `  R )
) ( ( y ( +g  `  (mulGrp `  R ) ) x )  =  x  /\  ( x ( +g  `  (mulGrp `  R )
) y )  =  x ) )
201, 2, 3, 19ismgmid 13425 . 2  |-  ( R  e.  Ring  ->  ( ( I  e.  ( Base `  (mulGrp `  R )
)  /\  A. x  e.  ( Base `  (mulGrp `  R ) ) ( ( I ( +g  `  (mulGrp `  R )
) x )  =  x  /\  ( x ( +g  `  (mulGrp `  R ) ) I )  =  x ) )  <->  ( 0g `  (mulGrp `  R ) )  =  I ) )
2110eleq2d 2299 . . 3  |-  ( R  e.  Ring  ->  ( I  e.  B  <->  I  e.  ( Base `  (mulGrp `  R
) ) ) )
2211oveqd 6024 . . . . . 6  |-  ( R  e.  Ring  ->  ( I 
.x.  x )  =  ( I ( +g  `  (mulGrp `  R )
) x ) )
2322eqeq1d 2238 . . . . 5  |-  ( R  e.  Ring  ->  ( ( I  .x.  x )  =  x  <->  ( I
( +g  `  (mulGrp `  R ) ) x )  =  x ) )
2411oveqd 6024 . . . . . 6  |-  ( R  e.  Ring  ->  ( x 
.x.  I )  =  ( x ( +g  `  (mulGrp `  R )
) I ) )
2524eqeq1d 2238 . . . . 5  |-  ( R  e.  Ring  ->  ( ( x  .x.  I )  =  x  <->  ( x
( +g  `  (mulGrp `  R ) ) I )  =  x ) )
2623, 25anbi12d 473 . . . 4  |-  ( R  e.  Ring  ->  ( ( ( I  .x.  x
)  =  x  /\  ( x  .x.  I )  =  x )  <->  ( (
I ( +g  `  (mulGrp `  R ) ) x )  =  x  /\  ( x ( +g  `  (mulGrp `  R )
) I )  =  x ) ) )
2710, 26raleqbidv 2744 . . 3  |-  ( R  e.  Ring  ->  ( A. x  e.  B  (
( I  .x.  x
)  =  x  /\  ( x  .x.  I )  =  x )  <->  A. x  e.  ( Base `  (mulGrp `  R ) ) ( ( I ( +g  `  (mulGrp `  R )
) x )  =  x  /\  ( x ( +g  `  (mulGrp `  R ) ) I )  =  x ) ) )
2821, 27anbi12d 473 . 2  |-  ( R  e.  Ring  ->  ( ( I  e.  B  /\  A. x  e.  B  ( ( I  .x.  x
)  =  x  /\  ( x  .x.  I )  =  x ) )  <-> 
( I  e.  (
Base `  (mulGrp `  R
) )  /\  A. x  e.  ( Base `  (mulGrp `  R )
) ( ( I ( +g  `  (mulGrp `  R ) ) x )  =  x  /\  ( x ( +g  `  (mulGrp `  R )
) I )  =  x ) ) ) )
29 rngidm.u . . . 4  |-  .1.  =  ( 1r `  R )
309, 29ringidvalg 13939 . . 3  |-  ( R  e.  Ring  ->  .1.  =  ( 0g `  (mulGrp `  R ) ) )
3130eqeq1d 2238 . 2  |-  ( R  e.  Ring  ->  (  .1.  =  I  <->  ( 0g `  (mulGrp `  R )
)  =  I ) )
3220, 28, 313bitr4d 220 1  |-  ( R  e.  Ring  ->  ( ( I  e.  B  /\  A. x  e.  B  ( ( I  .x.  x
)  =  x  /\  ( x  .x.  I )  =  x ) )  <-> 
.1.  =  I ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1395    e. wcel 2200   A.wral 2508   E.wrex 2509   E!wreu 2510   ` cfv 5318  (class class class)co 6007   Basecbs 13047   +g cplusg 13125   .rcmulr 13126   0gc0g 13304  mulGrpcmgp 13898   1rcur 13937   Ringcrg 13974
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8101  ax-resscn 8102  ax-1cn 8103  ax-1re 8104  ax-icn 8105  ax-addcl 8106  ax-addrcl 8107  ax-mulcl 8108  ax-addcom 8110  ax-addass 8112  ax-i2m1 8115  ax-0lt1 8116  ax-0id 8118  ax-rnegex 8119  ax-pre-ltirr 8122  ax-pre-ltadd 8126
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-fv 5326  df-riota 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-pnf 8194  df-mnf 8195  df-ltxr 8197  df-inn 9122  df-2 9180  df-3 9181  df-ndx 13050  df-slot 13051  df-base 13053  df-sets 13054  df-plusg 13138  df-mulr 13139  df-0g 13306  df-mgm 13404  df-sgrp 13450  df-mnd 13465  df-mgp 13899  df-ur 13938  df-ring 13976
This theorem is referenced by:  imasring  14042  subrg1  14210  cnfld1  14551
  Copyright terms: Public domain W3C validator