Theorem rnglz 13254

Description: The zero of a non-unital ring is a left-absorbing element. (Contributed by FL, 31-Aug-2009.) Generalization of ringlz 13352. (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

Step	Hyp	Ref	Expression
1		rngabl 13244	. . . . . . 7 |- ( R e. Rng -> R e. Abel )
2		ablgrp 13183	. . . . . . 7 |- ( R e. Abel -> R e. Grp )
3	1, 2	syl 14	. . . . . 6 |- ( R e. Rng -> R e. Grp )
4		rngcl.b	. . . . . . 7 |- B = ( Base ` R )
5		rnglz.z	. . . . . . 7 |- .0. = ( 0g ` R )
6	4, 5	grpidcl 12934	. . . . . 6 |- ( R e. Grp -> .0. e. B )
7		eqid 2187	. . . . . . 7 |- ( +g ` R ) = ( +g ` R )
8	4, 7, 5	grplid 12936	. . . . . 6 |- ( ( R e. Grp /\ .0. e. B ) -> ( .0. ( +g ` R ) .0. ) = .0. )
9	3, 6, 8	syl2anc2 412	. . . . 5 |- ( R e. Rng -> ( .0. ( +g ` R ) .0. ) = .0. )
10	9	adantr 276	. . . 4 |- ( ( R e. Rng /\ X e. B ) -> ( .0. ( +g ` R ) .0. ) = .0. )
11	10	oveq1d 5903	. . 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 )
13	3, 6	syl 14	. . . . . . 7 |- ( R e. Rng -> .0. e. B )
14	13, 13	jca 306	. . . . . 6 |- ( R e. Rng -> ( .0. e. B /\ .0. e. B ) )
15	14	anim1i 340	. . . . 5 |- ( ( R e. Rng /\ X e. B ) -> ( ( .0. e. B /\ .0. e. B ) /\ X e. B ) )
16		df-3an 981	. . . . 5 |- ( ( .0. e. B /\ .0. e. B /\ X e. B ) <-> ( ( .0. e. B /\ .0. e. B ) /\ X e. B ) )
17	15, 16	sylibr 134	. . . 4 |- ( ( R e. Rng /\ X e. B ) -> ( .0. e. B /\ .0. e. B /\ X e. B ) )
18		rngcl.t	. . . . 5 |- .x. = ( .r ` R )
19	4, 7, 18	rngdir 13250	. . . 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 ) ) )
20	12, 17, 19	syl2anc 411	. . 3 |- ( ( R e. Rng /\ X e. B ) -> ( ( .0. ( +g ` R ) .0. ) .x. X ) = ( ( .0. .x. X ) ( +g ` R ) ( .0. .x. X ) ) )
21	3	adantr 276	. . . 4 |- ( ( R e. Rng /\ X e. B ) -> R e. Grp )
22	13	adantr 276	. . . . 5 |- ( ( R e. Rng /\ X e. B ) -> .0. e. B )
23		simpr 110	. . . . 5 |- ( ( R e. Rng /\ X e. B ) -> X e. B )
24	4, 18	rngcl 13253	. . . . 5 |- ( ( R e. Rng /\ .0. e. B /\ X e. B ) -> ( .0. .x. X ) e. B )
25	12, 22, 23, 24	syl3anc 1248	. . . 4 |- ( ( R e. Rng /\ X e. B ) -> ( .0. .x. X ) e. B )
26	4, 7, 5	grprid 12937	. . . . 5 |- ( ( R e. Grp /\ ( .0. .x. X ) e. B ) -> ( ( .0. .x. X ) ( +g ` R ) .0. ) = ( .0. .x. X ) )
27	26	eqcomd 2193	. . . 4 |- ( ( R e. Grp /\ ( .0. .x. X ) e. B ) -> ( .0. .x. X ) = ( ( .0. .x. X ) ( +g ` R ) .0. ) )
28	21, 25, 27	syl2anc 411	. . 3 |- ( ( R e. Rng /\ X e. B ) -> ( .0. .x. X ) = ( ( .0. .x. X ) ( +g ` R ) .0. ) )
29	11, 20, 28	3eqtr3d 2228	. 2 |- ( ( R e. Rng /\ X e. B ) -> ( ( .0. .x. X ) ( +g ` R ) ( .0. .x. X ) ) = ( ( .0. .x. X ) ( +g ` R ) .0. ) )
30	4, 7	grplcan 12967	. . 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. ) )
31	21, 25, 22, 25, 30	syl13anc 1250	. 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. ) )
32	29, 31	mpbid 147	1 |- ( ( R e. Rng /\ X e. B ) -> ( .0. .x. X ) = .0. )

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   Abelcabl 13179  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-coll 4130  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-iun 3900  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-ima 4651  df-iota 5190  df-fun 5230  df-fn 5231  df-f 5232  df-f1 5233  df-fo 5234  df-f1o 5235  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-minusg 12910  df-abl 13181  df-mgp 13230  df-rng 13242

This theorem is referenced by:  rngmneg1  13256