Theorem rnglz 13511

Description: The zero of a non-unital ring is a left-absorbing element. (Contributed by FL, 31-Aug-2009.) Generalization of ringlz 13609. (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 13501	. . . . . . 7 |- ( R e. Rng -> R e. Abel )
2		ablgrp 13429	. . . . . . 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 13171	. . . . . 6 |- ( R e. Grp -> .0. e. B )
7		eqid 2196	. . . . . . 7 |- ( +g ` R ) = ( +g ` R )
8	4, 7, 5	grplid 13173	. . . . . 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 5938	. . 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 982	. . . . 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 13507	. . . 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 13510	. . . . 5 |- ( ( R e. Rng /\ .0. e. B /\ X e. B ) -> ( .0. .x. X ) e. B )
25	12, 22, 23, 24	syl3anc 1249	. . . 4 |- ( ( R e. Rng /\ X e. B ) -> ( .0. .x. X ) e. B )
26	4, 7, 5	grprid 13174	. . . . 5 |- ( ( R e. Grp /\ ( .0. .x. X ) e. B ) -> ( ( .0. .x. X ) ( +g ` R ) .0. ) = ( .0. .x. X ) )
27	26	eqcomd 2202	. . . 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 2237	. 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 13204	. . 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 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. ) )
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 980   = wceq 1364   e. wcel 2167   ` cfv 5259  (class class class)co 5923   Basecbs 12688   +g cplusg 12765   .rcmulr 12766   0gc0g 12937   Grpcgrp 13142   Abelcabl 13425  Rngcrng 13498

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 7972  ax-resscn 7973  ax-1cn 7974  ax-1re 7975  ax-icn 7976  ax-addcl 7977  ax-addrcl 7978  ax-mulcl 7979  ax-addcom 7981  ax-addass 7983  ax-i2m1 7986  ax-0lt1 7987  ax-0id 7989  ax-rnegex 7990  ax-pre-ltirr 7993  ax-pre-ltadd 7997

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 5878  df-ov 5926  df-oprab 5927  df-mpo 5928  df-pnf 8065  df-mnf 8066  df-ltxr 8068  df-inn 8993  df-2 9051  df-3 9052  df-ndx 12691  df-slot 12692  df-base 12694  df-sets 12695  df-plusg 12778  df-mulr 12779  df-0g 12939  df-mgm 13009  df-sgrp 13055  df-mnd 13068  df-grp 13145  df-minusg 13146  df-abl 13427  df-mgp 13487  df-rng 13499

This theorem is referenced by:  rngmneg1  13513