Theorem ghmpreima 13916

Description: The inverse image of a subgroup under a homomorphism. (Contributed by Stefan O'Rear, 31-Dec-2014.)

Assertion

Ref	Expression
ghmpreima	⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (◡𝐹 “ 𝑉) ∈ (SubGrp‘𝑆))

Proof of Theorem ghmpreima

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

Step	Hyp	Ref	Expression
1		cnvimass 5106	. . 3 ⊢ (◡𝐹 “ 𝑉) ⊆ dom 𝐹
2		eqid 2231	. . . . 5 ⊢ (Base‘𝑆) = (Base‘𝑆)
3		eqid 2231	. . . . 5 ⊢ (Base‘𝑇) = (Base‘𝑇)
4	2, 3	ghmf 13897	. . . 4 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
5	4	adantr 276	. . 3 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
6	1, 5	fssdm 5504	. 2 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (◡𝐹 “ 𝑉) ⊆ (Base‘𝑆))
7		ghmgrp1 13895	. . . . . 6 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp)
8	7	adantr 276	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → 𝑆 ∈ Grp)
9		eqid 2231	. . . . . 6 ⊢ (0g‘𝑆) = (0g‘𝑆)
10	2, 9	grpidcl 13675	. . . . 5 ⊢ (𝑆 ∈ Grp → (0g‘𝑆) ∈ (Base‘𝑆))
11	8, 10	syl 14	. . . 4 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (0g‘𝑆) ∈ (Base‘𝑆))
12		eqid 2231	. . . . . . 7 ⊢ (0g‘𝑇) = (0g‘𝑇)
13	9, 12	ghmid 13899	. . . . . 6 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(0g‘𝑆)) = (0g‘𝑇))
14	13	adantr 276	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (𝐹‘(0g‘𝑆)) = (0g‘𝑇))
15	12	subg0cl 13832	. . . . . 6 ⊢ (𝑉 ∈ (SubGrp‘𝑇) → (0g‘𝑇) ∈ 𝑉)
16	15	adantl 277	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (0g‘𝑇) ∈ 𝑉)
17	14, 16	eqeltrd 2308	. . . 4 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (𝐹‘(0g‘𝑆)) ∈ 𝑉)
18	5	ffnd 5490	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → 𝐹 Fn (Base‘𝑆))
19		elpreima 5775	. . . . 5 ⊢ (𝐹 Fn (Base‘𝑆) → ((0g‘𝑆) ∈ (◡𝐹 “ 𝑉) ↔ ((0g‘𝑆) ∈ (Base‘𝑆) ∧ (𝐹‘(0g‘𝑆)) ∈ 𝑉)))
20	18, 19	syl 14	. . . 4 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → ((0g‘𝑆) ∈ (◡𝐹 “ 𝑉) ↔ ((0g‘𝑆) ∈ (Base‘𝑆) ∧ (𝐹‘(0g‘𝑆)) ∈ 𝑉)))
21	11, 17, 20	mpbir2and 953	. . 3 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (0g‘𝑆) ∈ (◡𝐹 “ 𝑉))
22		elex2 2820	. . 3 ⊢ ((0g‘𝑆) ∈ (◡𝐹 “ 𝑉) → ∃𝑗 𝑗 ∈ (◡𝐹 “ 𝑉))
23	21, 22	syl 14	. 2 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → ∃𝑗 𝑗 ∈ (◡𝐹 “ 𝑉))
24		elpreima 5775	. . . . 5 ⊢ (𝐹 Fn (Base‘𝑆) → (𝑎 ∈ (◡𝐹 “ 𝑉) ↔ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉)))
25	18, 24	syl 14	. . . 4 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (𝑎 ∈ (◡𝐹 “ 𝑉) ↔ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉)))
26		elpreima 5775	. . . . . . . . . 10 ⊢ (𝐹 Fn (Base‘𝑆) → (𝑏 ∈ (◡𝐹 “ 𝑉) ↔ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉)))
27	18, 26	syl 14	. . . . . . . . 9 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (𝑏 ∈ (◡𝐹 “ 𝑉) ↔ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉)))
28	27	adantr 276	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉)) → (𝑏 ∈ (◡𝐹 “ 𝑉) ↔ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉)))
29		eqid 2231	. . . . . . . . . . 11 ⊢ (+g‘𝑆) = (+g‘𝑆)
30	7	ad2antrr 488	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → 𝑆 ∈ Grp)
31		simprll 539	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → 𝑎 ∈ (Base‘𝑆))
32		simprrl 541	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → 𝑏 ∈ (Base‘𝑆))
33	2, 29, 30, 31, 32	grpcld 13660	. . . . . . . . . 10 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → (𝑎(+g‘𝑆)𝑏) ∈ (Base‘𝑆))
34		simpll 527	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → 𝐹 ∈ (𝑆 GrpHom 𝑇))
35		eqid 2231	. . . . . . . . . . . . 13 ⊢ (+g‘𝑇) = (+g‘𝑇)
36	2, 29, 35	ghmlin 13898	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑎 ∈ (Base‘𝑆) ∧ 𝑏 ∈ (Base‘𝑆)) → (𝐹‘(𝑎(+g‘𝑆)𝑏)) = ((𝐹‘𝑎)(+g‘𝑇)(𝐹‘𝑏)))
37	34, 31, 32, 36	syl3anc 1274	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → (𝐹‘(𝑎(+g‘𝑆)𝑏)) = ((𝐹‘𝑎)(+g‘𝑇)(𝐹‘𝑏)))
38		simplr 529	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → 𝑉 ∈ (SubGrp‘𝑇))
39		simprlr 540	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → (𝐹‘𝑎) ∈ 𝑉)
40		simprrr 542	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → (𝐹‘𝑏) ∈ 𝑉)
41	35	subgcl 13834	. . . . . . . . . . . 12 ⊢ ((𝑉 ∈ (SubGrp‘𝑇) ∧ (𝐹‘𝑎) ∈ 𝑉 ∧ (𝐹‘𝑏) ∈ 𝑉) → ((𝐹‘𝑎)(+g‘𝑇)(𝐹‘𝑏)) ∈ 𝑉)
42	38, 39, 40, 41	syl3anc 1274	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → ((𝐹‘𝑎)(+g‘𝑇)(𝐹‘𝑏)) ∈ 𝑉)
43	37, 42	eqeltrd 2308	. . . . . . . . . 10 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → (𝐹‘(𝑎(+g‘𝑆)𝑏)) ∈ 𝑉)
44		elpreima 5775	. . . . . . . . . . . 12 ⊢ (𝐹 Fn (Base‘𝑆) → ((𝑎(+g‘𝑆)𝑏) ∈ (◡𝐹 “ 𝑉) ↔ ((𝑎(+g‘𝑆)𝑏) ∈ (Base‘𝑆) ∧ (𝐹‘(𝑎(+g‘𝑆)𝑏)) ∈ 𝑉)))
45	18, 44	syl 14	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → ((𝑎(+g‘𝑆)𝑏) ∈ (◡𝐹 “ 𝑉) ↔ ((𝑎(+g‘𝑆)𝑏) ∈ (Base‘𝑆) ∧ (𝐹‘(𝑎(+g‘𝑆)𝑏)) ∈ 𝑉)))
46	45	adantr 276	. . . . . . . . . 10 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → ((𝑎(+g‘𝑆)𝑏) ∈ (◡𝐹 “ 𝑉) ↔ ((𝑎(+g‘𝑆)𝑏) ∈ (Base‘𝑆) ∧ (𝐹‘(𝑎(+g‘𝑆)𝑏)) ∈ 𝑉)))
47	33, 43, 46	mpbir2and 953	. . . . . . . . 9 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → (𝑎(+g‘𝑆)𝑏) ∈ (◡𝐹 “ 𝑉))
48	47	expr 375	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉)) → ((𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉) → (𝑎(+g‘𝑆)𝑏) ∈ (◡𝐹 “ 𝑉)))
49	28, 48	sylbid 150	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉)) → (𝑏 ∈ (◡𝐹 “ 𝑉) → (𝑎(+g‘𝑆)𝑏) ∈ (◡𝐹 “ 𝑉)))
50	49	ralrimiv 2605	. . . . . 6 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉)) → ∀𝑏 ∈ (◡𝐹 “ 𝑉)(𝑎(+g‘𝑆)𝑏) ∈ (◡𝐹 “ 𝑉))
51		simprl 531	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉)) → 𝑎 ∈ (Base‘𝑆))
52		eqid 2231	. . . . . . . . 9 ⊢ (invg‘𝑆) = (invg‘𝑆)
53	2, 52	grpinvcl 13694	. . . . . . . 8 ⊢ ((𝑆 ∈ Grp ∧ 𝑎 ∈ (Base‘𝑆)) → ((invg‘𝑆)‘𝑎) ∈ (Base‘𝑆))
54	8, 51, 53	syl2an2r 599	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉)) → ((invg‘𝑆)‘𝑎) ∈ (Base‘𝑆))
55		eqid 2231	. . . . . . . . . 10 ⊢ (invg‘𝑇) = (invg‘𝑇)
56	2, 52, 55	ghminv 13900	. . . . . . . . 9 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑎 ∈ (Base‘𝑆)) → (𝐹‘((invg‘𝑆)‘𝑎)) = ((invg‘𝑇)‘(𝐹‘𝑎)))
57	56	ad2ant2r 509	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉)) → (𝐹‘((invg‘𝑆)‘𝑎)) = ((invg‘𝑇)‘(𝐹‘𝑎)))
58	55	subginvcl 13833	. . . . . . . . 9 ⊢ ((𝑉 ∈ (SubGrp‘𝑇) ∧ (𝐹‘𝑎) ∈ 𝑉) → ((invg‘𝑇)‘(𝐹‘𝑎)) ∈ 𝑉)
59	58	ad2ant2l 508	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉)) → ((invg‘𝑇)‘(𝐹‘𝑎)) ∈ 𝑉)
60	57, 59	eqeltrd 2308	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉)) → (𝐹‘((invg‘𝑆)‘𝑎)) ∈ 𝑉)
61		elpreima 5775	. . . . . . . . 9 ⊢ (𝐹 Fn (Base‘𝑆) → (((invg‘𝑆)‘𝑎) ∈ (◡𝐹 “ 𝑉) ↔ (((invg‘𝑆)‘𝑎) ∈ (Base‘𝑆) ∧ (𝐹‘((invg‘𝑆)‘𝑎)) ∈ 𝑉)))
62	18, 61	syl 14	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (((invg‘𝑆)‘𝑎) ∈ (◡𝐹 “ 𝑉) ↔ (((invg‘𝑆)‘𝑎) ∈ (Base‘𝑆) ∧ (𝐹‘((invg‘𝑆)‘𝑎)) ∈ 𝑉)))
63	62	adantr 276	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉)) → (((invg‘𝑆)‘𝑎) ∈ (◡𝐹 “ 𝑉) ↔ (((invg‘𝑆)‘𝑎) ∈ (Base‘𝑆) ∧ (𝐹‘((invg‘𝑆)‘𝑎)) ∈ 𝑉)))
64	54, 60, 63	mpbir2and 953	. . . . . 6 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉)) → ((invg‘𝑆)‘𝑎) ∈ (◡𝐹 “ 𝑉))
65	50, 64	jca 306	. . . . 5 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉)) → (∀𝑏 ∈ (◡𝐹 “ 𝑉)(𝑎(+g‘𝑆)𝑏) ∈ (◡𝐹 “ 𝑉) ∧ ((invg‘𝑆)‘𝑎) ∈ (◡𝐹 “ 𝑉)))
66	65	ex 115	. . . 4 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) → (∀𝑏 ∈ (◡𝐹 “ 𝑉)(𝑎(+g‘𝑆)𝑏) ∈ (◡𝐹 “ 𝑉) ∧ ((invg‘𝑆)‘𝑎) ∈ (◡𝐹 “ 𝑉))))
67	25, 66	sylbid 150	. . 3 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (𝑎 ∈ (◡𝐹 “ 𝑉) → (∀𝑏 ∈ (◡𝐹 “ 𝑉)(𝑎(+g‘𝑆)𝑏) ∈ (◡𝐹 “ 𝑉) ∧ ((invg‘𝑆)‘𝑎) ∈ (◡𝐹 “ 𝑉))))
68	67	ralrimiv 2605	. 2 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → ∀𝑎 ∈ (◡𝐹 “ 𝑉)(∀𝑏 ∈ (◡𝐹 “ 𝑉)(𝑎(+g‘𝑆)𝑏) ∈ (◡𝐹 “ 𝑉) ∧ ((invg‘𝑆)‘𝑎) ∈ (◡𝐹 “ 𝑉)))
69	2, 29, 52	issubg2m 13839	. . 3 ⊢ (𝑆 ∈ Grp → ((◡𝐹 “ 𝑉) ∈ (SubGrp‘𝑆) ↔ ((◡𝐹 “ 𝑉) ⊆ (Base‘𝑆) ∧ ∃𝑗 𝑗 ∈ (◡𝐹 “ 𝑉) ∧ ∀𝑎 ∈ (◡𝐹 “ 𝑉)(∀𝑏 ∈ (◡𝐹 “ 𝑉)(𝑎(+g‘𝑆)𝑏) ∈ (◡𝐹 “ 𝑉) ∧ ((invg‘𝑆)‘𝑎) ∈ (◡𝐹 “ 𝑉)))))
70	8, 69	syl 14	. 2 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → ((◡𝐹 “ 𝑉) ∈ (SubGrp‘𝑆) ↔ ((◡𝐹 “ 𝑉) ⊆ (Base‘𝑆) ∧ ∃𝑗 𝑗 ∈ (◡𝐹 “ 𝑉) ∧ ∀𝑎 ∈ (◡𝐹 “ 𝑉)(∀𝑏 ∈ (◡𝐹 “ 𝑉)(𝑎(+g‘𝑆)𝑏) ∈ (◡𝐹 “ 𝑉) ∧ ((invg‘𝑆)‘𝑎) ∈ (◡𝐹 “ 𝑉)))))
71	6, 23, 68, 70	mpbir3and 1207	1 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (◡𝐹 “ 𝑉) ∈ (SubGrp‘𝑆))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1005   = wceq 1398  ∃wex 1541   ∈ wcel 2202  ∀wral 2511   ⊆ wss 3201  ^◡ccnv 4730   “ cima 4734   Fn wfn 5328  ⟶wf 5329  ‘cfv 5333  (class class class)co 6028  Basecbs 13145  +_gcplusg 13223  0_gc0g 13402  Grpcgrp 13646  inv_gcminusg 13647  SubGrpcsubg 13817   GrpHom cghm 13890

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 8258  df-mnf 8259  df-ltxr 8261  df-inn 9186  df-2 9244  df-ndx 13148  df-slot 13149  df-base 13151  df-sets 13152  df-iress 13153  df-plusg 13236  df-0g 13404  df-mgm 13502  df-sgrp 13548  df-mnd 13563  df-grp 13649  df-minusg 13650  df-subg 13820  df-ghm 13891

This theorem is referenced by:  ghmnsgpreima  13919