MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  subginv Structured version   Visualization version   GIF version

Theorem subginv 19109
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 19105 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → 𝐻 ∈ Grp)
31subgbas 19106 . . . . . 6 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘𝐻))
43eleq2d 2822 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → (𝑋𝑆𝑋 ∈ (Base‘𝐻)))
54biimpa 476 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → 𝑋 ∈ (Base‘𝐻))
6 eqid 2736 . . . . 5 (Base‘𝐻) = (Base‘𝐻)
7 eqid 2736 . . . . 5 (+g𝐻) = (+g𝐻)
8 eqid 2736 . . . . 5 (0g𝐻) = (0g𝐻)
9 subginv.j . . . . 5 𝐽 = (invg𝐻)
106, 7, 8, 9grprinv 18966 . . . 4 ((𝐻 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐻)) → (𝑋(+g𝐻)(𝐽𝑋)) = (0g𝐻))
112, 5, 10syl2an2r 686 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝑋(+g𝐻)(𝐽𝑋)) = (0g𝐻))
12 eqid 2736 . . . . . 6 (+g𝐺) = (+g𝐺)
131, 12ressplusg 17254 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → (+g𝐺) = (+g𝐻))
1413adantr 480 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (+g𝐺) = (+g𝐻))
1514oveqd 7384 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝑋(+g𝐺)(𝐽𝑋)) = (𝑋(+g𝐻)(𝐽𝑋)))
16 eqid 2736 . . . . 5 (0g𝐺) = (0g𝐺)
171, 16subg0 19108 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → (0g𝐺) = (0g𝐻))
1817adantr 480 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (0g𝐺) = (0g𝐻))
1911, 15, 183eqtr4d 2781 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝑋(+g𝐺)(𝐽𝑋)) = (0g𝐺))
20 subgrcl 19107 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
2120adantr 480 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → 𝐺 ∈ Grp)
22 eqid 2736 . . . . 5 (Base‘𝐺) = (Base‘𝐺)
2322subgss 19103 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺))
2423sselda 3921 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → 𝑋 ∈ (Base‘𝐺))
256, 9grpinvcl 18963 . . . . . . . 8 ((𝐻 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐻)) → (𝐽𝑋) ∈ (Base‘𝐻))
2625ex 412 . . . . . . 7 (𝐻 ∈ Grp → (𝑋 ∈ (Base‘𝐻) → (𝐽𝑋) ∈ (Base‘𝐻)))
272, 26syl 17 . . . . . 6 (𝑆 ∈ (SubGrp‘𝐺) → (𝑋 ∈ (Base‘𝐻) → (𝐽𝑋) ∈ (Base‘𝐻)))
283eleq2d 2822 . . . . . 6 (𝑆 ∈ (SubGrp‘𝐺) → ((𝐽𝑋) ∈ 𝑆 ↔ (𝐽𝑋) ∈ (Base‘𝐻)))
2927, 4, 283imtr4d 294 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → (𝑋𝑆 → (𝐽𝑋) ∈ 𝑆))
3029imp 406 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝐽𝑋) ∈ 𝑆)
3123sselda 3921 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝐽𝑋) ∈ 𝑆) → (𝐽𝑋) ∈ (Base‘𝐺))
3230, 31syldan 592 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝐽𝑋) ∈ (Base‘𝐺))
33 subginv.i . . . 4 𝐼 = (invg𝐺)
3422, 12, 16, 33grpinvid1 18967 . . 3 ((𝐺 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐺) ∧ (𝐽𝑋) ∈ (Base‘𝐺)) → ((𝐼𝑋) = (𝐽𝑋) ↔ (𝑋(+g𝐺)(𝐽𝑋)) = (0g𝐺)))
3521, 24, 32, 34syl3anc 1374 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → ((𝐼𝑋) = (𝐽𝑋) ↔ (𝑋(+g𝐺)(𝐽𝑋)) = (0g𝐺)))
3619, 35mpbird 257 1 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝐼𝑋) = (𝐽𝑋))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  cfv 6498  (class class class)co 7367  Basecbs 17179  s cress 17200  +gcplusg 17220  0gc0g 17402  Grpcgrp 18909  invgcminusg 18910  SubGrpcsubg 19096
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-er 8643  df-en 8894  df-dom 8895  df-sdom 8896  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-sub 11379  df-neg 11380  df-nn 12175  df-2 12244  df-sets 17134  df-slot 17152  df-ndx 17164  df-base 17180  df-ress 17201  df-plusg 17233  df-0g 17404  df-mgm 18608  df-sgrp 18687  df-mnd 18703  df-grp 18912  df-minusg 18913  df-subg 19099
This theorem is referenced by:  subginvcl  19111  subgsub  19114  subgmulg  19116  zringlpirlem1  21442  prmirred  21454  psgninv  21562  mplneg  21988  subgtgp  24070  clmneg  25048  qrngneg  27586
  Copyright terms: Public domain W3C validator