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

Theorem rnglz 13822
Description: The zero of a non-unital ring is a left-absorbing element. (Contributed by FL, 31-Aug-2009.) Generalization of ringlz 13920. (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 13812 . . . . . . 7  |-  ( R  e. Rng  ->  R  e.  Abel )
2 ablgrp 13740 . . . . . . 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 13476 . . . . . 6  |-  ( R  e.  Grp  ->  .0.  e.  B )
7 eqid 2207 . . . . . . 7  |-  ( +g  `  R )  =  ( +g  `  R )
84, 7, 5grplid 13478 . . . . . 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 5982 . . 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 983 . . . . 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 13818 . . . 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 13821 . . . . 5  |-  ( ( R  e. Rng  /\  .0.  e.  B  /\  X  e.  B )  ->  (  .0.  .x.  X )  e.  B )
2512, 22, 23, 24syl3anc 1250 . . . 4  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  (  .0.  .x.  X )  e.  B )
264, 7, 5grprid 13479 . . . . 5  |-  ( ( R  e.  Grp  /\  (  .0.  .x.  X )  e.  B )  ->  (
(  .0.  .x.  X
) ( +g  `  R
)  .0.  )  =  (  .0.  .x.  X
) )
2726eqcomd 2213 . . . 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 2248 . 2  |-  ( ( R  e. Rng  /\  X  e.  B )  ->  (
(  .0.  .x.  X
) ( +g  `  R
) (  .0.  .x.  X ) )  =  ( (  .0.  .x.  X ) ( +g  `  R )  .0.  )
)
304, 7grplcan 13509 . . 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 1252 . 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 981    = wceq 1373    e. wcel 2178   ` cfv 5290  (class class class)co 5967   Basecbs 12947   +g cplusg 13024   .rcmulr 13025   0gc0g 13203   Grpcgrp 13447   Abelcabl 13736  Rngcrng 13809
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-coll 4175  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-cnex 8051  ax-resscn 8052  ax-1cn 8053  ax-1re 8054  ax-icn 8055  ax-addcl 8056  ax-addrcl 8057  ax-mulcl 8058  ax-addcom 8060  ax-addass 8062  ax-i2m1 8065  ax-0lt1 8066  ax-0id 8068  ax-rnegex 8069  ax-pre-ltirr 8072  ax-pre-ltadd 8076
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-nel 2474  df-ral 2491  df-rex 2492  df-reu 2493  df-rmo 2494  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-nul 3469  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-int 3900  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-riota 5922  df-ov 5970  df-oprab 5971  df-mpo 5972  df-pnf 8144  df-mnf 8145  df-ltxr 8147  df-inn 9072  df-2 9130  df-3 9131  df-ndx 12950  df-slot 12951  df-base 12953  df-sets 12954  df-plusg 13037  df-mulr 13038  df-0g 13205  df-mgm 13303  df-sgrp 13349  df-mnd 13364  df-grp 13450  df-minusg 13451  df-abl 13738  df-mgp 13798  df-rng 13810
This theorem is referenced by:  rngmneg1  13824
  Copyright terms: Public domain W3C validator