Theorem subginv 14037

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

Step	Hyp	Ref	Expression
1		subg0.h	. . . . 5 ⊢ 𝐻 = (𝐺 ↾s 𝑆)
2	1	subggrp 14033	. . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐻 ∈ Grp)
3	1	subgbas 14034	. . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘𝐻))
4	3	eleq2d 2308	. . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝑋 ∈ 𝑆 ↔ 𝑋 ∈ (Base‘𝐻)))
5	4	biimpa 296	. . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ (Base‘𝐻))
6		eqid 2238	. . . . 5 ⊢ (Base‘𝐻) = (Base‘𝐻)
7		eqid 2238	. . . . 5 ⊢ (+g‘𝐻) = (+g‘𝐻)
8		eqid 2238	. . . . 5 ⊢ (0g‘𝐻) = (0g‘𝐻)
9		subginv.j	. . . . 5 ⊢ 𝐽 = (invg‘𝐻)
10	6, 7, 8, 9	grprinv 13909	. . . 4 ⊢ ((𝐻 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐻)) → (𝑋(+g‘𝐻)(𝐽‘𝑋)) = (0g‘𝐻))
11	2, 5, 10	syl2an2r 603	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (𝑋(+g‘𝐻)(𝐽‘𝑋)) = (0g‘𝐻))
12	1	a1i 9	. . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐻 = (𝐺 ↾s 𝑆))
13		eqidd 2239	. . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (+g‘𝐺) = (+g‘𝐺))
14		id 19	. . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺))
15		subgrcl 14035	. . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
16	12, 13, 14, 15	ressplusgd 13536	. . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (+g‘𝐺) = (+g‘𝐻))
17	16	adantr 276	. . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (+g‘𝐺) = (+g‘𝐻))
18	17	oveqd 6102	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (𝑋(+g‘𝐺)(𝐽‘𝑋)) = (𝑋(+g‘𝐻)(𝐽‘𝑋)))
19		eqid 2238	. . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺)
20	1, 19	subg0 14036	. . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (0g‘𝐺) = (0g‘𝐻))
21	20	adantr 276	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (0g‘𝐺) = (0g‘𝐻))
22	11, 18, 21	3eqtr4d 2281	. 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (𝑋(+g‘𝐺)(𝐽‘𝑋)) = (0g‘𝐺))
23	15	adantr 276	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → 𝐺 ∈ Grp)
24		eqid 2238	. . . . 5 ⊢ (Base‘𝐺) = (Base‘𝐺)
25	24	subgss 14030	. . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺))
26	25	sselda 3248	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ (Base‘𝐺))
27	6, 9	grpinvcl 13906	. . . . . . . 8 ⊢ ((𝐻 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐻)) → (𝐽‘𝑋) ∈ (Base‘𝐻))
28	27	ex 115	. . . . . . 7 ⊢ (𝐻 ∈ Grp → (𝑋 ∈ (Base‘𝐻) → (𝐽‘𝑋) ∈ (Base‘𝐻)))
29	2, 28	syl 14	. . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝑋 ∈ (Base‘𝐻) → (𝐽‘𝑋) ∈ (Base‘𝐻)))
30	3	eleq2d 2308	. . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → ((𝐽‘𝑋) ∈ 𝑆 ↔ (𝐽‘𝑋) ∈ (Base‘𝐻)))
31	29, 4, 30	3imtr4d 203	. . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝑋 ∈ 𝑆 → (𝐽‘𝑋) ∈ 𝑆))
32	31	imp 124	. . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (𝐽‘𝑋) ∈ 𝑆)
33	25	sselda 3248	. . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝐽‘𝑋) ∈ 𝑆) → (𝐽‘𝑋) ∈ (Base‘𝐺))
34	32, 33	syldan 282	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (𝐽‘𝑋) ∈ (Base‘𝐺))
35		eqid 2238	. . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺)
36		subginv.i	. . . 4 ⊢ 𝐼 = (invg‘𝐺)
37	24, 35, 19, 36	grpinvid1 13910	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐺) ∧ (𝐽‘𝑋) ∈ (Base‘𝐺)) → ((𝐼‘𝑋) = (𝐽‘𝑋) ↔ (𝑋(+g‘𝐺)(𝐽‘𝑋)) = (0g‘𝐺)))
38	23, 26, 34, 37	syl3anc 1278	. 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → ((𝐼‘𝑋) = (𝐽‘𝑋) ↔ (𝑋(+g‘𝐺)(𝐽‘𝑋)) = (0g‘𝐺)))
39	22, 38	mpbird 167	1 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (𝐼‘𝑋) = (𝐽‘𝑋))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  ‘cfv 5377  (class class class)co 6085  Basecbs 13404   ↾_s cress 13405  +_gcplusg 13484  0_gc0g 13663  Grpcgrp 13858  inv_gcminusg 13859  SubGrpcsubg 14023

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-addcom 8280  ax-addass 8282  ax-i2m1 8285  ax-0lt1 8286  ax-0id 8288  ax-rnegex 8289  ax-pre-ltirr 8292  ax-pre-ltadd 8296

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8363  df-mnf 8364  df-ltxr 8366  df-inn 9308  df-2 9366  df-ndx 13407  df-slot 13408  df-base 13410  df-sets 13411  df-iress 13412  df-plusg 13497  df-0g 13665  df-mgm 13729  df-sgrp 13770  df-mnd 13783  df-grp 13861  df-minusg 13862  df-subg 14026

This theorem is used by:  subginvcl  14039  subgsub  14042  subgmulg  14044  mplnegfi  15187