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

Theorem subginv 13773
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 13769 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → 𝐻 ∈ Grp)
31subgbas 13770 . . . . . 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 13639 . . . 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 13771 . . . . . 6 (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
1612, 13, 14, 15ressplusgd 13217 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → (+g𝐺) = (+g𝐻))
1716adantr 276 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (+g𝐺) = (+g𝐻))
1817oveqd 6035 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝑋(+g𝐺)(𝐽𝑋)) = (𝑋(+g𝐻)(𝐽𝑋)))
19 eqid 2231 . . . . 5 (0g𝐺) = (0g𝐺)
201, 19subg0 13772 . . . 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 13766 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺))
2625sselda 3227 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → 𝑋 ∈ (Base‘𝐺))
276, 9grpinvcl 13636 . . . . . . . 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 3227 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝐽𝑋) ∈ 𝑆) → (𝐽𝑋) ∈ (Base‘𝐺))
3432, 33syldan 282 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝐽𝑋) ∈ (Base‘𝐺))
35 eqid 2231 . . . 4 (+g𝐺) = (+g𝐺)
36 subginv.i . . . 4 𝐼 = (invg𝐺)
3724, 35, 19, 36grpinvid1 13640 . . 3 ((𝐺 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐺) ∧ (𝐽𝑋) ∈ (Base‘𝐺)) → ((𝐼𝑋) = (𝐽𝑋) ↔ (𝑋(+g𝐺)(𝐽𝑋)) = (0g𝐺)))
3823, 26, 34, 37syl3anc 1273 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → ((𝐼𝑋) = (𝐽𝑋) ↔ (𝑋(+g𝐺)(𝐽𝑋)) = (0g𝐺)))
3922, 38mpbird 167 1 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆) → (𝐼𝑋) = (𝐽𝑋))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1397  wcel 2202  cfv 5326  (class class class)co 6018  Basecbs 13087  s cress 13088  +gcplusg 13165  0gc0g 13344  Grpcgrp 13588  invgcminusg 13589  SubGrpcsubg 13759
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-addcom 8132  ax-addass 8134  ax-i2m1 8137  ax-0lt1 8138  ax-0id 8140  ax-rnegex 8141  ax-pre-ltirr 8144  ax-pre-ltadd 8148
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-pnf 8216  df-mnf 8217  df-ltxr 8219  df-inn 9144  df-2 9202  df-ndx 13090  df-slot 13091  df-base 13093  df-sets 13094  df-iress 13095  df-plusg 13178  df-0g 13346  df-mgm 13444  df-sgrp 13490  df-mnd 13505  df-grp 13591  df-minusg 13592  df-subg 13762
This theorem is referenced by:  subginvcl  13775  subgsub  13778  subgmulg  13780  mplnegfi  14725
  Copyright terms: Public domain W3C validator