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

Theorem eqgabl 14134
Description: Value of the subgroup coset equivalence relation on an abelian group. (Contributed by Mario Carneiro, 14-Jun-2015.)
Hypotheses
Ref Expression
eqgabl.x  |-  X  =  ( Base `  G
)
eqgabl.n  |-  .-  =  ( -g `  G )
eqgabl.r  |-  .~  =  ( G ~QG  S )
Assertion
Ref Expression
eqgabl  |-  ( ( G  e.  Abel  /\  S  C_  X )  ->  ( A  .~  B  <->  ( A  e.  X  /\  B  e.  X  /\  ( B 
.-  A )  e.  S ) ) )

Proof of Theorem eqgabl
StepHypRef Expression
1 eqgabl.x . . 3  |-  X  =  ( Base `  G
)
2 eqid 2238 . . 3  |-  ( invg `  G )  =  ( invg `  G )
3 eqid 2238 . . 3  |-  ( +g  `  G )  =  ( +g  `  G )
4 eqgabl.r . . 3  |-  .~  =  ( G ~QG  S )
51, 2, 3, 4eqgval 14026 . 2  |-  ( ( G  e.  Abel  /\  S  C_  X )  ->  ( A  .~  B  <->  ( A  e.  X  /\  B  e.  X  /\  ( ( ( invg `  G ) `  A
) ( +g  `  G
) B )  e.  S ) ) )
6 simpll 531 . . . . . . 7  |-  ( ( ( G  e.  Abel  /\  S  C_  X )  /\  ( A  e.  X  /\  B  e.  X
) )  ->  G  e.  Abel )
7 ablgrp 14092 . . . . . . . . 9  |-  ( G  e.  Abel  ->  G  e. 
Grp )
87ad2antrr 492 . . . . . . . 8  |-  ( ( ( G  e.  Abel  /\  S  C_  X )  /\  ( A  e.  X  /\  B  e.  X
) )  ->  G  e.  Grp )
9 simprl 535 . . . . . . . 8  |-  ( ( ( G  e.  Abel  /\  S  C_  X )  /\  ( A  e.  X  /\  B  e.  X
) )  ->  A  e.  X )
101, 2grpinvcl 13853 . . . . . . . 8  |-  ( ( G  e.  Grp  /\  A  e.  X )  ->  ( ( invg `  G ) `  A
)  e.  X )
118, 9, 10syl2anc 415 . . . . . . 7  |-  ( ( ( G  e.  Abel  /\  S  C_  X )  /\  ( A  e.  X  /\  B  e.  X
) )  ->  (
( invg `  G ) `  A
)  e.  X )
12 simprr 537 . . . . . . 7  |-  ( ( ( G  e.  Abel  /\  S  C_  X )  /\  ( A  e.  X  /\  B  e.  X
) )  ->  B  e.  X )
131, 3ablcom 14106 . . . . . . 7  |-  ( ( G  e.  Abel  /\  (
( invg `  G ) `  A
)  e.  X  /\  B  e.  X )  ->  ( ( ( invg `  G ) `
 A ) ( +g  `  G ) B )  =  ( B ( +g  `  G
) ( ( invg `  G ) `
 A ) ) )
146, 11, 12, 13syl3anc 1278 . . . . . 6  |-  ( ( ( G  e.  Abel  /\  S  C_  X )  /\  ( A  e.  X  /\  B  e.  X
) )  ->  (
( ( invg `  G ) `  A
) ( +g  `  G
) B )  =  ( B ( +g  `  G ) ( ( invg `  G
) `  A )
) )
15 eqgabl.n . . . . . . . 8  |-  .-  =  ( -g `  G )
161, 3, 2, 15grpsubval 13851 . . . . . . 7  |-  ( ( B  e.  X  /\  A  e.  X )  ->  ( B  .-  A
)  =  ( B ( +g  `  G
) ( ( invg `  G ) `
 A ) ) )
1712, 9, 16syl2anc 415 . . . . . 6  |-  ( ( ( G  e.  Abel  /\  S  C_  X )  /\  ( A  e.  X  /\  B  e.  X
) )  ->  ( B  .-  A )  =  ( B ( +g  `  G ) ( ( invg `  G
) `  A )
) )
1814, 17eqtr4d 2274 . . . . 5  |-  ( ( ( G  e.  Abel  /\  S  C_  X )  /\  ( A  e.  X  /\  B  e.  X
) )  ->  (
( ( invg `  G ) `  A
) ( +g  `  G
) B )  =  ( B  .-  A
) )
1918eleq1d 2307 . . . 4  |-  ( ( ( G  e.  Abel  /\  S  C_  X )  /\  ( A  e.  X  /\  B  e.  X
) )  ->  (
( ( ( invg `  G ) `
 A ) ( +g  `  G ) B )  e.  S  <->  ( B  .-  A )  e.  S ) )
2019pm5.32da 456 . . 3  |-  ( ( G  e.  Abel  /\  S  C_  X )  ->  (
( ( A  e.  X  /\  B  e.  X )  /\  (
( ( invg `  G ) `  A
) ( +g  `  G
) B )  e.  S )  <->  ( ( A  e.  X  /\  B  e.  X )  /\  ( B  .-  A
)  e.  S ) ) )
21 df-3an 1011 . . 3  |-  ( ( A  e.  X  /\  B  e.  X  /\  ( ( ( invg `  G ) `
 A ) ( +g  `  G ) B )  e.  S
)  <->  ( ( A  e.  X  /\  B  e.  X )  /\  (
( ( invg `  G ) `  A
) ( +g  `  G
) B )  e.  S ) )
22 df-3an 1011 . . 3  |-  ( ( A  e.  X  /\  B  e.  X  /\  ( B  .-  A )  e.  S )  <->  ( ( A  e.  X  /\  B  e.  X )  /\  ( B  .-  A
)  e.  S ) )
2320, 21, 223bitr4g 223 . 2  |-  ( ( G  e.  Abel  /\  S  C_  X )  ->  (
( A  e.  X  /\  B  e.  X  /\  ( ( ( invg `  G ) `
 A ) ( +g  `  G ) B )  e.  S
)  <->  ( A  e.  X  /\  B  e.  X  /\  ( B 
.-  A )  e.  S ) ) )
245, 23bitrd 188 1  |-  ( ( G  e.  Abel  /\  S  C_  X )  ->  ( A  .~  B  <->  ( A  e.  X  /\  B  e.  X  /\  ( B 
.-  A )  e.  S ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1009    = wceq 1402    e. wcel 2209    C_ wss 3220   class class class wbr 4130   ` cfv 5377  (class class class)co 6085   Basecbs 13352   +g cplusg 13431   Grpcgrp 13805   invgcminusg 13806   -gcsg 13807   ~QG cqg 13972   Abelcabl 14088
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-inn 9305  df-2 9363  df-ndx 13355  df-slot 13356  df-base 13358  df-plusg 13444  df-0g 13612  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-grp 13808  df-minusg 13809  df-sbg 13810  df-eqg 13975  df-cmn 14089  df-abl 14090
This theorem is used by:  qusecsub  14135  2idlcpblrng  14860  zndvds  14984
  Copyright terms: Public domain W3C validator