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

Theorem subginv 13829
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 13825 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → 𝐻 ∈ Grp)
31subgbas 13826 . . . . . 6 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘𝐻))
43eleq2d 2301 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → (𝑋𝑆𝑋 ∈ (Base‘𝐻)))
54biimpa 296 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → 𝑋 ∈ (Base‘𝐻))
6 eqid 2231 . . . . 5 (Base‘𝐻) = (Base‘𝐻)
7 eqid 2231 . . . . 5 (+g𝐻) = (+g𝐻)
8 eqid 2231 . . . . 5 (0g𝐻) = (0g𝐻)
9 subginv.j . . . . 5 𝐽 = (invg𝐻)
106, 7, 8, 9grprinv 13695 . . . 4 ((𝐻 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐻)) → (𝑋(+g𝐻)(𝐽𝑋)) = (0g𝐻))
112, 5, 10syl2an2r 599 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝑋(+g𝐻)(𝐽𝑋)) = (0g𝐻))
121a1i 9 . . . . . 6 (𝑆 ∈ (SubGrp‘𝐺) → 𝐻 = (𝐺s 𝑆))
13 eqidd 2232 . . . . . 6 (𝑆 ∈ (SubGrp‘𝐺) → (+g𝐺) = (+g𝐺))
14 id 19 . . . . . 6 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺))
15 subgrcl 13827 . . . . . 6 (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
1612, 13, 14, 15ressplusgd 13273 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → (+g𝐺) = (+g𝐻))
1716adantr 276 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (+g𝐺) = (+g𝐻))
1817oveqd 6045 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝑋(+g𝐺)(𝐽𝑋)) = (𝑋(+g𝐻)(𝐽𝑋)))
19 eqid 2231 . . . . 5 (0g𝐺) = (0g𝐺)
201, 19subg0 13828 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → (0g𝐺) = (0g𝐻))
2120adantr 276 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (0g𝐺) = (0g𝐻))
2211, 18, 213eqtr4d 2274 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝑋(+g𝐺)(𝐽𝑋)) = (0g𝐺))
2315adantr 276 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → 𝐺 ∈ Grp)
24 eqid 2231 . . . . 5 (Base‘𝐺) = (Base‘𝐺)
2524subgss 13822 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺))
2625sselda 3228 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → 𝑋 ∈ (Base‘𝐺))
276, 9grpinvcl 13692 . . . . . . . 8 ((𝐻 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐻)) → (𝐽𝑋) ∈ (Base‘𝐻))
2827ex 115 . . . . . . 7 (𝐻 ∈ Grp → (𝑋 ∈ (Base‘𝐻) → (𝐽𝑋) ∈ (Base‘𝐻)))
292, 28syl 14 . . . . . 6 (𝑆 ∈ (SubGrp‘𝐺) → (𝑋 ∈ (Base‘𝐻) → (𝐽𝑋) ∈ (Base‘𝐻)))
303eleq2d 2301 . . . . . 6 (𝑆 ∈ (SubGrp‘𝐺) → ((𝐽𝑋) ∈ 𝑆 ↔ (𝐽𝑋) ∈ (Base‘𝐻)))
3129, 4, 303imtr4d 203 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → (𝑋𝑆 → (𝐽𝑋) ∈ 𝑆))
3231imp 124 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝐽𝑋) ∈ 𝑆)
3325sselda 3228 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝐽𝑋) ∈ 𝑆) → (𝐽𝑋) ∈ (Base‘𝐺))
3432, 33syldan 282 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝐽𝑋) ∈ (Base‘𝐺))
35 eqid 2231 . . . 4 (+g𝐺) = (+g𝐺)
36 subginv.i . . . 4 𝐼 = (invg𝐺)
3724, 35, 19, 36grpinvid1 13696 . . 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 2202  cfv 5333  (class class class)co 6028  Basecbs 13143  s cress 13144  +gcplusg 13221  0gc0g 13400  Grpcgrp 13644  invgcminusg 13645  SubGrpcsubg 13815
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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-addcom 8175  ax-addass 8177  ax-i2m1 8180  ax-0lt1 8181  ax-0id 8183  ax-rnegex 8184  ax-pre-ltirr 8187  ax-pre-ltadd 8191
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-pnf 8259  df-mnf 8260  df-ltxr 8262  df-inn 9187  df-2 9245  df-ndx 13146  df-slot 13147  df-base 13149  df-sets 13150  df-iress 13151  df-plusg 13234  df-0g 13402  df-mgm 13500  df-sgrp 13546  df-mnd 13561  df-grp 13647  df-minusg 13648  df-subg 13818
This theorem is referenced by:  subginvcl  13831  subgsub  13834  subgmulg  13836  mplnegfi  14786
  Copyright terms: Public domain W3C validator