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

Theorem subgsub 13718
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𝐺)
subgsub.h 𝐻 = (𝐺s 𝑆)
subgsub.n 𝑁 = (-g𝐻)
Assertion
Ref Expression
subgsub ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → (𝑋 𝑌) = (𝑋𝑁𝑌))

Proof of Theorem subgsub
StepHypRef Expression
1 subgsub.h . . . . . 6 𝐻 = (𝐺s 𝑆)
21a1i 9 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → 𝐻 = (𝐺s 𝑆))
3 eqidd 2230 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → (+g𝐺) = (+g𝐺))
4 id 19 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺))
5 subgrcl 13711 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
62, 3, 4, 5ressplusgd 13157 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → (+g𝐺) = (+g𝐻))
763ad2ant1 1042 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → (+g𝐺) = (+g𝐻))
8 eqidd 2230 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → 𝑋 = 𝑋)
9 eqid 2229 . . . . 5 (invg𝐺) = (invg𝐺)
10 eqid 2229 . . . . 5 (invg𝐻) = (invg𝐻)
111, 9, 10subginv 13713 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑌𝑆) → ((invg𝐺)‘𝑌) = ((invg𝐻)‘𝑌))
12113adant2 1040 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → ((invg𝐺)‘𝑌) = ((invg𝐻)‘𝑌))
137, 8, 12oveq123d 6021 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → (𝑋(+g𝐺)((invg𝐺)‘𝑌)) = (𝑋(+g𝐻)((invg𝐻)‘𝑌)))
14 eqid 2229 . . . . . 6 (Base‘𝐺) = (Base‘𝐺)
1514subgss 13706 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺))
16153ad2ant1 1042 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → 𝑆 ⊆ (Base‘𝐺))
17 simp2 1022 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → 𝑋𝑆)
1816, 17sseldd 3225 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → 𝑋 ∈ (Base‘𝐺))
19 simp3 1023 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → 𝑌𝑆)
2016, 19sseldd 3225 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → 𝑌 ∈ (Base‘𝐺))
21 eqid 2229 . . . 4 (+g𝐺) = (+g𝐺)
22 subgsubcl.p . . . 4 = (-g𝐺)
2314, 21, 9, 22grpsubval 13574 . . 3 ((𝑋 ∈ (Base‘𝐺) ∧ 𝑌 ∈ (Base‘𝐺)) → (𝑋 𝑌) = (𝑋(+g𝐺)((invg𝐺)‘𝑌)))
2418, 20, 23syl2anc 411 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → (𝑋 𝑌) = (𝑋(+g𝐺)((invg𝐺)‘𝑌)))
251subgbas 13710 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘𝐻))
26253ad2ant1 1042 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → 𝑆 = (Base‘𝐻))
2717, 26eleqtrd 2308 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → 𝑋 ∈ (Base‘𝐻))
2819, 26eleqtrd 2308 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → 𝑌 ∈ (Base‘𝐻))
29 eqid 2229 . . . 4 (Base‘𝐻) = (Base‘𝐻)
30 eqid 2229 . . . 4 (+g𝐻) = (+g𝐻)
31 subgsub.n . . . 4 𝑁 = (-g𝐻)
3229, 30, 10, 31grpsubval 13574 . . 3 ((𝑋 ∈ (Base‘𝐻) ∧ 𝑌 ∈ (Base‘𝐻)) → (𝑋𝑁𝑌) = (𝑋(+g𝐻)((invg𝐻)‘𝑌)))
3327, 28, 32syl2anc 411 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → (𝑋𝑁𝑌) = (𝑋(+g𝐻)((invg𝐻)‘𝑌)))
3413, 24, 333eqtr4d 2272 1 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → (𝑋 𝑌) = (𝑋𝑁𝑌))
Colors of variables: wff set class
Syntax hints:  wi 4  w3a 1002   = wceq 1395  wcel 2200  wss 3197  cfv 5317  (class class class)co 6000  Basecbs 13027  s cress 13028  +gcplusg 13105  Grpcgrp 13528  invgcminusg 13529  -gcsg 13530  SubGrpcsubg 13699
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4198  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-cnex 8086  ax-resscn 8087  ax-1cn 8088  ax-1re 8089  ax-icn 8090  ax-addcl 8091  ax-addrcl 8092  ax-mulcl 8093  ax-addcom 8095  ax-addass 8097  ax-i2m1 8100  ax-0lt1 8101  ax-0id 8103  ax-rnegex 8104  ax-pre-ltirr 8107  ax-pre-ltadd 8111
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-riota 5953  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-pnf 8179  df-mnf 8180  df-ltxr 8182  df-inn 9107  df-2 9165  df-ndx 13030  df-slot 13031  df-base 13033  df-sets 13034  df-iress 13035  df-plusg 13118  df-0g 13286  df-mgm 13384  df-sgrp 13430  df-mnd 13445  df-grp 13531  df-minusg 13532  df-sbg 13533  df-subg 13702
This theorem is referenced by:  zringsubgval  14563  zndvds  14607
  Copyright terms: Public domain W3C validator