Theorem ghmpreima 13717

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 5064	. . 3 ⊢ (◡𝐹 “ 𝑉) ⊆ dom 𝐹
2		eqid 2207	. . . . 5 ⊢ (Base‘𝑆) = (Base‘𝑆)
3		eqid 2207	. . . . 5 ⊢ (Base‘𝑇) = (Base‘𝑇)
4	2, 3	ghmf 13698	. . . 4 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
5	4	adantr 276	. . 3 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
6	1, 5	fssdm 5460	. 2 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (◡𝐹 “ 𝑉) ⊆ (Base‘𝑆))
7		ghmgrp1 13696	. . . . . 6 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp)
8	7	adantr 276	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → 𝑆 ∈ Grp)
9		eqid 2207	. . . . . 6 ⊢ (0g‘𝑆) = (0g‘𝑆)
10	2, 9	grpidcl 13476	. . . . 5 ⊢ (𝑆 ∈ Grp → (0g‘𝑆) ∈ (Base‘𝑆))
11	8, 10	syl 14	. . . 4 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (0g‘𝑆) ∈ (Base‘𝑆))
12		eqid 2207	. . . . . . 7 ⊢ (0g‘𝑇) = (0g‘𝑇)
13	9, 12	ghmid 13700	. . . . . 6 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(0g‘𝑆)) = (0g‘𝑇))
14	13	adantr 276	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (𝐹‘(0g‘𝑆)) = (0g‘𝑇))
15	12	subg0cl 13633	. . . . . 6 ⊢ (𝑉 ∈ (SubGrp‘𝑇) → (0g‘𝑇) ∈ 𝑉)
16	15	adantl 277	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (0g‘𝑇) ∈ 𝑉)
17	14, 16	eqeltrd 2284	. . . 4 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (𝐹‘(0g‘𝑆)) ∈ 𝑉)
18	5	ffnd 5446	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → 𝐹 Fn (Base‘𝑆))
19		elpreima 5722	. . . . 5 ⊢ (𝐹 Fn (Base‘𝑆) → ((0g‘𝑆) ∈ (◡𝐹 “ 𝑉) ↔ ((0g‘𝑆) ∈ (Base‘𝑆) ∧ (𝐹‘(0g‘𝑆)) ∈ 𝑉)))
20	18, 19	syl 14	. . . 4 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → ((0g‘𝑆) ∈ (◡𝐹 “ 𝑉) ↔ ((0g‘𝑆) ∈ (Base‘𝑆) ∧ (𝐹‘(0g‘𝑆)) ∈ 𝑉)))
21	11, 17, 20	mpbir2and 947	. . 3 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (0g‘𝑆) ∈ (◡𝐹 “ 𝑉))
22		elex2 2793	. . 3 ⊢ ((0g‘𝑆) ∈ (◡𝐹 “ 𝑉) → ∃𝑗 𝑗 ∈ (◡𝐹 “ 𝑉))
23	21, 22	syl 14	. 2 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → ∃𝑗 𝑗 ∈ (◡𝐹 “ 𝑉))
24		elpreima 5722	. . . . 5 ⊢ (𝐹 Fn (Base‘𝑆) → (𝑎 ∈ (◡𝐹 “ 𝑉) ↔ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉)))
25	18, 24	syl 14	. . . 4 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (𝑎 ∈ (◡𝐹 “ 𝑉) ↔ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉)))
26		elpreima 5722	. . . . . . . . . 10 ⊢ (𝐹 Fn (Base‘𝑆) → (𝑏 ∈ (◡𝐹 “ 𝑉) ↔ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉)))
27	18, 26	syl 14	. . . . . . . . 9 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (𝑏 ∈ (◡𝐹 “ 𝑉) ↔ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉)))
28	27	adantr 276	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉)) → (𝑏 ∈ (◡𝐹 “ 𝑉) ↔ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉)))
29		eqid 2207	. . . . . . . . . . 11 ⊢ (+g‘𝑆) = (+g‘𝑆)
30	7	ad2antrr 488	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → 𝑆 ∈ Grp)
31		simprll 537	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → 𝑎 ∈ (Base‘𝑆))
32		simprrl 539	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → 𝑏 ∈ (Base‘𝑆))
33	2, 29, 30, 31, 32	grpcld 13461	. . . . . . . . . 10 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → (𝑎(+g‘𝑆)𝑏) ∈ (Base‘𝑆))
34		simpll 527	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → 𝐹 ∈ (𝑆 GrpHom 𝑇))
35		eqid 2207	. . . . . . . . . . . . 13 ⊢ (+g‘𝑇) = (+g‘𝑇)
36	2, 29, 35	ghmlin 13699	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑎 ∈ (Base‘𝑆) ∧ 𝑏 ∈ (Base‘𝑆)) → (𝐹‘(𝑎(+g‘𝑆)𝑏)) = ((𝐹‘𝑎)(+g‘𝑇)(𝐹‘𝑏)))
37	34, 31, 32, 36	syl3anc 1250	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → (𝐹‘(𝑎(+g‘𝑆)𝑏)) = ((𝐹‘𝑎)(+g‘𝑇)(𝐹‘𝑏)))
38		simplr 528	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → 𝑉 ∈ (SubGrp‘𝑇))
39		simprlr 538	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → (𝐹‘𝑎) ∈ 𝑉)
40		simprrr 540	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → (𝐹‘𝑏) ∈ 𝑉)
41	35	subgcl 13635	. . . . . . . . . . . 12 ⊢ ((𝑉 ∈ (SubGrp‘𝑇) ∧ (𝐹‘𝑎) ∈ 𝑉 ∧ (𝐹‘𝑏) ∈ 𝑉) → ((𝐹‘𝑎)(+g‘𝑇)(𝐹‘𝑏)) ∈ 𝑉)
42	38, 39, 40, 41	syl3anc 1250	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → ((𝐹‘𝑎)(+g‘𝑇)(𝐹‘𝑏)) ∈ 𝑉)
43	37, 42	eqeltrd 2284	. . . . . . . . . 10 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ 𝑉))) → (𝐹‘(𝑎(+g‘𝑆)𝑏)) ∈ 𝑉)
44		elpreima 5722	. . . . . . . . . . . 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 947	. . . . . . . . 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 2580	. . . . . 6 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉)) → ∀𝑏 ∈ (◡𝐹 “ 𝑉)(𝑎(+g‘𝑆)𝑏) ∈ (◡𝐹 “ 𝑉))
51		simprl 529	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉)) → 𝑎 ∈ (Base‘𝑆))
52		eqid 2207	. . . . . . . . 9 ⊢ (invg‘𝑆) = (invg‘𝑆)
53	2, 52	grpinvcl 13495	. . . . . . . 8 ⊢ ((𝑆 ∈ Grp ∧ 𝑎 ∈ (Base‘𝑆)) → ((invg‘𝑆)‘𝑎) ∈ (Base‘𝑆))
54	8, 51, 53	syl2an2r 595	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉)) → ((invg‘𝑆)‘𝑎) ∈ (Base‘𝑆))
55		eqid 2207	. . . . . . . . . 10 ⊢ (invg‘𝑇) = (invg‘𝑇)
56	2, 52, 55	ghminv 13701	. . . . . . . . 9 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑎 ∈ (Base‘𝑆)) → (𝐹‘((invg‘𝑆)‘𝑎)) = ((invg‘𝑇)‘(𝐹‘𝑎)))
57	56	ad2ant2r 509	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉)) → (𝐹‘((invg‘𝑆)‘𝑎)) = ((invg‘𝑇)‘(𝐹‘𝑎)))
58	55	subginvcl 13634	. . . . . . . . 9 ⊢ ((𝑉 ∈ (SubGrp‘𝑇) ∧ (𝐹‘𝑎) ∈ 𝑉) → ((invg‘𝑇)‘(𝐹‘𝑎)) ∈ 𝑉)
59	58	ad2ant2l 508	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉)) → ((invg‘𝑇)‘(𝐹‘𝑎)) ∈ 𝑉)
60	57, 59	eqeltrd 2284	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹‘𝑎) ∈ 𝑉)) → (𝐹‘((invg‘𝑆)‘𝑎)) ∈ 𝑉)
61		elpreima 5722	. . . . . . . . 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 947	. . . . . 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 2580	. 2 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → ∀𝑎 ∈ (◡𝐹 “ 𝑉)(∀𝑏 ∈ (◡𝐹 “ 𝑉)(𝑎(+g‘𝑆)𝑏) ∈ (◡𝐹 “ 𝑉) ∧ ((invg‘𝑆)‘𝑎) ∈ (◡𝐹 “ 𝑉)))
69	2, 29, 52	issubg2m 13640	. . 3 ⊢ (𝑆 ∈ Grp → ((◡𝐹 “ 𝑉) ∈ (SubGrp‘𝑆) ↔ ((◡𝐹 “ 𝑉) ⊆ (Base‘𝑆) ∧ ∃𝑗 𝑗 ∈ (◡𝐹 “ 𝑉) ∧ ∀𝑎 ∈ (◡𝐹 “ 𝑉)(∀𝑏 ∈ (◡𝐹 “ 𝑉)(𝑎(+g‘𝑆)𝑏) ∈ (◡𝐹 “ 𝑉) ∧ ((invg‘𝑆)‘𝑎) ∈ (◡𝐹 “ 𝑉)))))
70	8, 69	syl 14	. 2 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → ((◡𝐹 “ 𝑉) ∈ (SubGrp‘𝑆) ↔ ((◡𝐹 “ 𝑉) ⊆ (Base‘𝑆) ∧ ∃𝑗 𝑗 ∈ (◡𝐹 “ 𝑉) ∧ ∀𝑎 ∈ (◡𝐹 “ 𝑉)(∀𝑏 ∈ (◡𝐹 “ 𝑉)(𝑎(+g‘𝑆)𝑏) ∈ (◡𝐹 “ 𝑉) ∧ ((invg‘𝑆)‘𝑎) ∈ (◡𝐹 “ 𝑉)))))
71	6, 23, 68, 70	mpbir3and 1183	1 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (◡𝐹 “ 𝑉) ∈ (SubGrp‘𝑆))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 981   = wceq 1373  ∃wex 1516   ∈ wcel 2178  ∀wral 2486   ⊆ wss 3174  ^◡ccnv 4692   “ cima 4696   Fn wfn 5285  ⟶wf 5286  ‘cfv 5290  (class class class)co 5967  Basecbs 12947  +_gcplusg 13024  0_gc0g 13203  Grpcgrp 13447  inv_gcminusg 13448  SubGrpcsubg 13618   GrpHom cghm 13691

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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-coll 4175  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-cnex 8051  ax-resscn 8052  ax-1cn 8053  ax-1re 8054  ax-icn 8055  ax-addcl 8056  ax-addrcl 8057  ax-mulcl 8058  ax-addcom 8060  ax-addass 8062  ax-i2m1 8065  ax-0lt1 8066  ax-0id 8068  ax-rnegex 8069  ax-pre-ltirr 8072  ax-pre-ltadd 8076

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-nel 2474  df-ral 2491  df-rex 2492  df-reu 2493  df-rmo 2494  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-nul 3469  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-int 3900  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-riota 5922  df-ov 5970  df-oprab 5971  df-mpo 5972  df-pnf 8144  df-mnf 8145  df-ltxr 8147  df-inn 9072  df-2 9130  df-ndx 12950  df-slot 12951  df-base 12953  df-sets 12954  df-iress 12955  df-plusg 13037  df-0g 13205  df-mgm 13303  df-sgrp 13349  df-mnd 13364  df-grp 13450  df-minusg 13451  df-subg 13621  df-ghm 13692

This theorem is referenced by:  ghmnsgpreima  13720