Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  ghmpreima Structured version   Visualization version   GIF version

Theorem ghmpreima 18371
 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.
StepHypRef Expression
1 cnvimass 5927 . . 3 (𝐹𝑉) ⊆ dom 𝐹
2 eqid 2822 . . . . 5 (Base‘𝑆) = (Base‘𝑆)
3 eqid 2822 . . . . 5 (Base‘𝑇) = (Base‘𝑇)
42, 3ghmf 18353 . . . 4 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
54adantr 484 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
61, 5fssdm 6511 . 2 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (𝐹𝑉) ⊆ (Base‘𝑆))
7 ghmgrp1 18351 . . . . . 6 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp)
87adantr 484 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → 𝑆 ∈ Grp)
9 eqid 2822 . . . . . 6 (0g𝑆) = (0g𝑆)
102, 9grpidcl 18122 . . . . 5 (𝑆 ∈ Grp → (0g𝑆) ∈ (Base‘𝑆))
118, 10syl 17 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (0g𝑆) ∈ (Base‘𝑆))
12 eqid 2822 . . . . . . 7 (0g𝑇) = (0g𝑇)
139, 12ghmid 18355 . . . . . 6 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(0g𝑆)) = (0g𝑇))
1413adantr 484 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (𝐹‘(0g𝑆)) = (0g𝑇))
1512subg0cl 18278 . . . . . 6 (𝑉 ∈ (SubGrp‘𝑇) → (0g𝑇) ∈ 𝑉)
1615adantl 485 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (0g𝑇) ∈ 𝑉)
1714, 16eqeltrd 2914 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (𝐹‘(0g𝑆)) ∈ 𝑉)
185ffnd 6495 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → 𝐹 Fn (Base‘𝑆))
19 elpreima 6810 . . . . 5 (𝐹 Fn (Base‘𝑆) → ((0g𝑆) ∈ (𝐹𝑉) ↔ ((0g𝑆) ∈ (Base‘𝑆) ∧ (𝐹‘(0g𝑆)) ∈ 𝑉)))
2018, 19syl 17 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → ((0g𝑆) ∈ (𝐹𝑉) ↔ ((0g𝑆) ∈ (Base‘𝑆) ∧ (𝐹‘(0g𝑆)) ∈ 𝑉)))
2111, 17, 20mpbir2and 712 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (0g𝑆) ∈ (𝐹𝑉))
2221ne0d 4273 . 2 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (𝐹𝑉) ≠ ∅)
23 elpreima 6810 . . . . 5 (𝐹 Fn (Base‘𝑆) → (𝑎 ∈ (𝐹𝑉) ↔ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉)))
2418, 23syl 17 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (𝑎 ∈ (𝐹𝑉) ↔ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉)))
25 elpreima 6810 . . . . . . . . . 10 (𝐹 Fn (Base‘𝑆) → (𝑏 ∈ (𝐹𝑉) ↔ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹𝑏) ∈ 𝑉)))
2618, 25syl 17 . . . . . . . . 9 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (𝑏 ∈ (𝐹𝑉) ↔ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹𝑏) ∈ 𝑉)))
2726adantr 484 . . . . . . . 8 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉)) → (𝑏 ∈ (𝐹𝑉) ↔ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹𝑏) ∈ 𝑉)))
287ad2antrr 725 . . . . . . . . . . 11 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹𝑏) ∈ 𝑉))) → 𝑆 ∈ Grp)
29 simprll 778 . . . . . . . . . . 11 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹𝑏) ∈ 𝑉))) → 𝑎 ∈ (Base‘𝑆))
30 simprrl 780 . . . . . . . . . . 11 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹𝑏) ∈ 𝑉))) → 𝑏 ∈ (Base‘𝑆))
31 eqid 2822 . . . . . . . . . . . 12 (+g𝑆) = (+g𝑆)
322, 31grpcl 18102 . . . . . . . . . . 11 ((𝑆 ∈ Grp ∧ 𝑎 ∈ (Base‘𝑆) ∧ 𝑏 ∈ (Base‘𝑆)) → (𝑎(+g𝑆)𝑏) ∈ (Base‘𝑆))
3328, 29, 30, 32syl3anc 1368 . . . . . . . . . 10 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹𝑏) ∈ 𝑉))) → (𝑎(+g𝑆)𝑏) ∈ (Base‘𝑆))
34 simpll 766 . . . . . . . . . . . 12 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹𝑏) ∈ 𝑉))) → 𝐹 ∈ (𝑆 GrpHom 𝑇))
35 eqid 2822 . . . . . . . . . . . . 13 (+g𝑇) = (+g𝑇)
362, 31, 35ghmlin 18354 . . . . . . . . . . . 12 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑎 ∈ (Base‘𝑆) ∧ 𝑏 ∈ (Base‘𝑆)) → (𝐹‘(𝑎(+g𝑆)𝑏)) = ((𝐹𝑎)(+g𝑇)(𝐹𝑏)))
3734, 29, 30, 36syl3anc 1368 . . . . . . . . . . 11 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹𝑏) ∈ 𝑉))) → (𝐹‘(𝑎(+g𝑆)𝑏)) = ((𝐹𝑎)(+g𝑇)(𝐹𝑏)))
38 simplr 768 . . . . . . . . . . . 12 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹𝑏) ∈ 𝑉))) → 𝑉 ∈ (SubGrp‘𝑇))
39 simprlr 779 . . . . . . . . . . . 12 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹𝑏) ∈ 𝑉))) → (𝐹𝑎) ∈ 𝑉)
40 simprrr 781 . . . . . . . . . . . 12 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹𝑏) ∈ 𝑉))) → (𝐹𝑏) ∈ 𝑉)
4135subgcl 18280 . . . . . . . . . . . 12 ((𝑉 ∈ (SubGrp‘𝑇) ∧ (𝐹𝑎) ∈ 𝑉 ∧ (𝐹𝑏) ∈ 𝑉) → ((𝐹𝑎)(+g𝑇)(𝐹𝑏)) ∈ 𝑉)
4238, 39, 40, 41syl3anc 1368 . . . . . . . . . . 11 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹𝑏) ∈ 𝑉))) → ((𝐹𝑎)(+g𝑇)(𝐹𝑏)) ∈ 𝑉)
4337, 42eqeltrd 2914 . . . . . . . . . 10 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹𝑏) ∈ 𝑉))) → (𝐹‘(𝑎(+g𝑆)𝑏)) ∈ 𝑉)
44 elpreima 6810 . . . . . . . . . . . 12 (𝐹 Fn (Base‘𝑆) → ((𝑎(+g𝑆)𝑏) ∈ (𝐹𝑉) ↔ ((𝑎(+g𝑆)𝑏) ∈ (Base‘𝑆) ∧ (𝐹‘(𝑎(+g𝑆)𝑏)) ∈ 𝑉)))
4518, 44syl 17 . . . . . . . . . . 11 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → ((𝑎(+g𝑆)𝑏) ∈ (𝐹𝑉) ↔ ((𝑎(+g𝑆)𝑏) ∈ (Base‘𝑆) ∧ (𝐹‘(𝑎(+g𝑆)𝑏)) ∈ 𝑉)))
4645adantr 484 . . . . . . . . . 10 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹𝑏) ∈ 𝑉))) → ((𝑎(+g𝑆)𝑏) ∈ (𝐹𝑉) ↔ ((𝑎(+g𝑆)𝑏) ∈ (Base‘𝑆) ∧ (𝐹‘(𝑎(+g𝑆)𝑏)) ∈ 𝑉)))
4733, 43, 46mpbir2and 712 . . . . . . . . 9 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉) ∧ (𝑏 ∈ (Base‘𝑆) ∧ (𝐹𝑏) ∈ 𝑉))) → (𝑎(+g𝑆)𝑏) ∈ (𝐹𝑉))
4847expr 460 . . . . . . . 8 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉)) → ((𝑏 ∈ (Base‘𝑆) ∧ (𝐹𝑏) ∈ 𝑉) → (𝑎(+g𝑆)𝑏) ∈ (𝐹𝑉)))
4927, 48sylbid 243 . . . . . . 7 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉)) → (𝑏 ∈ (𝐹𝑉) → (𝑎(+g𝑆)𝑏) ∈ (𝐹𝑉)))
5049ralrimiv 3173 . . . . . 6 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉)) → ∀𝑏 ∈ (𝐹𝑉)(𝑎(+g𝑆)𝑏) ∈ (𝐹𝑉))
51 simprl 770 . . . . . . . 8 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉)) → 𝑎 ∈ (Base‘𝑆))
52 eqid 2822 . . . . . . . . 9 (invg𝑆) = (invg𝑆)
532, 52grpinvcl 18142 . . . . . . . 8 ((𝑆 ∈ Grp ∧ 𝑎 ∈ (Base‘𝑆)) → ((invg𝑆)‘𝑎) ∈ (Base‘𝑆))
548, 51, 53syl2an2r 684 . . . . . . 7 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉)) → ((invg𝑆)‘𝑎) ∈ (Base‘𝑆))
55 eqid 2822 . . . . . . . . . 10 (invg𝑇) = (invg𝑇)
562, 52, 55ghminv 18356 . . . . . . . . 9 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑎 ∈ (Base‘𝑆)) → (𝐹‘((invg𝑆)‘𝑎)) = ((invg𝑇)‘(𝐹𝑎)))
5756ad2ant2r 746 . . . . . . . 8 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉)) → (𝐹‘((invg𝑆)‘𝑎)) = ((invg𝑇)‘(𝐹𝑎)))
5855subginvcl 18279 . . . . . . . . 9 ((𝑉 ∈ (SubGrp‘𝑇) ∧ (𝐹𝑎) ∈ 𝑉) → ((invg𝑇)‘(𝐹𝑎)) ∈ 𝑉)
5958ad2ant2l 745 . . . . . . . 8 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉)) → ((invg𝑇)‘(𝐹𝑎)) ∈ 𝑉)
6057, 59eqeltrd 2914 . . . . . . 7 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉)) → (𝐹‘((invg𝑆)‘𝑎)) ∈ 𝑉)
61 elpreima 6810 . . . . . . . . 9 (𝐹 Fn (Base‘𝑆) → (((invg𝑆)‘𝑎) ∈ (𝐹𝑉) ↔ (((invg𝑆)‘𝑎) ∈ (Base‘𝑆) ∧ (𝐹‘((invg𝑆)‘𝑎)) ∈ 𝑉)))
6218, 61syl 17 . . . . . . . 8 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (((invg𝑆)‘𝑎) ∈ (𝐹𝑉) ↔ (((invg𝑆)‘𝑎) ∈ (Base‘𝑆) ∧ (𝐹‘((invg𝑆)‘𝑎)) ∈ 𝑉)))
6362adantr 484 . . . . . . 7 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉)) → (((invg𝑆)‘𝑎) ∈ (𝐹𝑉) ↔ (((invg𝑆)‘𝑎) ∈ (Base‘𝑆) ∧ (𝐹‘((invg𝑆)‘𝑎)) ∈ 𝑉)))
6454, 60, 63mpbir2and 712 . . . . . 6 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉)) → ((invg𝑆)‘𝑎) ∈ (𝐹𝑉))
6550, 64jca 515 . . . . 5 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) ∧ (𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉)) → (∀𝑏 ∈ (𝐹𝑉)(𝑎(+g𝑆)𝑏) ∈ (𝐹𝑉) ∧ ((invg𝑆)‘𝑎) ∈ (𝐹𝑉)))
6665ex 416 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → ((𝑎 ∈ (Base‘𝑆) ∧ (𝐹𝑎) ∈ 𝑉) → (∀𝑏 ∈ (𝐹𝑉)(𝑎(+g𝑆)𝑏) ∈ (𝐹𝑉) ∧ ((invg𝑆)‘𝑎) ∈ (𝐹𝑉))))
6724, 66sylbid 243 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (𝑎 ∈ (𝐹𝑉) → (∀𝑏 ∈ (𝐹𝑉)(𝑎(+g𝑆)𝑏) ∈ (𝐹𝑉) ∧ ((invg𝑆)‘𝑎) ∈ (𝐹𝑉))))
6867ralrimiv 3173 . 2 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → ∀𝑎 ∈ (𝐹𝑉)(∀𝑏 ∈ (𝐹𝑉)(𝑎(+g𝑆)𝑏) ∈ (𝐹𝑉) ∧ ((invg𝑆)‘𝑎) ∈ (𝐹𝑉)))
692, 31, 52issubg2 18285 . . 3 (𝑆 ∈ Grp → ((𝐹𝑉) ∈ (SubGrp‘𝑆) ↔ ((𝐹𝑉) ⊆ (Base‘𝑆) ∧ (𝐹𝑉) ≠ ∅ ∧ ∀𝑎 ∈ (𝐹𝑉)(∀𝑏 ∈ (𝐹𝑉)(𝑎(+g𝑆)𝑏) ∈ (𝐹𝑉) ∧ ((invg𝑆)‘𝑎) ∈ (𝐹𝑉)))))
708, 69syl 17 . 2 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → ((𝐹𝑉) ∈ (SubGrp‘𝑆) ↔ ((𝐹𝑉) ⊆ (Base‘𝑆) ∧ (𝐹𝑉) ≠ ∅ ∧ ∀𝑎 ∈ (𝐹𝑉)(∀𝑏 ∈ (𝐹𝑉)(𝑎(+g𝑆)𝑏) ∈ (𝐹𝑉) ∧ ((invg𝑆)‘𝑎) ∈ (𝐹𝑉)))))
716, 22, 68, 70mpbir3and 1339 1 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (𝐹𝑉) ∈ (SubGrp‘𝑆))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2114   ≠ wne 3011  ∀wral 3130   ⊆ wss 3908  ∅c0 4265  ◡ccnv 5531   “ cima 5535   Fn wfn 6329  ⟶wf 6330  ‘cfv 6334  (class class class)co 7140  Basecbs 16474  +gcplusg 16556  0gc0g 16704  Grpcgrp 18094  invgcminusg 18095  SubGrpcsubg 18264   GrpHom cghm 18346 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2178  ax-ext 2794  ax-rep 5166  ax-sep 5179  ax-nul 5186  ax-pow 5243  ax-pr 5307  ax-un 7446  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602  ax-pre-mulgt0 10603 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2801  df-cleq 2815  df-clel 2894  df-nfc 2962  df-ne 3012  df-nel 3116  df-ral 3135  df-rex 3136  df-reu 3137  df-rmo 3138  df-rab 3139  df-v 3471  df-sbc 3748  df-csb 3856  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3927  df-nul 4266  df-if 4440  df-pw 4513  df-sn 4540  df-pr 4542  df-tp 4544  df-op 4546  df-uni 4814  df-iun 4896  df-br 5043  df-opab 5105  df-mpt 5123  df-tr 5149  df-id 5437  df-eprel 5442  df-po 5451  df-so 5452  df-fr 5491  df-we 5493  df-xp 5538  df-rel 5539  df-cnv 5540  df-co 5541  df-dm 5542  df-rn 5543  df-res 5544  df-ima 5545  df-pred 6126  df-ord 6172  df-on 6173  df-lim 6174  df-suc 6175  df-iota 6293  df-fun 6336  df-fn 6337  df-f 6338  df-f1 6339  df-fo 6340  df-f1o 6341  df-fv 6342  df-riota 7098  df-ov 7143  df-oprab 7144  df-mpo 7145  df-om 7566  df-wrecs 7934  df-recs 7995  df-rdg 8033  df-er 8276  df-en 8497  df-dom 8498  df-sdom 8499  df-pnf 10666  df-mnf 10667  df-xr 10668  df-ltxr 10669  df-le 10670  df-sub 10861  df-neg 10862  df-nn 11626  df-2 11688  df-ndx 16477  df-slot 16478  df-base 16480  df-sets 16481  df-ress 16482  df-plusg 16569  df-0g 16706  df-mgm 17843  df-sgrp 17892  df-mnd 17903  df-grp 18097  df-minusg 18098  df-subg 18267  df-ghm 18347 This theorem is referenced by:  ghmnsgpreima  18374  subggim  18397  gicsubgen  18409  lmhmpreima  19811  evpmsubg  30820
 Copyright terms: Public domain W3C validator