Theorem subginv 13387

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 13383	. . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐻 ∈ Grp)
3	1	subgbas 13384	. . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘𝐻))
4	3	eleq2d 2266	. . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝑋 ∈ 𝑆 ↔ 𝑋 ∈ (Base‘𝐻)))
5	4	biimpa 296	. . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ (Base‘𝐻))
6		eqid 2196	. . . . 5 ⊢ (Base‘𝐻) = (Base‘𝐻)
7		eqid 2196	. . . . 5 ⊢ (+g‘𝐻) = (+g‘𝐻)
8		eqid 2196	. . . . 5 ⊢ (0g‘𝐻) = (0g‘𝐻)
9		subginv.j	. . . . 5 ⊢ 𝐽 = (invg‘𝐻)
10	6, 7, 8, 9	grprinv 13253	. . . 4 ⊢ ((𝐻 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐻)) → (𝑋(+g‘𝐻)(𝐽‘𝑋)) = (0g‘𝐻))
11	2, 5, 10	syl2an2r 595	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (𝑋(+g‘𝐻)(𝐽‘𝑋)) = (0g‘𝐻))
12	1	a1i 9	. . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐻 = (𝐺 ↾s 𝑆))
13		eqidd 2197	. . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (+g‘𝐺) = (+g‘𝐺))
14		id 19	. . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺))
15		subgrcl 13385	. . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
16	12, 13, 14, 15	ressplusgd 12831	. . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (+g‘𝐺) = (+g‘𝐻))
17	16	adantr 276	. . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (+g‘𝐺) = (+g‘𝐻))
18	17	oveqd 5942	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (𝑋(+g‘𝐺)(𝐽‘𝑋)) = (𝑋(+g‘𝐻)(𝐽‘𝑋)))
19		eqid 2196	. . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺)
20	1, 19	subg0 13386	. . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (0g‘𝐺) = (0g‘𝐻))
21	20	adantr 276	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (0g‘𝐺) = (0g‘𝐻))
22	11, 18, 21	3eqtr4d 2239	. 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (𝑋(+g‘𝐺)(𝐽‘𝑋)) = (0g‘𝐺))
23	15	adantr 276	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → 𝐺 ∈ Grp)
24		eqid 2196	. . . . 5 ⊢ (Base‘𝐺) = (Base‘𝐺)
25	24	subgss 13380	. . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺))
26	25	sselda 3184	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ (Base‘𝐺))
27	6, 9	grpinvcl 13250	. . . . . . . 8 ⊢ ((𝐻 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐻)) → (𝐽‘𝑋) ∈ (Base‘𝐻))
28	27	ex 115	. . . . . . 7 ⊢ (𝐻 ∈ Grp → (𝑋 ∈ (Base‘𝐻) → (𝐽‘𝑋) ∈ (Base‘𝐻)))
29	2, 28	syl 14	. . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝑋 ∈ (Base‘𝐻) → (𝐽‘𝑋) ∈ (Base‘𝐻)))
30	3	eleq2d 2266	. . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → ((𝐽‘𝑋) ∈ 𝑆 ↔ (𝐽‘𝑋) ∈ (Base‘𝐻)))
31	29, 4, 30	3imtr4d 203	. . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝑋 ∈ 𝑆 → (𝐽‘𝑋) ∈ 𝑆))
32	31	imp 124	. . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (𝐽‘𝑋) ∈ 𝑆)
33	25	sselda 3184	. . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝐽‘𝑋) ∈ 𝑆) → (𝐽‘𝑋) ∈ (Base‘𝐺))
34	32, 33	syldan 282	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (𝐽‘𝑋) ∈ (Base‘𝐺))
35		eqid 2196	. . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺)
36		subginv.i	. . . 4 ⊢ 𝐼 = (invg‘𝐺)
37	24, 35, 19, 36	grpinvid1 13254	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐺) ∧ (𝐽‘𝑋) ∈ (Base‘𝐺)) → ((𝐼‘𝑋) = (𝐽‘𝑋) ↔ (𝑋(+g‘𝐺)(𝐽‘𝑋)) = (0g‘𝐺)))
38	23, 26, 34, 37	syl3anc 1249	. 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → ((𝐼‘𝑋) = (𝐽‘𝑋) ↔ (𝑋(+g‘𝐺)(𝐽‘𝑋)) = (0g‘𝐺)))
39	22, 38	mpbird 167	1 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (𝐼‘𝑋) = (𝐽‘𝑋))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1364   ∈ wcel 2167  ‘cfv 5259  (class class class)co 5925  Basecbs 12703   ↾_s cress 12704  +_gcplusg 12780  0_gc0g 12958  Grpcgrp 13202  inv_gcminusg 13203  SubGrpcsubg 13373

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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-addcom 7996  ax-addass 7998  ax-i2m1 8001  ax-0lt1 8002  ax-0id 8004  ax-rnegex 8005  ax-pre-ltirr 8008  ax-pre-ltadd 8012

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-pnf 8080  df-mnf 8081  df-ltxr 8083  df-inn 9008  df-2 9066  df-ndx 12706  df-slot 12707  df-base 12709  df-sets 12710  df-iress 12711  df-plusg 12793  df-0g 12960  df-mgm 13058  df-sgrp 13104  df-mnd 13119  df-grp 13205  df-minusg 13206  df-subg 13376

This theorem is referenced by:  subginvcl  13389  subgsub  13392  subgmulg  13394