Theorem rnglz 14244

Description: The zero of a non-unital ring is a left-absorbing element. (Contributed by FL, 31-Aug-2009.) Generalization of ringlz 14348. (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 14234	. . . . . . 7 |- ( R e. Rng -> R e. Abel )
2		ablgrp 14092	. . . . . . 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 13834	. . . . . 6 |- ( R e. Grp -> .0. e. B )
7		eqid 2238	. . . . . . 7 |- ( +g ` R ) = ( +g ` R )
8	4, 7, 5	grplid 13836	. . . . . 6 |- ( ( R e. Grp /\ .0. e. B ) -> ( .0. ( +g ` R ) .0. ) = .0. )
9	3, 6, 8	syl2anc2 416	. . . . 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 6100	. . 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 1011	. . . . 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 14240	. . . 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 415	. . 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 14243	. . . . 5 |- ( ( R e. Rng /\ .0. e. B /\ X e. B ) -> ( .0. .x. X ) e. B )
25	12, 22, 23, 24	syl3anc 1278	. . . 4 |- ( ( R e. Rng /\ X e. B ) -> ( .0. .x. X ) e. B )
26	4, 7, 5	grprid 13837	. . . . 5 |- ( ( R e. Grp /\ ( .0. .x. X ) e. B ) -> ( ( .0. .x. X ) ( +g ` R ) .0. ) = ( .0. .x. X ) )
27	26	eqcomd 2244	. . . 4 |- ( ( R e. Grp /\ ( .0. .x. X ) e. B ) -> ( .0. .x. X ) = ( ( .0. .x. X ) ( +g ` R ) .0. ) )
28	21, 25, 27	syl2anc 415	. . 3 |- ( ( R e. Rng /\ X e. B ) -> ( .0. .x. X ) = ( ( .0. .x. X ) ( +g ` R ) .0. ) )
29	11, 20, 28	3eqtr3d 2279	. 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 13867	. . 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 1280	. 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. )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1009   = wceq 1402   e. wcel 2209   ` cfv 5377  (class class class)co 6085   Basecbs 13352   +g cplusg 13431   .rcmulr 13432   0gc0g 13610   Grpcgrp 13805   Abelcabl 14088  Rngcrng 14231

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-pre-ltirr 8291  ax-pre-ltadd 8295

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-inn 9305  df-2 9363  df-3 9364  df-ndx 13355  df-slot 13356  df-base 13358  df-sets 13359  df-plusg 13444  df-mulr 13445  df-0g 13612  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-grp 13808  df-minusg 13809  df-abl 14090  df-mgp 14218  df-rng 14232

This theorem is used by:  rngmneg1  14246