Theorem rngass 14238

Description: Associative law for the multiplication operation of a non-unital ring. (Contributed by NM, 27-Aug-2011.) (Revised by AV, 13-Feb-2025.)

Hypotheses

Ref	Expression
rngass.b	|- B = ( Base ` R )
rngass.t	|- .x. = ( .r ` R )

Assertion

Ref	Expression
rngass	|- ( ( R e. Rng /\ ( X e. B /\ Y e. B /\ Z e. B ) ) -> ( ( X .x. Y ) .x. Z ) = ( X .x. ( Y .x. Z ) ) )

Proof of Theorem rngass

Step	Hyp	Ref	Expression
1		eqid 2238	. . . . 5 |- (mulGrp ` R ) = (mulGrp ` R )
2	1	rngmgp 14235	. . . 4 |- ( R e. Rng -> (mulGrp ` R ) e. Smgrp )
3	2	adantr 276	. . 3 |- ( ( R e. Rng /\ ( X e. B /\ Y e. B /\ Z e. B ) ) -> (mulGrp ` R ) e. Smgrp )
4		simpr1 1034	. . . 4 |- ( ( R e. Rng /\ ( X e. B /\ Y e. B /\ Z e. B ) ) -> X e. B )
5		rngass.b	. . . . . 6 |- B = ( Base ` R )
6	1, 5	mgpbasg 14224	. . . . 5 |- ( R e. Rng -> B = ( Base ` (mulGrp ` R ) ) )
7	6	adantr 276	. . . 4 |- ( ( R e. Rng /\ ( X e. B /\ Y e. B /\ Z e. B ) ) -> B = ( Base ` (mulGrp ` R ) ) )
8	4, 7	eleqtrd 2317	. . 3 |- ( ( R e. Rng /\ ( X e. B /\ Y e. B /\ Z e. B ) ) -> X e. ( Base ` (mulGrp ` R ) ) )
9		simpr2 1035	. . . 4 |- ( ( R e. Rng /\ ( X e. B /\ Y e. B /\ Z e. B ) ) -> Y e. B )
10	9, 7	eleqtrd 2317	. . 3 |- ( ( R e. Rng /\ ( X e. B /\ Y e. B /\ Z e. B ) ) -> Y e. ( Base ` (mulGrp ` R ) ) )
11		simpr3 1036	. . . 4 |- ( ( R e. Rng /\ ( X e. B /\ Y e. B /\ Z e. B ) ) -> Z e. B )
12	11, 7	eleqtrd 2317	. . 3 |- ( ( R e. Rng /\ ( X e. B /\ Y e. B /\ Z e. B ) ) -> Z e. ( Base ` (mulGrp ` R ) ) )
13		eqid 2238	. . . 4 |- ( Base ` (mulGrp ` R ) ) = ( Base ` (mulGrp ` R ) )
14		eqid 2238	. . . 4 |- ( +g ` (mulGrp ` R ) ) = ( +g ` (mulGrp ` R ) )
15	13, 14	sgrpass 13723	. . 3 |- ( ( (mulGrp ` R ) e. Smgrp /\ ( X e. ( Base ` (mulGrp ` R ) ) /\ Y e. ( Base ` (mulGrp ` R ) ) /\ Z e. ( Base ` (mulGrp ` R ) ) ) ) -> ( ( X ( +g ` (mulGrp ` R ) ) Y ) ( +g ` (mulGrp ` R ) ) Z ) = ( X ( +g ` (mulGrp ` R ) ) ( Y ( +g ` (mulGrp ` R ) ) Z ) ) )
16	3, 8, 10, 12, 15	syl13anc 1280	. 2 |- ( ( R e. Rng /\ ( X e. B /\ Y e. B /\ Z e. B ) ) -> ( ( X ( +g ` (mulGrp ` R ) ) Y ) ( +g ` (mulGrp ` R ) ) Z ) = ( X ( +g ` (mulGrp ` R ) ) ( Y ( +g ` (mulGrp ` R ) ) Z ) ) )
17		rngass.t	. . . . . . 7 |- .x. = ( .r ` R )
18	1, 17	mgpplusgg 14221	. . . . . 6 |- ( R e. Rng -> .x. = ( +g ` (mulGrp ` R ) ) )
19	18	oveqd 6102	. . . . 5 |- ( R e. Rng -> ( ( X .x. Y ) .x. Z ) = ( ( X .x. Y ) ( +g ` (mulGrp ` R ) ) Z ) )
20	18	oveqd 6102	. . . . . 6 |- ( R e. Rng -> ( X .x. Y ) = ( X ( +g ` (mulGrp ` R ) ) Y ) )
21	20	oveq1d 6100	. . . . 5 |- ( R e. Rng -> ( ( X .x. Y ) ( +g ` (mulGrp ` R ) ) Z ) = ( ( X ( +g ` (mulGrp ` R ) ) Y ) ( +g ` (mulGrp ` R ) ) Z ) )
22	19, 21	eqtrd 2271	. . . 4 |- ( R e. Rng -> ( ( X .x. Y ) .x. Z ) = ( ( X ( +g ` (mulGrp ` R ) ) Y ) ( +g ` (mulGrp ` R ) ) Z ) )
23	18	oveqd 6102	. . . . 5 |- ( R e. Rng -> ( X .x. ( Y .x. Z ) ) = ( X ( +g ` (mulGrp ` R ) ) ( Y .x. Z ) ) )
24	18	oveqd 6102	. . . . . 6 |- ( R e. Rng -> ( Y .x. Z ) = ( Y ( +g ` (mulGrp ` R ) ) Z ) )
25	24	oveq2d 6101	. . . . 5 |- ( R e. Rng -> ( X ( +g ` (mulGrp ` R ) ) ( Y .x. Z ) ) = ( X ( +g ` (mulGrp ` R ) ) ( Y ( +g ` (mulGrp ` R ) ) Z ) ) )
26	23, 25	eqtrd 2271	. . . 4 |- ( R e. Rng -> ( X .x. ( Y .x. Z ) ) = ( X ( +g ` (mulGrp ` R ) ) ( Y ( +g ` (mulGrp ` R ) ) Z ) ) )
27	22, 26	eqeq12d 2253	. . 3 |- ( R e. Rng -> ( ( ( X .x. Y ) .x. Z ) = ( X .x. ( Y .x. Z ) ) <-> ( ( X ( +g ` (mulGrp ` R ) ) Y ) ( +g ` (mulGrp ` R ) ) Z ) = ( X ( +g ` (mulGrp ` R ) ) ( Y ( +g ` (mulGrp ` R ) ) Z ) ) ) )
28	27	adantr 276	. 2 |- ( ( R e. Rng /\ ( X e. B /\ Y e. B /\ Z e. B ) ) -> ( ( ( X .x. Y ) .x. Z ) = ( X .x. ( Y .x. Z ) ) <-> ( ( X ( +g ` (mulGrp ` R ) ) Y ) ( +g ` (mulGrp ` R ) ) Z ) = ( X ( +g ` (mulGrp ` R ) ) ( Y ( +g ` (mulGrp ` R ) ) Z ) ) ) )
29	16, 28	mpbird 167	1 |- ( ( R e. Rng /\ ( X e. B /\ Y e. B /\ Z e. B ) ) -> ( ( X .x. Y ) .x. Z ) = ( X .x. ( Y .x. Z ) ) )

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  Smgrpcsgrp 13716  mulGrpcmgp 14217  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-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-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-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-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  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-sgrp 13717  df-mgp 14218  df-rng 14232

This theorem is used by:  rngressid  14253  imasrng  14255  opprrng  14382  issubrng2  14518