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

Theorem grpsubsub 16329
Description: Double group subtraction. (Contributed by NM, 24-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
grpsubsub  |-  ( ( G  e.  Grp  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  B
) )  ->  ( X  .-  ( Y  .-  Z ) )  =  ( X  .+  ( Z  .-  Y ) ) )

Proof of Theorem grpsubsub
StepHypRef Expression
1 simpr1 1000 . . 3  |-  ( ( G  e.  Grp  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  B
) )  ->  X  e.  B )
2 grpsubadd.b . . . . 5  |-  B  =  ( Base `  G
)
3 grpsubadd.m . . . . 5  |-  .-  =  ( -g `  G )
42, 3grpsubcl 16320 . . . 4  |-  ( ( G  e.  Grp  /\  Y  e.  B  /\  Z  e.  B )  ->  ( Y  .-  Z
)  e.  B )
543adant3r1 1203 . . 3  |-  ( ( G  e.  Grp  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  B
) )  ->  ( Y  .-  Z )  e.  B )
6 grpsubadd.p . . . 4  |-  .+  =  ( +g  `  G )
7 eqid 2454 . . . 4  |-  ( invg `  G )  =  ( invg `  G )
82, 6, 7, 3grpsubval 16295 . . 3  |-  ( ( X  e.  B  /\  ( Y  .-  Z )  e.  B )  -> 
( X  .-  ( Y  .-  Z ) )  =  ( X  .+  ( ( invg `  G ) `  ( Y  .-  Z ) ) ) )
91, 5, 8syl2anc 659 . 2  |-  ( ( G  e.  Grp  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  B
) )  ->  ( X  .-  ( Y  .-  Z ) )  =  ( X  .+  (
( invg `  G ) `  ( Y  .-  Z ) ) ) )
102, 3, 7grpinvsub 16322 . . . 4  |-  ( ( G  e.  Grp  /\  Y  e.  B  /\  Z  e.  B )  ->  ( ( invg `  G ) `  ( Y  .-  Z ) )  =  ( Z  .-  Y ) )
11103adant3r1 1203 . . 3  |-  ( ( G  e.  Grp  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  B
) )  ->  (
( invg `  G ) `  ( Y  .-  Z ) )  =  ( Z  .-  Y ) )
1211oveq2d 6286 . 2  |-  ( ( G  e.  Grp  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  B
) )  ->  ( X  .+  ( ( invg `  G ) `
 ( Y  .-  Z ) ) )  =  ( X  .+  ( Z  .-  Y ) ) )
139, 12eqtrd 2495 1  |-  ( ( G  e.  Grp  /\  ( X  e.  B  /\  Y  e.  B  /\  Z  e.  B
) )  ->  ( X  .-  ( Y  .-  Z ) )  =  ( X  .+  ( Z  .-  Y ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 367    /\ w3a 971    = wceq 1398    e. wcel 1823   ` cfv 5570  (class class class)co 6270   Basecbs 14719   +g cplusg 14787   Grpcgrp 16255   invgcminusg 16256   -gcsg 16257
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1623  ax-4 1636  ax-5 1709  ax-6 1752  ax-7 1795  ax-8 1825  ax-9 1827  ax-10 1842  ax-11 1847  ax-12 1859  ax-13 2004  ax-ext 2432  ax-rep 4550  ax-sep 4560  ax-nul 4568  ax-pow 4615  ax-pr 4676  ax-un 6565
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3an 973  df-tru 1401  df-ex 1618  df-nf 1622  df-sb 1745  df-eu 2288  df-mo 2289  df-clab 2440  df-cleq 2446  df-clel 2449  df-nfc 2604  df-ne 2651  df-ral 2809  df-rex 2810  df-reu 2811  df-rmo 2812  df-rab 2813  df-v 3108  df-sbc 3325  df-csb 3421  df-dif 3464  df-un 3466  df-in 3468  df-ss 3475  df-nul 3784  df-if 3930  df-pw 4001  df-sn 4017  df-pr 4019  df-op 4023  df-uni 4236  df-iun 4317  df-br 4440  df-opab 4498  df-mpt 4499  df-id 4784  df-xp 4994  df-rel 4995  df-cnv 4996  df-co 4997  df-dm 4998  df-rn 4999  df-res 5000  df-ima 5001  df-iota 5534  df-fun 5572  df-fn 5573  df-f 5574  df-f1 5575  df-fo 5576  df-f1o 5577  df-fv 5578  df-riota 6232  df-ov 6273  df-oprab 6274  df-mpt2 6275  df-1st 6773  df-2nd 6774  df-0g 14934  df-mgm 16074  df-sgrp 16113  df-mnd 16123  df-grp 16259  df-minusg 16260  df-sbg 16261
This theorem is referenced by:  ablsubsub  17030
  Copyright terms: Public domain W3C validator