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

Theorem ablsub2inv 14092
Description: Abelian group subtraction of two inverses. (Contributed by Stefan O'Rear, 24-May-2015.)
Hypotheses
Ref Expression
ablsub2inv.b  |-  B  =  ( Base `  G
)
ablsub2inv.m  |-  .-  =  ( -g `  G )
ablsub2inv.n  |-  N  =  ( invg `  G )
ablsub2inv.g  |-  ( ph  ->  G  e.  Abel )
ablsub2inv.x  |-  ( ph  ->  X  e.  B )
ablsub2inv.y  |-  ( ph  ->  Y  e.  B )
Assertion
Ref Expression
ablsub2inv  |-  ( ph  ->  ( ( N `  X )  .-  ( N `  Y )
)  =  ( Y 
.-  X ) )

Proof of Theorem ablsub2inv
StepHypRef Expression
1 ablsub2inv.b . . 3  |-  B  =  ( Base `  G
)
2 eqid 2238 . . 3  |-  ( +g  `  G )  =  ( +g  `  G )
3 ablsub2inv.m . . 3  |-  .-  =  ( -g `  G )
4 ablsub2inv.n . . 3  |-  N  =  ( invg `  G )
5 ablsub2inv.g . . . 4  |-  ( ph  ->  G  e.  Abel )
6 ablgrp 14069 . . . 4  |-  ( G  e.  Abel  ->  G  e. 
Grp )
75, 6syl 14 . . 3  |-  ( ph  ->  G  e.  Grp )
8 ablsub2inv.x . . . 4  |-  ( ph  ->  X  e.  B )
91, 4grpinvcl 13830 . . . 4  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( N `  X
)  e.  B )
107, 8, 9syl2anc 415 . . 3  |-  ( ph  ->  ( N `  X
)  e.  B )
11 ablsub2inv.y . . 3  |-  ( ph  ->  Y  e.  B )
121, 2, 3, 4, 7, 10, 11grpsubinv 13855 . 2  |-  ( ph  ->  ( ( N `  X )  .-  ( N `  Y )
)  =  ( ( N `  X ) ( +g  `  G
) Y ) )
131, 2ablcom 14083 . . . . . 6  |-  ( ( G  e.  Abel  /\  ( N `  X )  e.  B  /\  Y  e.  B )  ->  (
( N `  X
) ( +g  `  G
) Y )  =  ( Y ( +g  `  G ) ( N `
 X ) ) )
145, 10, 11, 13syl3anc 1278 . . . . 5  |-  ( ph  ->  ( ( N `  X ) ( +g  `  G ) Y )  =  ( Y ( +g  `  G ) ( N `  X
) ) )
151, 4grpinvinv 13849 . . . . . . 7  |-  ( ( G  e.  Grp  /\  Y  e.  B )  ->  ( N `  ( N `  Y )
)  =  Y )
167, 11, 15syl2anc 415 . . . . . 6  |-  ( ph  ->  ( N `  ( N `  Y )
)  =  Y )
1716oveq1d 6090 . . . . 5  |-  ( ph  ->  ( ( N `  ( N `  Y ) ) ( +g  `  G
) ( N `  X ) )  =  ( Y ( +g  `  G ) ( N `
 X ) ) )
1814, 17eqtr4d 2274 . . . 4  |-  ( ph  ->  ( ( N `  X ) ( +g  `  G ) Y )  =  ( ( N `
 ( N `  Y ) ) ( +g  `  G ) ( N `  X
) ) )
191, 4grpinvcl 13830 . . . . . 6  |-  ( ( G  e.  Grp  /\  Y  e.  B )  ->  ( N `  Y
)  e.  B )
207, 11, 19syl2anc 415 . . . . 5  |-  ( ph  ->  ( N `  Y
)  e.  B )
211, 2, 4grpinvadd 13860 . . . . 5  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  ( N `  Y )  e.  B )  -> 
( N `  ( X ( +g  `  G
) ( N `  Y ) ) )  =  ( ( N `
 ( N `  Y ) ) ( +g  `  G ) ( N `  X
) ) )
227, 8, 20, 21syl3anc 1278 . . . 4  |-  ( ph  ->  ( N `  ( X ( +g  `  G
) ( N `  Y ) ) )  =  ( ( N `
 ( N `  Y ) ) ( +g  `  G ) ( N `  X
) ) )
2318, 22eqtr4d 2274 . . 3  |-  ( ph  ->  ( ( N `  X ) ( +g  `  G ) Y )  =  ( N `  ( X ( +g  `  G
) ( N `  Y ) ) ) )
241, 2, 4, 3grpsubval 13828 . . . . 5  |-  ( ( X  e.  B  /\  Y  e.  B )  ->  ( X  .-  Y
)  =  ( X ( +g  `  G
) ( N `  Y ) ) )
258, 11, 24syl2anc 415 . . . 4  |-  ( ph  ->  ( X  .-  Y
)  =  ( X ( +g  `  G
) ( N `  Y ) ) )
2625fveq2d 5694 . . 3  |-  ( ph  ->  ( N `  ( X  .-  Y ) )  =  ( N `  ( X ( +g  `  G
) ( N `  Y ) ) ) )
2723, 26eqtr4d 2274 . 2  |-  ( ph  ->  ( ( N `  X ) ( +g  `  G ) Y )  =  ( N `  ( X  .-  Y ) ) )
281, 3, 4grpinvsub 13864 . . 3  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  ->  ( N `  ( X  .-  Y ) )  =  ( Y  .-  X ) )
297, 8, 11, 28syl3anc 1278 . 2  |-  ( ph  ->  ( N `  ( X  .-  Y ) )  =  ( Y  .-  X ) )
3012, 27, 293eqtrd 2275 1  |-  ( ph  ->  ( ( N `  X )  .-  ( N `  Y )
)  =  ( Y 
.-  X ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1402    e. wcel 2209   ` cfv 5372  (class class class)co 6075   Basecbs 13330   +g cplusg 13408   Grpcgrp 13782   invgcminusg 13783   -gcsg 13784   Abelcabl 14065
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 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 4241  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1re 8263  ax-addrcl 8266
This theorem 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 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-inn 9284  df-2 9342  df-ndx 13333  df-slot 13334  df-base 13336  df-plusg 13421  df-0g 13589  df-mgm 13653  df-sgrp 13694  df-mnd 13707  df-grp 13785  df-minusg 13786  df-sbg 13787  df-cmn 14066  df-abl 14067
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator