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

Theorem rnglz 13577
Description: The zero of a non-unital ring is a left-absorbing element. (Contributed by FL, 31-Aug-2009.) Generalization of ringlz 13675. (Revised by AV, 17-Apr-2020.)
Hypotheses
Ref Expression
rngcl.b  |-  B  =  ( Base `  R
)
rngcl.t  |-  .x.  =  ( .r `  R )
rnglz.z  |-  .0.  =  ( 0g `  R )
Assertion
Ref Expression
rnglz  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  (  .0.  .x.  X )  =  .0.  )

Proof of Theorem rnglz
StepHypRef Expression
1 rngabl 13567 . . . . . . 7  |-  ( R  e. Rng  ->  R  e.  Abel )
2 ablgrp 13495 . . . . . . 7  |-  ( R  e.  Abel  ->  R  e. 
Grp )
31, 2syl 14 . . . . . 6  |-  ( R  e. Rng  ->  R  e.  Grp )
4 rngcl.b . . . . . . 7  |-  B  =  ( Base `  R
)
5 rnglz.z . . . . . . 7  |-  .0.  =  ( 0g `  R )
64, 5grpidcl 13231 . . . . . 6  |-  ( R  e.  Grp  ->  .0.  e.  B )
7 eqid 2196 . . . . . . 7  |-  ( +g  `  R )  =  ( +g  `  R )
84, 7, 5grplid 13233 . . . . . 6  |-  ( ( R  e.  Grp  /\  .0.  e.  B )  -> 
(  .0.  ( +g  `  R )  .0.  )  =  .0.  )
93, 6, 8syl2anc2 412 . . . . 5  |-  ( R  e. Rng  ->  (  .0.  ( +g  `  R )  .0.  )  =  .0.  )
109adantr 276 . . . 4  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  (  .0.  ( +g  `  R
)  .0.  )  =  .0.  )
1110oveq1d 5940 . . 3  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  (
(  .0.  ( +g  `  R )  .0.  )  .x.  X )  =  (  .0.  .x.  X )
)
12 simpl 109 . . . 4  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  R  e. Rng )
133, 6syl 14 . . . . . . 7  |-  ( R  e. Rng  ->  .0.  e.  B
)
1413, 13jca 306 . . . . . 6  |-  ( R  e. Rng  ->  (  .0.  e.  B  /\  .0.  e.  B
) )
1514anim1i 340 . . . . 5  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  (
(  .0.  e.  B  /\  .0.  e.  B )  /\  X  e.  B
) )
16 df-3an 982 . . . . 5  |-  ( (  .0.  e.  B  /\  .0.  e.  B  /\  X  e.  B )  <->  ( (  .0.  e.  B  /\  .0.  e.  B )  /\  X  e.  B ) )
1715, 16sylibr 134 . . . 4  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  (  .0.  e.  B  /\  .0.  e.  B  /\  X  e.  B ) )
18 rngcl.t . . . . 5  |-  .x.  =  ( .r `  R )
194, 7, 18rngdir 13573 . . . 4  |-  ( ( R  e. Rng  /\  (  .0.  e.  B  /\  .0.  e.  B  /\  X  e.  B ) )  -> 
( (  .0.  ( +g  `  R )  .0.  )  .x.  X )  =  ( (  .0. 
.x.  X ) ( +g  `  R ) (  .0.  .x.  X
) ) )
2012, 17, 19syl2anc 411 . . 3  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  (
(  .0.  ( +g  `  R )  .0.  )  .x.  X )  =  ( (  .0.  .x.  X
) ( +g  `  R
) (  .0.  .x.  X ) ) )
213adantr 276 . . . 4  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  R  e.  Grp )
2213adantr 276 . . . . 5  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  .0.  e.  B )
23 simpr 110 . . . . 5  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  X  e.  B )
244, 18rngcl 13576 . . . . 5  |-  ( ( R  e. Rng  /\  .0.  e.  B  /\  X  e.  B )  ->  (  .0.  .x.  X )  e.  B )
2512, 22, 23, 24syl3anc 1249 . . . 4  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  (  .0.  .x.  X )  e.  B )
264, 7, 5grprid 13234 . . . . 5  |-  ( ( R  e.  Grp  /\  (  .0.  .x.  X )  e.  B )  ->  (
(  .0.  .x.  X
) ( +g  `  R
)  .0.  )  =  (  .0.  .x.  X
) )
2726eqcomd 2202 . . . 4  |-  ( ( R  e.  Grp  /\  (  .0.  .x.  X )  e.  B )  ->  (  .0.  .x.  X )  =  ( (  .0.  .x.  X ) ( +g  `  R )  .0.  )
)
2821, 25, 27syl2anc 411 . . 3  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  (  .0.  .x.  X )  =  ( (  .0.  .x.  X ) ( +g  `  R )  .0.  )
)
2911, 20, 283eqtr3d 2237 . 2  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  (
(  .0.  .x.  X
) ( +g  `  R
) (  .0.  .x.  X ) )  =  ( (  .0.  .x.  X ) ( +g  `  R )  .0.  )
)
304, 7grplcan 13264 . . 3  |-  ( ( R  e.  Grp  /\  ( (  .0.  .x.  X )  e.  B  /\  .0.  e.  B  /\  (  .0.  .x.  X )  e.  B ) )  -> 
( ( (  .0. 
.x.  X ) ( +g  `  R ) (  .0.  .x.  X
) )  =  ( (  .0.  .x.  X
) ( +g  `  R
)  .0.  )  <->  (  .0.  .x. 
X )  =  .0.  ) )
3121, 25, 22, 25, 30syl13anc 1251 . 2  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  (
( (  .0.  .x.  X ) ( +g  `  R ) (  .0. 
.x.  X ) )  =  ( (  .0. 
.x.  X ) ( +g  `  R )  .0.  )  <->  (  .0.  .x. 
X )  =  .0.  ) )
3229, 31mpbid 147 1  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  (  .0.  .x.  X )  =  .0.  )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 980    = wceq 1364    e. wcel 2167   ` cfv 5259  (class class class)co 5925   Basecbs 12703   +g cplusg 12780   .rcmulr 12781   0gc0g 12958   Grpcgrp 13202   Abelcabl 13491  Rngcrng 13564
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-addcom 7996  ax-addass 7998  ax-i2m1 8001  ax-0lt1 8002  ax-0id 8004  ax-rnegex 8005  ax-pre-ltirr 8008  ax-pre-ltadd 8012
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-pnf 8080  df-mnf 8081  df-ltxr 8083  df-inn 9008  df-2 9066  df-3 9067  df-ndx 12706  df-slot 12707  df-base 12709  df-sets 12710  df-plusg 12793  df-mulr 12794  df-0g 12960  df-mgm 13058  df-sgrp 13104  df-mnd 13119  df-grp 13205  df-minusg 13206  df-abl 13493  df-mgp 13553  df-rng 13565
This theorem is referenced by:  rngmneg1  13579
  Copyright terms: Public domain W3C validator