MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  grppnpcan2 Unicode version

Theorem grppnpcan2 14837
Description: Cancellation law for mixed addition and subtraction. (pnpcan2 9297 analog.) (Contributed by NM, 15-Feb-2008.) (Revised by Mario Carneiro, 2-Dec-2014.)
Hypotheses
Ref Expression
grpsubadd.b  |-  B  =  ( Base `  G
)
grpsubadd.p  |-  .+  =  ( +g  `  G )
grpsubadd.m  |-  .-  =  ( -g `  G )
Assertion
Ref Expression
grppnpcan2  |-  ( ( G  e.  Grp  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  B
) )  ->  (
( X  .+  Z
)  .-  ( Y  .+  Z ) )  =  ( X  .-  Y
) )

Proof of Theorem grppnpcan2
StepHypRef Expression
1 simpl 444 . . 3  |-  ( ( G  e.  Grp  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  B
) )  ->  G  e.  Grp )
2 grpsubadd.b . . . . 5  |-  B  =  ( Base `  G
)
3 grpsubadd.p . . . . 5  |-  .+  =  ( +g  `  G )
42, 3grpcl 14773 . . . 4  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  Z  e.  B )  ->  ( X  .+  Z
)  e.  B )
543adant3r2 1163 . . 3  |-  ( ( G  e.  Grp  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  B
) )  ->  ( X  .+  Z )  e.  B )
6 simpr3 965 . . 3  |-  ( ( G  e.  Grp  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  B
) )  ->  Z  e.  B )
7 simpr2 964 . . 3  |-  ( ( G  e.  Grp  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  B
) )  ->  Y  e.  B )
8 grpsubadd.m . . . 4  |-  .-  =  ( -g `  G )
92, 3, 8grpsubsub4 14836 . . 3  |-  ( ( G  e.  Grp  /\  ( ( X  .+  Z )  e.  B  /\  Z  e.  B  /\  Y  e.  B
) )  ->  (
( ( X  .+  Z )  .-  Z
)  .-  Y )  =  ( ( X 
.+  Z )  .-  ( Y  .+  Z ) ) )
101, 5, 6, 7, 9syl13anc 1186 . 2  |-  ( ( G  e.  Grp  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  B
) )  ->  (
( ( X  .+  Z )  .-  Z
)  .-  Y )  =  ( ( X 
.+  Z )  .-  ( Y  .+  Z ) ) )
112, 3, 8grppncan 14834 . . . 4  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  Z  e.  B )  ->  ( ( X  .+  Z )  .-  Z
)  =  X )
12113adant3r2 1163 . . 3  |-  ( ( G  e.  Grp  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  B
) )  ->  (
( X  .+  Z
)  .-  Z )  =  X )
1312oveq1d 6055 . 2  |-  ( ( G  e.  Grp  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  B
) )  ->  (
( ( X  .+  Z )  .-  Z
)  .-  Y )  =  ( X  .-  Y ) )
1410, 13eqtr3d 2438 1  |-  ( ( G  e.  Grp  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  B
) )  ->  (
( X  .+  Z
)  .-  ( Y  .+  Z ) )  =  ( X  .-  Y
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 359    /\ w3a 936    = wceq 1649    e. wcel 1721   ` cfv 5413  (class class class)co 6040   Basecbs 13424   +g cplusg 13484   Grpcgrp 14640   -gcsg 14643
This theorem is referenced by:  ngprcan  18609
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-13 1723  ax-14 1725  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2385  ax-rep 4280  ax-sep 4290  ax-nul 4298  ax-pow 4337  ax-pr 4363  ax-un 4660
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2258  df-mo 2259  df-clab 2391  df-cleq 2397  df-clel 2400  df-nfc 2529  df-ne 2569  df-ral 2671  df-rex 2672  df-reu 2673  df-rmo 2674  df-rab 2675  df-v 2918  df-sbc 3122  df-csb 3212  df-dif 3283  df-un 3285  df-in 3287  df-ss 3294  df-nul 3589  df-if 3700  df-pw 3761  df-sn 3780  df-pr 3781  df-op 3783  df-uni 3976  df-iun 4055  df-br 4173  df-opab 4227  df-mpt 4228  df-id 4458  df-xp 4843  df-rel 4844  df-cnv 4845  df-co 4846  df-dm 4847  df-rn 4848  df-res 4849  df-ima 4850  df-iota 5377  df-fun 5415  df-fn 5416  df-f 5417  df-f1 5418  df-fo 5419  df-f1o 5420  df-fv 5421  df-ov 6043  df-oprab 6044  df-mpt2 6045  df-1st 6308  df-2nd 6309  df-riota 6508  df-0g 13682  df-mnd 14645  df-grp 14767  df-minusg 14768  df-sbg 14769
  Copyright terms: Public domain W3C validator