Theorem rngmneg2 14187

Description: Negation of a product in a non-unital ring (mulneg2 8686 analog). In contrast to ringmneg2 14297, the proof does not (and cannot) make use of the existence of a ring unity. (Contributed by AV, 17-Feb-2025.)

Hypotheses

Ref	Expression
rngneglmul.b	|- B = ( Base ` R )
rngneglmul.t	|- .x. = ( .r ` R )
rngneglmul.n	|- N = ( invg ` R )
rngneglmul.r	|- ( ph -> R e. Rng )
rngneglmul.x	|- ( ph -> X e. B )
rngneglmul.y	|- ( ph -> Y e. B )

Assertion

Ref	Expression
rngmneg2	|- ( ph -> ( X .x. ( N ` Y ) ) = ( N ` ( X .x. Y ) ) )

Proof of Theorem rngmneg2

Step	Hyp	Ref	Expression
1		rngneglmul.b	. . . . . 6 |- B = ( Base ` R )
2		eqid 2234	. . . . . 6 |- ( +g ` R ) = ( +g ` R )
3		eqid 2234	. . . . . 6 |- ( 0g ` R ) = ( 0g ` R )
4		rngneglmul.n	. . . . . 6 |- N = ( invg ` R )
5		rngneglmul.r	. . . . . . 7 |- ( ph -> R e. Rng )
6		rnggrp 14177	. . . . . . 7 |- ( R e. Rng -> R e. Grp )
7	5, 6	syl 14	. . . . . 6 |- ( ph -> R e. Grp )
8		rngneglmul.y	. . . . . 6 |- ( ph -> Y e. B )
9	1, 2, 3, 4, 7, 8	grplinvd 13810	. . . . 5 |- ( ph -> ( ( N ` Y ) ( +g ` R ) Y ) = ( 0g ` R ) )
10	9	oveq2d 6074	. . . 4 |- ( ph -> ( X .x. ( ( N ` Y ) ( +g ` R ) Y ) ) = ( X .x. ( 0g ` R ) ) )
11		rngneglmul.x	. . . . 5 |- ( ph -> X e. B )
12		rngneglmul.t	. . . . . 6 |- .x. = ( .r ` R )
13	1, 12, 3	rngrz 14185	. . . . 5 |- ( ( R e. Rng /\ X e. B ) -> ( X .x. ( 0g ` R ) ) = ( 0g ` R ) )
14	5, 11, 13	syl2anc 411	. . . 4 |- ( ph -> ( X .x. ( 0g ` R ) ) = ( 0g ` R ) )
15	10, 14	eqtrd 2267	. . 3 |- ( ph -> ( X .x. ( ( N ` Y ) ( +g ` R ) Y ) ) = ( 0g ` R ) )
16	1, 12	rngcl 14183	. . . . . 6 |- ( ( R e. Rng /\ X e. B /\ Y e. B ) -> ( X .x. Y ) e. B )
17	5, 11, 8, 16	syl3anc 1274	. . . . 5 |- ( ph -> ( X .x. Y ) e. B )
18	1, 4, 7, 8	grpinvcld 13804	. . . . . 6 |- ( ph -> ( N ` Y ) e. B )
19	1, 12	rngcl 14183	. . . . . 6 |- ( ( R e. Rng /\ X e. B /\ ( N ` Y ) e. B ) -> ( X .x. ( N ` Y ) ) e. B )
20	5, 11, 18, 19	syl3anc 1274	. . . . 5 |- ( ph -> ( X .x. ( N ` Y ) ) e. B )
21	1, 2, 3, 4	grpinvid2 13808	. . . . 5 |- ( ( R e. Grp /\ ( X .x. Y ) e. B /\ ( X .x. ( N ` Y ) ) e. B ) -> ( ( N ` ( X .x. Y ) ) = ( X .x. ( N ` Y ) ) <-> ( ( X .x. ( N ` Y ) ) ( +g ` R ) ( X .x. Y ) ) = ( 0g ` R ) ) )
22	7, 17, 20, 21	syl3anc 1274	. . . 4 |- ( ph -> ( ( N ` ( X .x. Y ) ) = ( X .x. ( N ` Y ) ) <-> ( ( X .x. ( N ` Y ) ) ( +g ` R ) ( X .x. Y ) ) = ( 0g ` R ) ) )
23	1, 2, 12	rngdi 14179	. . . . . . 7 |- ( ( R e. Rng /\ ( X e. B /\ ( N ` Y ) e. B /\ Y e. B ) ) -> ( X .x. ( ( N ` Y ) ( +g ` R ) Y ) ) = ( ( X .x. ( N ` Y ) ) ( +g ` R ) ( X .x. Y ) ) )
24	23	eqcomd 2240	. . . . . 6 |- ( ( R e. Rng /\ ( X e. B /\ ( N ` Y ) e. B /\ Y e. B ) ) -> ( ( X .x. ( N ` Y ) ) ( +g ` R ) ( X .x. Y ) ) = ( X .x. ( ( N ` Y ) ( +g ` R ) Y ) ) )
25	5, 11, 18, 8, 24	syl13anc 1276	. . . . 5 |- ( ph -> ( ( X .x. ( N ` Y ) ) ( +g ` R ) ( X .x. Y ) ) = ( X .x. ( ( N ` Y ) ( +g ` R ) Y ) ) )
26	25	eqeq1d 2243	. . . 4 |- ( ph -> ( ( ( X .x. ( N ` Y ) ) ( +g ` R ) ( X .x. Y ) ) = ( 0g ` R ) <-> ( X .x. ( ( N ` Y ) ( +g ` R ) Y ) ) = ( 0g ` R ) ) )
27	22, 26	bitrd 188	. . 3 |- ( ph -> ( ( N ` ( X .x. Y ) ) = ( X .x. ( N ` Y ) ) <-> ( X .x. ( ( N ` Y ) ( +g ` R ) Y ) ) = ( 0g ` R ) ) )
28	15, 27	mpbird 167	. 2 |- ( ph -> ( N ` ( X .x. Y ) ) = ( X .x. ( N ` Y ) ) )
29	28	eqcomd 2240	1 |- ( ph -> ( X .x. ( N ` Y ) ) = ( N ` ( X .x. Y ) ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1005   = wceq 1398   e. wcel 2205   ` cfv 5357  (class class class)co 6058   Basecbs 13296   +g cplusg 13374   .rcmulr 13375   0gc0g 13553   Grpcgrp 13755   invgcminusg 13756  Rngcrng 14171

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-pre-ltirr 8255  ax-pre-ltadd 8259

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-pnf 8326  df-mnf 8327  df-ltxr 8329  df-inn 9255  df-2 9313  df-3 9314  df-ndx 13299  df-slot 13300  df-base 13302  df-sets 13303  df-plusg 13387  df-mulr 13388  df-0g 13555  df-mgm 13619  df-sgrp 13665  df-mnd 13678  df-grp 13758  df-minusg 13759  df-abl 14040  df-mgp 14160  df-rng 14172

This theorem is referenced by:  rngm2neg  14188  rngsubdi  14190