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

Theorem subginv 13890
Description: The inverse of an element in a subgroup is the same as the inverse in the larger group. (Contributed by Mario Carneiro, 2-Dec-2014.)
Hypotheses
Ref Expression
subg0.h 𝐻 = (𝐺s 𝑆)
subginv.i 𝐼 = (invg𝐺)
subginv.j 𝐽 = (invg𝐻)
Assertion
Ref Expression
subginv ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝐼𝑋) = (𝐽𝑋))

Proof of Theorem subginv
StepHypRef Expression
1 subg0.h . . . . 5 𝐻 = (𝐺s 𝑆)
21subggrp 13886 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → 𝐻 ∈ Grp)
31subgbas 13887 . . . . . 6 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘𝐻))
43eleq2d 2302 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → (𝑋𝑆𝑋 ∈ (Base‘𝐻)))
54biimpa 296 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → 𝑋 ∈ (Base‘𝐻))
6 eqid 2232 . . . . 5 (Base‘𝐻) = (Base‘𝐻)
7 eqid 2232 . . . . 5 (+g𝐻) = (+g𝐻)
8 eqid 2232 . . . . 5 (0g𝐻) = (0g𝐻)
9 subginv.j . . . . 5 𝐽 = (invg𝐻)
106, 7, 8, 9grprinv 13756 . . . 4 ((𝐻 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐻)) → (𝑋(+g𝐻)(𝐽𝑋)) = (0g𝐻))
112, 5, 10syl2an2r 599 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝑋(+g𝐻)(𝐽𝑋)) = (0g𝐻))
121a1i 9 . . . . . 6 (𝑆 ∈ (SubGrp‘𝐺) → 𝐻 = (𝐺s 𝑆))
13 eqidd 2233 . . . . . 6 (𝑆 ∈ (SubGrp‘𝐺) → (+g𝐺) = (+g𝐺))
14 id 19 . . . . . 6 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺))
15 subgrcl 13888 . . . . . 6 (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
1612, 13, 14, 15ressplusgd 13334 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → (+g𝐺) = (+g𝐻))
1716adantr 276 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (+g𝐺) = (+g𝐻))
1817oveqd 6066 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝑋(+g𝐺)(𝐽𝑋)) = (𝑋(+g𝐻)(𝐽𝑋)))
19 eqid 2232 . . . . 5 (0g𝐺) = (0g𝐺)
201, 19subg0 13889 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → (0g𝐺) = (0g𝐻))
2120adantr 276 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (0g𝐺) = (0g𝐻))
2211, 18, 213eqtr4d 2275 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝑋(+g𝐺)(𝐽𝑋)) = (0g𝐺))
2315adantr 276 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → 𝐺 ∈ Grp)
24 eqid 2232 . . . . 5 (Base‘𝐺) = (Base‘𝐺)
2524subgss 13883 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺))
2625sselda 3237 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → 𝑋 ∈ (Base‘𝐺))
276, 9grpinvcl 13753 . . . . . . . 8 ((𝐻 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐻)) → (𝐽𝑋) ∈ (Base‘𝐻))
2827ex 115 . . . . . . 7 (𝐻 ∈ Grp → (𝑋 ∈ (Base‘𝐻) → (𝐽𝑋) ∈ (Base‘𝐻)))
292, 28syl 14 . . . . . 6 (𝑆 ∈ (SubGrp‘𝐺) → (𝑋 ∈ (Base‘𝐻) → (𝐽𝑋) ∈ (Base‘𝐻)))
303eleq2d 2302 . . . . . 6 (𝑆 ∈ (SubGrp‘𝐺) → ((𝐽𝑋) ∈ 𝑆 ↔ (𝐽𝑋) ∈ (Base‘𝐻)))
3129, 4, 303imtr4d 203 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → (𝑋𝑆 → (𝐽𝑋) ∈ 𝑆))
3231imp 124 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝐽𝑋) ∈ 𝑆)
3325sselda 3237 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝐽𝑋) ∈ 𝑆) → (𝐽𝑋) ∈ (Base‘𝐺))
3432, 33syldan 282 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝐽𝑋) ∈ (Base‘𝐺))
35 eqid 2232 . . . 4 (+g𝐺) = (+g𝐺)
36 subginv.i . . . 4 𝐼 = (invg𝐺)
3724, 35, 19, 36grpinvid1 13757 . . 3 ((𝐺 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐺) ∧ (𝐽𝑋) ∈ (Base‘𝐺)) → ((𝐼𝑋) = (𝐽𝑋) ↔ (𝑋(+g𝐺)(𝐽𝑋)) = (0g𝐺)))
3823, 26, 34, 37syl3anc 1274 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → ((𝐼𝑋) = (𝐽𝑋) ↔ (𝑋(+g𝐺)(𝐽𝑋)) = (0g𝐺)))
3922, 38mpbird 167 1 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝐼𝑋) = (𝐽𝑋))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1398  wcel 2203  cfv 5351  (class class class)co 6049  Basecbs 13204  s cress 13205  +gcplusg 13282  0gc0g 13461  Grpcgrp 13705  invgcminusg 13706  SubGrpcsubg 13876
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4224  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-cnex 8217  ax-resscn 8218  ax-1cn 8219  ax-1re 8220  ax-icn 8221  ax-addcl 8222  ax-addrcl 8223  ax-mulcl 8224  ax-addcom 8226  ax-addass 8228  ax-i2m1 8231  ax-0lt1 8232  ax-0id 8234  ax-rnegex 8235  ax-pre-ltirr 8238  ax-pre-ltadd 8242
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-riota 6002  df-ov 6052  df-oprab 6053  df-mpo 6054  df-pnf 8309  df-mnf 8310  df-ltxr 8312  df-inn 9237  df-2 9295  df-ndx 13207  df-slot 13208  df-base 13210  df-sets 13211  df-iress 13212  df-plusg 13295  df-0g 13463  df-mgm 13561  df-sgrp 13607  df-mnd 13622  df-grp 13708  df-minusg 13709  df-subg 13879
This theorem is referenced by:  subginvcl  13892  subgsub  13895  subgmulg  13897  mplnegfi  14852
  Copyright terms: Public domain W3C validator