Theorem resghm 13792

Description: Restriction of a homomorphism to a subgroup. (Contributed by Stefan O'Rear, 31-Dec-2014.)

Hypothesis

Ref	Expression
resghm.u	⊢ 𝑈 = (𝑆 ↾s 𝑋)

Assertion

Ref	Expression
resghm	⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) → (𝐹 ↾ 𝑋) ∈ (𝑈 GrpHom 𝑇))

Proof of Theorem resghm

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2229	. 2 ⊢ (Base‘𝑈) = (Base‘𝑈)
2		eqid 2229	. 2 ⊢ (Base‘𝑇) = (Base‘𝑇)
3		eqid 2229	. 2 ⊢ (+g‘𝑈) = (+g‘𝑈)
4		eqid 2229	. 2 ⊢ (+g‘𝑇) = (+g‘𝑇)
5		resghm.u	. . . 4 ⊢ 𝑈 = (𝑆 ↾s 𝑋)
6	5	subggrp 13709	. . 3 ⊢ (𝑋 ∈ (SubGrp‘𝑆) → 𝑈 ∈ Grp)
7	6	adantl 277	. 2 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) → 𝑈 ∈ Grp)
8		ghmgrp2 13778	. . 3 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑇 ∈ Grp)
9	8	adantr 276	. 2 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) → 𝑇 ∈ Grp)
10		eqid 2229	. . . . 5 ⊢ (Base‘𝑆) = (Base‘𝑆)
11	10, 2	ghmf 13779	. . . 4 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
12	10	subgss 13706	. . . 4 ⊢ (𝑋 ∈ (SubGrp‘𝑆) → 𝑋 ⊆ (Base‘𝑆))
13		fssres 5500	. . . 4 ⊢ ((𝐹:(Base‘𝑆)⟶(Base‘𝑇) ∧ 𝑋 ⊆ (Base‘𝑆)) → (𝐹 ↾ 𝑋):𝑋⟶(Base‘𝑇))
14	11, 12, 13	syl2an 289	. . 3 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) → (𝐹 ↾ 𝑋):𝑋⟶(Base‘𝑇))
15	5	a1i 9	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) → 𝑈 = (𝑆 ↾s 𝑋))
16		eqidd 2230	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) → (Base‘𝑆) = (Base‘𝑆))
17		subgrcl 13711	. . . . . 6 ⊢ (𝑋 ∈ (SubGrp‘𝑆) → 𝑆 ∈ Grp)
18	17	adantl 277	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) → 𝑆 ∈ Grp)
19	12	adantl 277	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) → 𝑋 ⊆ (Base‘𝑆))
20	15, 16, 18, 19	ressbas2d 13096	. . . 4 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) → 𝑋 = (Base‘𝑈))
21	20	feq2d 5460	. . 3 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) → ((𝐹 ↾ 𝑋):𝑋⟶(Base‘𝑇) ↔ (𝐹 ↾ 𝑋):(Base‘𝑈)⟶(Base‘𝑇)))
22	14, 21	mpbid 147	. 2 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) → (𝐹 ↾ 𝑋):(Base‘𝑈)⟶(Base‘𝑇))
23		eleq2 2293	. . . . . 6 ⊢ (𝑋 = (Base‘𝑈) → (𝑎 ∈ 𝑋 ↔ 𝑎 ∈ (Base‘𝑈)))
24		eleq2 2293	. . . . . 6 ⊢ (𝑋 = (Base‘𝑈) → (𝑏 ∈ 𝑋 ↔ 𝑏 ∈ (Base‘𝑈)))
25	23, 24	anbi12d 473	. . . . 5 ⊢ (𝑋 = (Base‘𝑈) → ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) ↔ (𝑎 ∈ (Base‘𝑈) ∧ 𝑏 ∈ (Base‘𝑈))))
26	20, 25	syl 14	. . . 4 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) → ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) ↔ (𝑎 ∈ (Base‘𝑈) ∧ 𝑏 ∈ (Base‘𝑈))))
27	26	biimpar 297	. . 3 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) ∧ (𝑎 ∈ (Base‘𝑈) ∧ 𝑏 ∈ (Base‘𝑈))) → (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋))
28		simpll 527	. . . . 5 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → 𝐹 ∈ (𝑆 GrpHom 𝑇))
29	19	sselda 3224	. . . . . 6 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) ∧ 𝑎 ∈ 𝑋) → 𝑎 ∈ (Base‘𝑆))
30	29	adantrr 479	. . . . 5 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → 𝑎 ∈ (Base‘𝑆))
31	19	sselda 3224	. . . . . 6 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) ∧ 𝑏 ∈ 𝑋) → 𝑏 ∈ (Base‘𝑆))
32	31	adantrl 478	. . . . 5 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → 𝑏 ∈ (Base‘𝑆))
33		eqid 2229	. . . . . 6 ⊢ (+g‘𝑆) = (+g‘𝑆)
34	10, 33, 4	ghmlin 13780	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑎 ∈ (Base‘𝑆) ∧ 𝑏 ∈ (Base‘𝑆)) → (𝐹‘(𝑎(+g‘𝑆)𝑏)) = ((𝐹‘𝑎)(+g‘𝑇)(𝐹‘𝑏)))
35	28, 30, 32, 34	syl3anc 1271	. . . 4 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (𝐹‘(𝑎(+g‘𝑆)𝑏)) = ((𝐹‘𝑎)(+g‘𝑇)(𝐹‘𝑏)))
36	5	a1i 9	. . . . . . . . 9 ⊢ (𝑋 ∈ (SubGrp‘𝑆) → 𝑈 = (𝑆 ↾s 𝑋))
37		eqidd 2230	. . . . . . . . 9 ⊢ (𝑋 ∈ (SubGrp‘𝑆) → (+g‘𝑆) = (+g‘𝑆))
38		id 19	. . . . . . . . 9 ⊢ (𝑋 ∈ (SubGrp‘𝑆) → 𝑋 ∈ (SubGrp‘𝑆))
39	36, 37, 38, 17	ressplusgd 13157	. . . . . . . 8 ⊢ (𝑋 ∈ (SubGrp‘𝑆) → (+g‘𝑆) = (+g‘𝑈))
40	39	ad2antlr 489	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (+g‘𝑆) = (+g‘𝑈))
41	40	oveqd 6017	. . . . . 6 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (𝑎(+g‘𝑆)𝑏) = (𝑎(+g‘𝑈)𝑏))
42	41	fveq2d 5630	. . . . 5 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → ((𝐹 ↾ 𝑋)‘(𝑎(+g‘𝑆)𝑏)) = ((𝐹 ↾ 𝑋)‘(𝑎(+g‘𝑈)𝑏)))
43	33	subgcl 13716	. . . . . . . 8 ⊢ ((𝑋 ∈ (SubGrp‘𝑆) ∧ 𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) → (𝑎(+g‘𝑆)𝑏) ∈ 𝑋)
44	43	3expb 1228	. . . . . . 7 ⊢ ((𝑋 ∈ (SubGrp‘𝑆) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (𝑎(+g‘𝑆)𝑏) ∈ 𝑋)
45	44	adantll 476	. . . . . 6 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (𝑎(+g‘𝑆)𝑏) ∈ 𝑋)
46	45	fvresd 5651	. . . . 5 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → ((𝐹 ↾ 𝑋)‘(𝑎(+g‘𝑆)𝑏)) = (𝐹‘(𝑎(+g‘𝑆)𝑏)))
47	42, 46	eqtr3d 2264	. . . 4 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → ((𝐹 ↾ 𝑋)‘(𝑎(+g‘𝑈)𝑏)) = (𝐹‘(𝑎(+g‘𝑆)𝑏)))
48		fvres 5650	. . . . . 6 ⊢ (𝑎 ∈ 𝑋 → ((𝐹 ↾ 𝑋)‘𝑎) = (𝐹‘𝑎))
49		fvres 5650	. . . . . 6 ⊢ (𝑏 ∈ 𝑋 → ((𝐹 ↾ 𝑋)‘𝑏) = (𝐹‘𝑏))
50	48, 49	oveqan12d 6019	. . . . 5 ⊢ ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) → (((𝐹 ↾ 𝑋)‘𝑎)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑏)) = ((𝐹‘𝑎)(+g‘𝑇)(𝐹‘𝑏)))
51	50	adantl 277	. . . 4 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (((𝐹 ↾ 𝑋)‘𝑎)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑏)) = ((𝐹‘𝑎)(+g‘𝑇)(𝐹‘𝑏)))
52	35, 47, 51	3eqtr4d 2272	. . 3 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → ((𝐹 ↾ 𝑋)‘(𝑎(+g‘𝑈)𝑏)) = (((𝐹 ↾ 𝑋)‘𝑎)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑏)))
53	27, 52	syldan 282	. 2 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) ∧ (𝑎 ∈ (Base‘𝑈) ∧ 𝑏 ∈ (Base‘𝑈))) → ((𝐹 ↾ 𝑋)‘(𝑎(+g‘𝑈)𝑏)) = (((𝐹 ↾ 𝑋)‘𝑎)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑏)))
54	1, 2, 3, 4, 7, 9, 22, 53	isghmd 13784	1 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) → (𝐹 ↾ 𝑋) ∈ (𝑈 GrpHom 𝑇))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1395   ∈ wcel 2200   ⊆ wss 3197   ↾ cres 4720  ⟶wf 5313  ‘cfv 5317  (class class class)co 6000  Basecbs 13027   ↾_s cress 13028  +_gcplusg 13105  Grpcgrp 13528  SubGrpcsubg 13699   GrpHom cghm 13772

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4198  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-cnex 8086  ax-resscn 8087  ax-1cn 8088  ax-1re 8089  ax-icn 8090  ax-addcl 8091  ax-addrcl 8092  ax-mulcl 8093  ax-addcom 8095  ax-addass 8097  ax-i2m1 8100  ax-0lt1 8101  ax-0id 8103  ax-rnegex 8104  ax-pre-ltirr 8107  ax-pre-ltadd 8111

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-ov 6003  df-oprab 6004  df-mpo 6005  df-pnf 8179  df-mnf 8180  df-ltxr 8182  df-inn 9107  df-2 9165  df-ndx 13030  df-slot 13031  df-base 13033  df-sets 13034  df-iress 13035  df-plusg 13118  df-mgm 13384  df-sgrp 13430  df-mnd 13445  df-grp 13531  df-subg 13702  df-ghm 13773

This theorem is referenced by:  ghmima  13797  resrhm  14206