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

Theorem ringrz 14188
Description: The zero of a unital ring is a right-absorbing element. (Contributed by FL, 31-Aug-2009.)
Hypotheses
Ref Expression
rngz.b  |-  B  =  ( Base `  R
)
rngz.t  |-  .x.  =  ( .r `  R )
rngz.z  |-  .0.  =  ( 0g `  R )
Assertion
Ref Expression
ringrz  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  ( X  .x.  .0.  )  =  .0.  )

Proof of Theorem ringrz
StepHypRef Expression
1 ringgrp 14145 . . . . . 6  |-  ( R  e.  Ring  ->  R  e. 
Grp )
2 rngz.b . . . . . . 7  |-  B  =  ( Base `  R
)
3 rngz.z . . . . . . 7  |-  .0.  =  ( 0g `  R )
42, 3grpidcl 13742 . . . . . 6  |-  ( R  e.  Grp  ->  .0.  e.  B )
5 eqid 2232 . . . . . . 7  |-  ( +g  `  R )  =  ( +g  `  R )
62, 5, 3grplid 13744 . . . . . 6  |-  ( ( R  e.  Grp  /\  .0.  e.  B )  -> 
(  .0.  ( +g  `  R )  .0.  )  =  .0.  )
71, 4, 6syl2anc2 412 . . . . 5  |-  ( R  e.  Ring  ->  (  .0.  ( +g  `  R
)  .0.  )  =  .0.  )
87adantr 276 . . . 4  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  (  .0.  ( +g  `  R
)  .0.  )  =  .0.  )
98oveq2d 6066 . . 3  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  ( X  .x.  (  .0.  ( +g  `  R )  .0.  ) )  =  ( X  .x.  .0.  )
)
10 simpr 110 . . . . 5  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  X  e.  B )
111, 4syl 14 . . . . . 6  |-  ( R  e.  Ring  ->  .0.  e.  B )
1211adantr 276 . . . . 5  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  .0.  e.  B )
1310, 12, 123jca 1204 . . . 4  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  ( X  e.  B  /\  .0.  e.  B  /\  .0.  e.  B ) )
14 rngz.t . . . . 5  |-  .x.  =  ( .r `  R )
152, 5, 14ringdi 14162 . . . 4  |-  ( ( R  e.  Ring  /\  ( X  e.  B  /\  .0.  e.  B  /\  .0.  e.  B ) )  -> 
( X  .x.  (  .0.  ( +g  `  R
)  .0.  ) )  =  ( ( X 
.x.  .0.  ) ( +g  `  R ) ( X  .x.  .0.  )
) )
1613, 15syldan 282 . . 3  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  ( X  .x.  (  .0.  ( +g  `  R )  .0.  ) )  =  ( ( X  .x.  .0.  ) ( +g  `  R
) ( X  .x.  .0.  ) ) )
171adantr 276 . . . 4  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  R  e.  Grp )
182, 14ringcl 14157 . . . . 5  |-  ( ( R  e.  Ring  /\  X  e.  B  /\  .0.  e.  B )  ->  ( X  .x.  .0.  )  e.  B )
1912, 18mpd3an3 1375 . . . 4  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  ( X  .x.  .0.  )  e.  B )
202, 5, 3grplid 13744 . . . . 5  |-  ( ( R  e.  Grp  /\  ( X  .x.  .0.  )  e.  B )  ->  (  .0.  ( +g  `  R
) ( X  .x.  .0.  ) )  =  ( X  .x.  .0.  )
)
2120eqcomd 2238 . . . 4  |-  ( ( R  e.  Grp  /\  ( X  .x.  .0.  )  e.  B )  ->  ( X  .x.  .0.  )  =  (  .0.  ( +g  `  R ) ( X 
.x.  .0.  ) )
)
2217, 19, 21syl2anc 411 . . 3  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  ( X  .x.  .0.  )  =  (  .0.  ( +g  `  R ) ( X 
.x.  .0.  ) )
)
239, 16, 223eqtr3d 2273 . 2  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  (
( X  .x.  .0.  ) ( +g  `  R
) ( X  .x.  .0.  ) )  =  (  .0.  ( +g  `  R
) ( X  .x.  .0.  ) ) )
242, 5grprcan 13750 . . 3  |-  ( ( R  e.  Grp  /\  ( ( X  .x.  .0.  )  e.  B  /\  .0.  e.  B  /\  ( X  .x.  .0.  )  e.  B ) )  -> 
( ( ( X 
.x.  .0.  ) ( +g  `  R ) ( X  .x.  .0.  )
)  =  (  .0.  ( +g  `  R
) ( X  .x.  .0.  ) )  <->  ( X  .x.  .0.  )  =  .0.  ) )
2517, 19, 12, 19, 24syl13anc 1276 . 2  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  (
( ( X  .x.  .0.  ) ( +g  `  R
) ( X  .x.  .0.  ) )  =  (  .0.  ( +g  `  R
) ( X  .x.  .0.  ) )  <->  ( X  .x.  .0.  )  =  .0.  ) )
2623, 25mpbid 147 1  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  ( X  .x.  .0.  )  =  .0.  )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1005    = wceq 1398    e. wcel 2203   ` cfv 5352  (class class class)co 6050   Basecbs 13212   +g cplusg 13290   .rcmulr 13291   0gc0g 13469   Grpcgrp 13713   Ringcrg 14140
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-addcom 8227  ax-addass 8229  ax-i2m1 8232  ax-0lt1 8233  ax-0id 8235  ax-rnegex 8236  ax-pre-ltirr 8239  ax-pre-ltadd 8243
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-iota 5312  df-fun 5354  df-fn 5355  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-pnf 8310  df-mnf 8311  df-ltxr 8313  df-inn 9238  df-2 9296  df-3 9297  df-ndx 13215  df-slot 13216  df-base 13218  df-sets 13219  df-plusg 13303  df-mulr 13304  df-0g 13471  df-mgm 13569  df-sgrp 13615  df-mnd 13630  df-grp 13716  df-mgp 14065  df-ring 14142
This theorem is referenced by:  ringrzd  14190  ringsrg  14191  ringinvnz1ne0  14193  ringinvnzdiv  14194  ringnegr  14196  dvdsr02  14250  rrgeq0  14410  unitrrg  14413  domneq0  14418  lmodvs0  14470
  Copyright terms: Public domain W3C validator