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

Theorem subginv 19195
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 19191 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → 𝐻 ∈ Grp)
31subgbas 19192 . . . . . 6 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘𝐻))
43eleq2d 2855 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → (𝑋𝑆𝑋 ∈ (Base‘𝐻)))
54biimpa 481 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → 𝑋 ∈ (Base‘𝐻))
6 eqid 2769 . . . . 5 (Base‘𝐻) = (Base‘𝐻)
7 eqid 2769 . . . . 5 (+g𝐻) = (+g𝐻)
8 eqid 2769 . . . . 5 (0g𝐻) = (0g𝐻)
9 subginv.j . . . . 5 𝐽 = (invg𝐻)
106, 7, 8, 9grprinv 19053 . . . 4 ((𝐻 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐻)) → (𝑋(+g𝐻)(𝐽𝑋)) = (0g𝐻))
112, 5, 10syl2an2r 697 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝑋(+g𝐻)(𝐽𝑋)) = (0g𝐻))
12 eqid 2769 . . . . . 6 (+g𝐺) = (+g𝐺)
131, 12ressplusg 17340 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → (+g𝐺) = (+g𝐻))
1413adantr 485 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (+g𝐺) = (+g𝐻))
1514oveqd 7425 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝑋(+g𝐺)(𝐽𝑋)) = (𝑋(+g𝐻)(𝐽𝑋)))
16 eqid 2769 . . . . 5 (0g𝐺) = (0g𝐺)
171, 16subg0 19194 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → (0g𝐺) = (0g𝐻))
1817adantr 485 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (0g𝐺) = (0g𝐻))
1911, 15, 183eqtr4d 2814 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝑋(+g𝐺)(𝐽𝑋)) = (0g𝐺))
20 subgrcl 19193 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
2120adantr 485 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → 𝐺 ∈ Grp)
22 eqid 2769 . . . . 5 (Base‘𝐺) = (Base‘𝐺)
2322subgss 19189 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺))
2423sselda 3945 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → 𝑋 ∈ (Base‘𝐺))
256, 9grpinvcl 19050 . . . . . . . 8 ((𝐻 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐻)) → (𝐽𝑋) ∈ (Base‘𝐻))
2625ex 417 . . . . . . 7 (𝐻 ∈ Grp → (𝑋 ∈ (Base‘𝐻) → (𝐽𝑋) ∈ (Base‘𝐻)))
272, 26syl 18 . . . . . 6 (𝑆 ∈ (SubGrp‘𝐺) → (𝑋 ∈ (Base‘𝐻) → (𝐽𝑋) ∈ (Base‘𝐻)))
283eleq2d 2855 . . . . . 6 (𝑆 ∈ (SubGrp‘𝐺) → ((𝐽𝑋) ∈ 𝑆 ↔ (𝐽𝑋) ∈ (Base‘𝐻)))
2927, 4, 283imtr4d 297 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → (𝑋𝑆 → (𝐽𝑋) ∈ 𝑆))
3029imp 411 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝐽𝑋) ∈ 𝑆)
3123sselda 3945 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝐽𝑋) ∈ 𝑆) → (𝐽𝑋) ∈ (Base‘𝐺))
3230, 31syldan 602 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝐽𝑋) ∈ (Base‘𝐺))
33 subginv.i . . . 4 𝐼 = (invg𝐺)
3422, 12, 16, 33grpinvid1 19054 . . 3 ((𝐺 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐺) ∧ (𝐽𝑋) ∈ (Base‘𝐺)) → ((𝐼𝑋) = (𝐽𝑋) ↔ (𝑋(+g𝐺)(𝐽𝑋)) = (0g𝐺)))
3521, 24, 32, 34syl3anc 1396 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → ((𝐼𝑋) = (𝐽𝑋) ↔ (𝑋(+g𝐺)(𝐽𝑋)) = (0g𝐺)))
3619, 35mpbird 260 1 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝐼𝑋) = (𝐽𝑋))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1567  wcel 2149  cfv 6533  (class class class)co 7408  Basecbs 17265  s cress 17286  +gcplusg 17306  0gc0g 17488  Grpcgrp 18996  invgcminusg 18997  SubGrpcsubg 19182
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730  ax-cnex 11152  ax-resscn 11153  ax-1cn 11154  ax-icn 11155  ax-addcl 11156  ax-addrcl 11157  ax-mulcl 11158  ax-mulrcl 11159  ax-mulcom 11160  ax-addass 11161  ax-mulass 11162  ax-distr 11163  ax-i2m1 11164  ax-1ne0 11165  ax-1rid 11166  ax-rnegex 11167  ax-rrecex 11168  ax-cnre 11169  ax-pre-lttri 11170  ax-pre-lttrn 11171  ax-pre-ltadd 11172  ax-pre-mulgt0 11173
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-om 7859  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-er 8690  df-en 8940  df-dom 8941  df-sdom 8942  df-pnf 11241  df-mnf 11242  df-xr 11243  df-ltxr 11244  df-le 11245  df-sub 11439  df-neg 11440  df-nn 12230  df-2 12299  df-sets 17220  df-slot 17238  df-ndx 17250  df-base 17266  df-ress 17287  df-plusg 17319  df-0g 17490  df-mgm 18694  df-sgrp 18773  df-mnd 18789  df-grp 18999  df-minusg 19000  df-subg 19185
This theorem is referenced by:  subginvcl  19197  subgsub  19201  subgmulg  19203  zringlpirlem1  21577  prmirred  21589  psgninv  21697  mplneg  22124  subgtgp  24227  clmneg  25205  qrngneg  27749
  Copyright terms: Public domain W3C validator