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

Theorem subgsub 13989
Description: The subtraction of elements in a subgroup is the same as subtraction in the group. (Contributed by Mario Carneiro, 15-Jun-2015.)
Hypotheses
Ref Expression
subgsubcl.p  |-  .-  =  ( -g `  G )
subgsub.h  |-  H  =  ( Gs  S )
subgsub.n  |-  N  =  ( -g `  H
)
Assertion
Ref Expression
subgsub  |-  ( ( S  e.  (SubGrp `  G )  /\  X  e.  S  /\  Y  e.  S )  ->  ( X  .-  Y )  =  ( X N Y ) )

Proof of Theorem subgsub
StepHypRef Expression
1 subgsub.h . . . . . 6  |-  H  =  ( Gs  S )
21a1i 9 . . . . 5  |-  ( S  e.  (SubGrp `  G
)  ->  H  =  ( Gs  S ) )
3 eqidd 2239 . . . . 5  |-  ( S  e.  (SubGrp `  G
)  ->  ( +g  `  G )  =  ( +g  `  G ) )
4 id 19 . . . . 5  |-  ( S  e.  (SubGrp `  G
)  ->  S  e.  (SubGrp `  G ) )
5 subgrcl 13982 . . . . 5  |-  ( S  e.  (SubGrp `  G
)  ->  G  e.  Grp )
62, 3, 4, 5ressplusgd 13483 . . . 4  |-  ( S  e.  (SubGrp `  G
)  ->  ( +g  `  G )  =  ( +g  `  H ) )
763ad2ant1 1049 . . 3  |-  ( ( S  e.  (SubGrp `  G )  /\  X  e.  S  /\  Y  e.  S )  ->  ( +g  `  G )  =  ( +g  `  H
) )
8 eqidd 2239 . . 3  |-  ( ( S  e.  (SubGrp `  G )  /\  X  e.  S  /\  Y  e.  S )  ->  X  =  X )
9 eqid 2238 . . . . 5  |-  ( invg `  G )  =  ( invg `  G )
10 eqid 2238 . . . . 5  |-  ( invg `  H )  =  ( invg `  H )
111, 9, 10subginv 13984 . . . 4  |-  ( ( S  e.  (SubGrp `  G )  /\  Y  e.  S )  ->  (
( invg `  G ) `  Y
)  =  ( ( invg `  H
) `  Y )
)
12113adant2 1047 . . 3  |-  ( ( S  e.  (SubGrp `  G )  /\  X  e.  S  /\  Y  e.  S )  ->  (
( invg `  G ) `  Y
)  =  ( ( invg `  H
) `  Y )
)
137, 8, 12oveq123d 6106 . 2  |-  ( ( S  e.  (SubGrp `  G )  /\  X  e.  S  /\  Y  e.  S )  ->  ( X ( +g  `  G
) ( ( invg `  G ) `
 Y ) )  =  ( X ( +g  `  H ) ( ( invg `  H ) `  Y
) ) )
14 eqid 2238 . . . . . 6  |-  ( Base `  G )  =  (
Base `  G )
1514subgss 13977 . . . . 5  |-  ( S  e.  (SubGrp `  G
)  ->  S  C_  ( Base `  G ) )
16153ad2ant1 1049 . . . 4  |-  ( ( S  e.  (SubGrp `  G )  /\  X  e.  S  /\  Y  e.  S )  ->  S  C_  ( Base `  G
) )
17 simp2 1029 . . . 4  |-  ( ( S  e.  (SubGrp `  G )  /\  X  e.  S  /\  Y  e.  S )  ->  X  e.  S )
1816, 17sseldd 3249 . . 3  |-  ( ( S  e.  (SubGrp `  G )  /\  X  e.  S  /\  Y  e.  S )  ->  X  e.  ( Base `  G
) )
19 simp3 1030 . . . 4  |-  ( ( S  e.  (SubGrp `  G )  /\  X  e.  S  /\  Y  e.  S )  ->  Y  e.  S )
2016, 19sseldd 3249 . . 3  |-  ( ( S  e.  (SubGrp `  G )  /\  X  e.  S  /\  Y  e.  S )  ->  Y  e.  ( Base `  G
) )
21 eqid 2238 . . . 4  |-  ( +g  `  G )  =  ( +g  `  G )
22 subgsubcl.p . . . 4  |-  .-  =  ( -g `  G )
2314, 21, 9, 22grpsubval 13851 . . 3  |-  ( ( X  e.  ( Base `  G )  /\  Y  e.  ( Base `  G
) )  ->  ( X  .-  Y )  =  ( X ( +g  `  G ) ( ( invg `  G
) `  Y )
) )
2418, 20, 23syl2anc 415 . 2  |-  ( ( S  e.  (SubGrp `  G )  /\  X  e.  S  /\  Y  e.  S )  ->  ( X  .-  Y )  =  ( X ( +g  `  G ) ( ( invg `  G
) `  Y )
) )
251subgbas 13981 . . . . 5  |-  ( S  e.  (SubGrp `  G
)  ->  S  =  ( Base `  H )
)
26253ad2ant1 1049 . . . 4  |-  ( ( S  e.  (SubGrp `  G )  /\  X  e.  S  /\  Y  e.  S )  ->  S  =  ( Base `  H
) )
2717, 26eleqtrd 2317 . . 3  |-  ( ( S  e.  (SubGrp `  G )  /\  X  e.  S  /\  Y  e.  S )  ->  X  e.  ( Base `  H
) )
2819, 26eleqtrd 2317 . . 3  |-  ( ( S  e.  (SubGrp `  G )  /\  X  e.  S  /\  Y  e.  S )  ->  Y  e.  ( Base `  H
) )
29 eqid 2238 . . . 4  |-  ( Base `  H )  =  (
Base `  H )
30 eqid 2238 . . . 4  |-  ( +g  `  H )  =  ( +g  `  H )
31 subgsub.n . . . 4  |-  N  =  ( -g `  H
)
3229, 30, 10, 31grpsubval 13851 . . 3  |-  ( ( X  e.  ( Base `  H )  /\  Y  e.  ( Base `  H
) )  ->  ( X N Y )  =  ( X ( +g  `  H ) ( ( invg `  H
) `  Y )
) )
3327, 28, 32syl2anc 415 . 2  |-  ( ( S  e.  (SubGrp `  G )  /\  X  e.  S  /\  Y  e.  S )  ->  ( X N Y )  =  ( X ( +g  `  H ) ( ( invg `  H
) `  Y )
) )
3413, 24, 333eqtr4d 2281 1  |-  ( ( S  e.  (SubGrp `  G )  /\  X  e.  S  /\  Y  e.  S )  ->  ( X  .-  Y )  =  ( X N Y ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ w3a 1009    = wceq 1402    e. wcel 2209    C_ wss 3220   ` cfv 5377  (class class class)co 6085   Basecbs 13352   ↾s cress 13353   +g cplusg 13431   Grpcgrp 13805   invgcminusg 13806   -gcsg 13807  SubGrpcsubg 13970
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-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-pre-ltirr 8291  ax-pre-ltadd 8295
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-nel 2516  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-nul 3521  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-pnf 8362  df-mnf 8363  df-ltxr 8365  df-inn 9305  df-2 9363  df-ndx 13355  df-slot 13356  df-base 13358  df-sets 13359  df-iress 13360  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-subg 13973
This theorem is used by:  zringsubgval  14940  zndvds  14984
  Copyright terms: Public domain W3C validator