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

Theorem gacan 16910
Description: Group inverses cancel in a group action. (Contributed by Jeff Hankins, 11-Aug-2009.) (Revised by Mario Carneiro, 13-Jan-2015.)
Hypotheses
Ref Expression
galcan.1  |-  X  =  ( Base `  G
)
gacan.2  |-  N  =  ( invg `  G )
Assertion
Ref Expression
gacan  |-  ( ( 
.(+)  e.  ( G  GrpAct  Y )  /\  ( A  e.  X  /\  B  e.  Y  /\  C  e.  Y )
)  ->  ( ( A  .(+)  B )  =  C  <->  ( ( N `
 A )  .(+)  C )  =  B ) )

Proof of Theorem gacan
StepHypRef Expression
1 gagrp 16897 . . . . . . . 8  |-  (  .(+)  e.  ( G  GrpAct  Y )  ->  G  e.  Grp )
21adantr 466 . . . . . . 7  |-  ( ( 
.(+)  e.  ( G  GrpAct  Y )  /\  ( A  e.  X  /\  B  e.  Y  /\  C  e.  Y )
)  ->  G  e.  Grp )
3 simpr1 1011 . . . . . . 7  |-  ( ( 
.(+)  e.  ( G  GrpAct  Y )  /\  ( A  e.  X  /\  B  e.  Y  /\  C  e.  Y )
)  ->  A  e.  X )
4 galcan.1 . . . . . . . 8  |-  X  =  ( Base `  G
)
5 eqid 2429 . . . . . . . 8  |-  ( +g  `  G )  =  ( +g  `  G )
6 eqid 2429 . . . . . . . 8  |-  ( 0g
`  G )  =  ( 0g `  G
)
7 gacan.2 . . . . . . . 8  |-  N  =  ( invg `  G )
84, 5, 6, 7grprinv 16664 . . . . . . 7  |-  ( ( G  e.  Grp  /\  A  e.  X )  ->  ( A ( +g  `  G ) ( N `
 A ) )  =  ( 0g `  G ) )
92, 3, 8syl2anc 665 . . . . . 6  |-  ( ( 
.(+)  e.  ( G  GrpAct  Y )  /\  ( A  e.  X  /\  B  e.  Y  /\  C  e.  Y )
)  ->  ( A
( +g  `  G ) ( N `  A
) )  =  ( 0g `  G ) )
109oveq1d 6320 . . . . 5  |-  ( ( 
.(+)  e.  ( G  GrpAct  Y )  /\  ( A  e.  X  /\  B  e.  Y  /\  C  e.  Y )
)  ->  ( ( A ( +g  `  G
) ( N `  A ) )  .(+)  C )  =  ( ( 0g `  G ) 
.(+)  C ) )
11 simpl 458 . . . . . 6  |-  ( ( 
.(+)  e.  ( G  GrpAct  Y )  /\  ( A  e.  X  /\  B  e.  Y  /\  C  e.  Y )
)  ->  .(+)  e.  ( G  GrpAct  Y ) )
124, 7grpinvcl 16662 . . . . . . 7  |-  ( ( G  e.  Grp  /\  A  e.  X )  ->  ( N `  A
)  e.  X )
132, 3, 12syl2anc 665 . . . . . 6  |-  ( ( 
.(+)  e.  ( G  GrpAct  Y )  /\  ( A  e.  X  /\  B  e.  Y  /\  C  e.  Y )
)  ->  ( N `  A )  e.  X
)
14 simpr3 1013 . . . . . 6  |-  ( ( 
.(+)  e.  ( G  GrpAct  Y )  /\  ( A  e.  X  /\  B  e.  Y  /\  C  e.  Y )
)  ->  C  e.  Y )
154, 5gaass 16902 . . . . . 6  |-  ( ( 
.(+)  e.  ( G  GrpAct  Y )  /\  ( A  e.  X  /\  ( N `  A )  e.  X  /\  C  e.  Y ) )  -> 
( ( A ( +g  `  G ) ( N `  A
) )  .(+)  C )  =  ( A  .(+)  ( ( N `  A
)  .(+)  C ) ) )
1611, 3, 13, 14, 15syl13anc 1266 . . . . 5  |-  ( ( 
.(+)  e.  ( G  GrpAct  Y )  /\  ( A  e.  X  /\  B  e.  Y  /\  C  e.  Y )
)  ->  ( ( A ( +g  `  G
) ( N `  A ) )  .(+)  C )  =  ( A 
.(+)  ( ( N `
 A )  .(+)  C ) ) )
176gagrpid 16899 . . . . . 6  |-  ( ( 
.(+)  e.  ( G  GrpAct  Y )  /\  C  e.  Y )  ->  (
( 0g `  G
)  .(+)  C )  =  C )
1811, 14, 17syl2anc 665 . . . . 5  |-  ( ( 
.(+)  e.  ( G  GrpAct  Y )  /\  ( A  e.  X  /\  B  e.  Y  /\  C  e.  Y )
)  ->  ( ( 0g `  G )  .(+)  C )  =  C )
1910, 16, 183eqtr3d 2478 . . . 4  |-  ( ( 
.(+)  e.  ( G  GrpAct  Y )  /\  ( A  e.  X  /\  B  e.  Y  /\  C  e.  Y )
)  ->  ( A  .(+) 
( ( N `  A )  .(+)  C ) )  =  C )
2019eqeq2d 2443 . . 3  |-  ( ( 
.(+)  e.  ( G  GrpAct  Y )  /\  ( A  e.  X  /\  B  e.  Y  /\  C  e.  Y )
)  ->  ( ( A  .(+)  B )  =  ( A  .(+)  ( ( N `  A ) 
.(+)  C ) )  <->  ( A  .(+) 
B )  =  C ) )
21 simpr2 1012 . . . 4  |-  ( ( 
.(+)  e.  ( G  GrpAct  Y )  /\  ( A  e.  X  /\  B  e.  Y  /\  C  e.  Y )
)  ->  B  e.  Y )
224gaf 16900 . . . . . 6  |-  (  .(+)  e.  ( G  GrpAct  Y )  ->  .(+)  : ( X  X.  Y ) --> Y )
2322adantr 466 . . . . 5  |-  ( ( 
.(+)  e.  ( G  GrpAct  Y )  /\  ( A  e.  X  /\  B  e.  Y  /\  C  e.  Y )
)  ->  .(+)  : ( X  X.  Y ) --> Y )
2423, 13, 14fovrnd 6455 . . . 4  |-  ( ( 
.(+)  e.  ( G  GrpAct  Y )  /\  ( A  e.  X  /\  B  e.  Y  /\  C  e.  Y )
)  ->  ( ( N `  A )  .(+)  C )  e.  Y
)
254galcan 16909 . . . 4  |-  ( ( 
.(+)  e.  ( G  GrpAct  Y )  /\  ( A  e.  X  /\  B  e.  Y  /\  ( ( N `  A )  .(+)  C )  e.  Y ) )  ->  ( ( A 
.(+)  B )  =  ( A  .(+)  ( ( N `  A )  .(+)  C ) )  <->  B  =  ( ( N `  A )  .(+)  C ) ) )
2611, 3, 21, 24, 25syl13anc 1266 . . 3  |-  ( ( 
.(+)  e.  ( G  GrpAct  Y )  /\  ( A  e.  X  /\  B  e.  Y  /\  C  e.  Y )
)  ->  ( ( A  .(+)  B )  =  ( A  .(+)  ( ( N `  A ) 
.(+)  C ) )  <->  B  =  ( ( N `  A )  .(+)  C ) ) )
2720, 26bitr3d 258 . 2  |-  ( ( 
.(+)  e.  ( G  GrpAct  Y )  /\  ( A  e.  X  /\  B  e.  Y  /\  C  e.  Y )
)  ->  ( ( A  .(+)  B )  =  C  <->  B  =  (
( N `  A
)  .(+)  C ) ) )
28 eqcom 2438 . 2  |-  ( B  =  ( ( N `
 A )  .(+)  C )  <->  ( ( N `
 A )  .(+)  C )  =  B )
2927, 28syl6bb 264 1  |-  ( ( 
.(+)  e.  ( G  GrpAct  Y )  /\  ( A  e.  X  /\  B  e.  Y  /\  C  e.  Y )
)  ->  ( ( A  .(+)  B )  =  C  <->  ( ( N `
 A )  .(+)  C )  =  B ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 187    /\ wa 370    /\ w3a 982    = wceq 1437    e. wcel 1870    X. cxp 4852   -->wf 5597   ` cfv 5601  (class class class)co 6305   Basecbs 15084   +g cplusg 15152   0gc0g 15297   Grpcgrp 16620   invgcminusg 16621    GrpAct cga 16894
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1665  ax-4 1678  ax-5 1751  ax-6 1797  ax-7 1841  ax-8 1872  ax-9 1874  ax-10 1889  ax-11 1894  ax-12 1907  ax-13 2055  ax-ext 2407  ax-rep 4538  ax-sep 4548  ax-nul 4556  ax-pow 4603  ax-pr 4661  ax-un 6597
This theorem depends on definitions:  df-bi 188  df-or 371  df-an 372  df-3an 984  df-tru 1440  df-ex 1660  df-nf 1664  df-sb 1790  df-eu 2270  df-mo 2271  df-clab 2415  df-cleq 2421  df-clel 2424  df-nfc 2579  df-ne 2627  df-ral 2787  df-rex 2788  df-reu 2789  df-rmo 2790  df-rab 2791  df-v 3089  df-sbc 3306  df-csb 3402  df-dif 3445  df-un 3447  df-in 3449  df-ss 3456  df-nul 3768  df-if 3916  df-pw 3987  df-sn 4003  df-pr 4005  df-op 4009  df-uni 4223  df-iun 4304  df-br 4427  df-opab 4485  df-mpt 4486  df-id 4769  df-xp 4860  df-rel 4861  df-cnv 4862  df-co 4863  df-dm 4864  df-rn 4865  df-res 4866  df-ima 4867  df-iota 5565  df-fun 5603  df-fn 5604  df-f 5605  df-f1 5606  df-fo 5607  df-f1o 5608  df-fv 5609  df-riota 6267  df-ov 6308  df-oprab 6309  df-mpt2 6310  df-map 7482  df-0g 15299  df-mgm 16439  df-sgrp 16478  df-mnd 16488  df-grp 16624  df-minusg 16625  df-ga 16895
This theorem is referenced by:  gapm  16911  gaorber  16913  gastacl  16914  gastacos  16915
  Copyright terms: Public domain W3C validator