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

Theorem rngrz 13255
Description: The zero of a non-unital ring is a right-absorbing element. (Contributed by FL, 31-Aug-2009.) Generalization of ringrz 13353. (Revised by AV, 16-Feb-2025.)
Hypotheses
Ref Expression
rngcl.b  |-  B  =  ( Base `  R
)
rngcl.t  |-  .x.  =  ( .r `  R )
rnglz.z  |-  .0.  =  ( 0g `  R )
Assertion
Ref Expression
rngrz  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  ( X  .x.  .0.  )  =  .0.  )

Proof of Theorem rngrz
StepHypRef Expression
1 rnggrp 13247 . . . . . 6  |-  ( R  e. Rng  ->  R  e.  Grp )
2 rngcl.b . . . . . . 7  |-  B  =  ( Base `  R
)
3 rnglz.z . . . . . . 7  |-  .0.  =  ( 0g `  R )
42, 3grpidcl 12934 . . . . . 6  |-  ( R  e.  Grp  ->  .0.  e.  B )
5 eqid 2187 . . . . . . 7  |-  ( +g  `  R )  =  ( +g  `  R )
62, 5, 3grplid 12936 . . . . . 6  |-  ( ( R  e.  Grp  /\  .0.  e.  B )  -> 
(  .0.  ( +g  `  R )  .0.  )  =  .0.  )
71, 4, 6syl2anc2 412 . . . . 5  |-  ( R  e. Rng  ->  (  .0.  ( +g  `  R )  .0.  )  =  .0.  )
87adantr 276 . . . 4  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  (  .0.  ( +g  `  R
)  .0.  )  =  .0.  )
98oveq2d 5904 . . 3  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  ( X  .x.  (  .0.  ( +g  `  R )  .0.  ) )  =  ( X  .x.  .0.  )
)
10 simpr 110 . . . . 5  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  X  e.  B )
112, 3rng0cl 13252 . . . . . 6  |-  ( R  e. Rng  ->  .0.  e.  B
)
1211adantr 276 . . . . 5  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  .0.  e.  B )
1310, 12, 123jca 1178 . . . 4  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  ( X  e.  B  /\  .0.  e.  B  /\  .0.  e.  B ) )
14 rngcl.t . . . . 5  |-  .x.  =  ( .r `  R )
152, 5, 14rngdi 13249 . . . 4  |-  ( ( R  e. Rng  /\  ( 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. Rng  /\  X  e.  B )  ->  ( X  .x.  (  .0.  ( +g  `  R )  .0.  ) )  =  ( ( X  .x.  .0.  ) ( +g  `  R
) ( X  .x.  .0.  ) ) )
171adantr 276 . . . 4  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  R  e.  Grp )
182, 14rngcl 13253 . . . . 5  |-  ( ( R  e. Rng  /\  X  e.  B  /\  .0.  e.  B )  ->  ( X  .x.  .0.  )  e.  B )
1912, 18mpd3an3 1348 . . . 4  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  ( X  .x.  .0.  )  e.  B )
202, 5, 3grplid 12936 . . . . 5  |-  ( ( R  e.  Grp  /\  ( X  .x.  .0.  )  e.  B )  ->  (  .0.  ( +g  `  R
) ( X  .x.  .0.  ) )  =  ( X  .x.  .0.  )
)
2120eqcomd 2193 . . . 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. Rng  /\  X  e.  B )  ->  ( X  .x.  .0.  )  =  (  .0.  ( +g  `  R ) ( X 
.x.  .0.  ) )
)
239, 16, 223eqtr3d 2228 . 2  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  (
( X  .x.  .0.  ) ( +g  `  R
) ( X  .x.  .0.  ) )  =  (  .0.  ( +g  `  R
) ( X  .x.  .0.  ) ) )
242, 5grprcan 12942 . . 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 1250 . 2  |-  ( ( R  e. Rng  /\  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. Rng  /\  X  e.  B )  ->  ( X  .x.  .0.  )  =  .0.  )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 979    = wceq 1363    e. wcel 2158   ` cfv 5228  (class class class)co 5888   Basecbs 12476   +g cplusg 12551   .rcmulr 12552   0gc0g 12723   Grpcgrp 12906  Rngcrng 13241
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 615  ax-in2 616  ax-io 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-13 2160  ax-14 2161  ax-ext 2169  ax-sep 4133  ax-pow 4186  ax-pr 4221  ax-un 4445  ax-setind 4548  ax-cnex 7916  ax-resscn 7917  ax-1cn 7918  ax-1re 7919  ax-icn 7920  ax-addcl 7921  ax-addrcl 7922  ax-mulcl 7923  ax-addcom 7925  ax-addass 7927  ax-i2m1 7930  ax-0lt1 7931  ax-0id 7933  ax-rnegex 7934  ax-pre-ltirr 7937  ax-pre-ltadd 7941
This theorem depends on definitions:  df-bi 117  df-3an 981  df-tru 1366  df-fal 1369  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ne 2358  df-nel 2453  df-ral 2470  df-rex 2471  df-reu 2472  df-rmo 2473  df-rab 2474  df-v 2751  df-sbc 2975  df-csb 3070  df-dif 3143  df-un 3145  df-in 3147  df-ss 3154  df-nul 3435  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-uni 3822  df-int 3857  df-br 4016  df-opab 4077  df-mpt 4078  df-id 4305  df-xp 4644  df-rel 4645  df-cnv 4646  df-co 4647  df-dm 4648  df-rn 4649  df-res 4650  df-iota 5190  df-fun 5230  df-fn 5231  df-fv 5236  df-riota 5844  df-ov 5891  df-oprab 5892  df-mpo 5893  df-pnf 8008  df-mnf 8009  df-ltxr 8011  df-inn 8934  df-2 8992  df-3 8993  df-ndx 12479  df-slot 12480  df-base 12482  df-sets 12483  df-plusg 12564  df-mulr 12565  df-0g 12725  df-mgm 12794  df-sgrp 12827  df-mnd 12840  df-grp 12909  df-abl 13181  df-mgp 13230  df-rng 13242
This theorem is referenced by:  rngmneg2  13257
  Copyright terms: Public domain W3C validator