ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  rngsubdir Unicode version

Theorem rngsubdir 13984
Description: Ring multiplication distributes over subtraction. (subdir 8565 analog.) (Contributed by Jeff Madsen, 19-Jun-2010.) (Revised by Mario Carneiro, 2-Jul-2014.) Generalization of ringsubdir 14089. (Revised by AV, 23-Feb-2025.)
Hypotheses
Ref Expression
rngsubdi.b  |-  B  =  ( Base `  R
)
rngsubdi.t  |-  .x.  =  ( .r `  R )
rngsubdi.m  |-  .-  =  ( -g `  R )
rngsubdi.r  |-  ( ph  ->  R  e. Rng )
rngsubdi.x  |-  ( ph  ->  X  e.  B )
rngsubdi.y  |-  ( ph  ->  Y  e.  B )
rngsubdi.z  |-  ( ph  ->  Z  e.  B )
Assertion
Ref Expression
rngsubdir  |-  ( ph  ->  ( ( X  .-  Y )  .x.  Z
)  =  ( ( X  .x.  Z ) 
.-  ( Y  .x.  Z ) ) )

Proof of Theorem rngsubdir
StepHypRef Expression
1 rngsubdi.r . . . 4  |-  ( ph  ->  R  e. Rng )
2 rngsubdi.x . . . 4  |-  ( ph  ->  X  e.  B )
3 rngsubdi.b . . . . 5  |-  B  =  ( Base `  R
)
4 eqid 2231 . . . . 5  |-  ( invg `  R )  =  ( invg `  R )
5 rnggrp 13970 . . . . . 6  |-  ( R  e. Rng  ->  R  e.  Grp )
61, 5syl 14 . . . . 5  |-  ( ph  ->  R  e.  Grp )
7 rngsubdi.y . . . . 5  |-  ( ph  ->  Y  e.  B )
83, 4, 6, 7grpinvcld 13650 . . . 4  |-  ( ph  ->  ( ( invg `  R ) `  Y
)  e.  B )
9 rngsubdi.z . . . 4  |-  ( ph  ->  Z  e.  B )
10 eqid 2231 . . . . 5  |-  ( +g  `  R )  =  ( +g  `  R )
11 rngsubdi.t . . . . 5  |-  .x.  =  ( .r `  R )
123, 10, 11rngdir 13973 . . . 4  |-  ( ( R  e. Rng  /\  ( X  e.  B  /\  ( ( invg `  R ) `  Y
)  e.  B  /\  Z  e.  B )
)  ->  ( ( X ( +g  `  R
) ( ( invg `  R ) `
 Y ) ) 
.x.  Z )  =  ( ( X  .x.  Z ) ( +g  `  R ) ( ( ( invg `  R ) `  Y
)  .x.  Z )
) )
131, 2, 8, 9, 12syl13anc 1275 . . 3  |-  ( ph  ->  ( ( X ( +g  `  R ) ( ( invg `  R ) `  Y
) )  .x.  Z
)  =  ( ( X  .x.  Z ) ( +g  `  R
) ( ( ( invg `  R
) `  Y )  .x.  Z ) ) )
143, 11, 4, 1, 7, 9rngmneg1 13979 . . . 4  |-  ( ph  ->  ( ( ( invg `  R ) `
 Y )  .x.  Z )  =  ( ( invg `  R ) `  ( Y  .x.  Z ) ) )
1514oveq2d 6034 . . 3  |-  ( ph  ->  ( ( X  .x.  Z ) ( +g  `  R ) ( ( ( invg `  R ) `  Y
)  .x.  Z )
)  =  ( ( X  .x.  Z ) ( +g  `  R
) ( ( invg `  R ) `
 ( Y  .x.  Z ) ) ) )
1613, 15eqtrd 2264 . 2  |-  ( ph  ->  ( ( X ( +g  `  R ) ( ( invg `  R ) `  Y
) )  .x.  Z
)  =  ( ( X  .x.  Z ) ( +g  `  R
) ( ( invg `  R ) `
 ( Y  .x.  Z ) ) ) )
17 rngsubdi.m . . . . 5  |-  .-  =  ( -g `  R )
183, 10, 4, 17grpsubval 13647 . . . 4  |-  ( ( X  e.  B  /\  Y  e.  B )  ->  ( X  .-  Y
)  =  ( X ( +g  `  R
) ( ( invg `  R ) `
 Y ) ) )
192, 7, 18syl2anc 411 . . 3  |-  ( ph  ->  ( X  .-  Y
)  =  ( X ( +g  `  R
) ( ( invg `  R ) `
 Y ) ) )
2019oveq1d 6033 . 2  |-  ( ph  ->  ( ( X  .-  Y )  .x.  Z
)  =  ( ( X ( +g  `  R
) ( ( invg `  R ) `
 Y ) ) 
.x.  Z ) )
213, 11rngcl 13976 . . . 4  |-  ( ( R  e. Rng  /\  X  e.  B  /\  Z  e.  B )  ->  ( X  .x.  Z )  e.  B )
221, 2, 9, 21syl3anc 1273 . . 3  |-  ( ph  ->  ( X  .x.  Z
)  e.  B )
233, 11rngcl 13976 . . . 4  |-  ( ( R  e. Rng  /\  Y  e.  B  /\  Z  e.  B )  ->  ( Y  .x.  Z )  e.  B )
241, 7, 9, 23syl3anc 1273 . . 3  |-  ( ph  ->  ( Y  .x.  Z
)  e.  B )
253, 10, 4, 17grpsubval 13647 . . 3  |-  ( ( ( X  .x.  Z
)  e.  B  /\  ( Y  .x.  Z )  e.  B )  -> 
( ( X  .x.  Z )  .-  ( Y  .x.  Z ) )  =  ( ( X 
.x.  Z ) ( +g  `  R ) ( ( invg `  R ) `  ( Y  .x.  Z ) ) ) )
2622, 24, 25syl2anc 411 . 2  |-  ( ph  ->  ( ( X  .x.  Z )  .-  ( Y  .x.  Z ) )  =  ( ( X 
.x.  Z ) ( +g  `  R ) ( ( invg `  R ) `  ( Y  .x.  Z ) ) ) )
2716, 20, 263eqtr4d 2274 1  |-  ( ph  ->  ( ( X  .-  Y )  .x.  Z
)  =  ( ( X  .x.  Z ) 
.-  ( Y  .x.  Z ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1397    e. wcel 2202   ` cfv 5326  (class class class)co 6018   Basecbs 13100   +g cplusg 13178   .rcmulr 13179   Grpcgrp 13601   invgcminusg 13602   -gcsg 13603  Rngcrng 13964
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-addcom 8132  ax-addass 8134  ax-i2m1 8137  ax-0lt1 8138  ax-0id 8140  ax-rnegex 8141  ax-pre-ltirr 8144  ax-pre-ltadd 8148
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-pnf 8216  df-mnf 8217  df-ltxr 8219  df-inn 9144  df-2 9202  df-3 9203  df-ndx 13103  df-slot 13104  df-base 13106  df-sets 13107  df-plusg 13191  df-mulr 13192  df-0g 13359  df-mgm 13457  df-sgrp 13503  df-mnd 13518  df-grp 13604  df-minusg 13605  df-sbg 13606  df-abl 13892  df-mgp 13953  df-rng 13965
This theorem is referenced by:  2idlcpblrng  14556
  Copyright terms: Public domain W3C validator