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

Theorem ghmnsgpreima 19260
Description: The inverse image of a normal subgroup under a homomorphism is normal. (Contributed by Mario Carneiro, 4-Feb-2015.)
Assertion
Ref Expression
ghmnsgpreima ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) → (𝐹𝑉) ∈ (NrmSGrp‘𝑆))

Proof of Theorem ghmnsgpreima
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nsgsubg 19177 . . 3 (𝑉 ∈ (NrmSGrp‘𝑇) → 𝑉 ∈ (SubGrp‘𝑇))
2 ghmpreima 19257 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (SubGrp‘𝑇)) → (𝐹𝑉) ∈ (SubGrp‘𝑆))
31, 2sylan2 593 . 2 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) → (𝐹𝑉) ∈ (SubGrp‘𝑆))
4 ghmgrp1 19237 . . . . . 6 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp)
54ad2antrr 726 . . . . 5 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (𝐹𝑉))) → 𝑆 ∈ Grp)
6 simprl 770 . . . . . 6 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (𝐹𝑉))) → 𝑥 ∈ (Base‘𝑆))
7 simprr 772 . . . . . . . 8 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (𝐹𝑉))) → 𝑦 ∈ (𝐹𝑉))
8 simpll 766 . . . . . . . . . . 11 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (𝐹𝑉))) → 𝐹 ∈ (𝑆 GrpHom 𝑇))
9 eqid 2736 . . . . . . . . . . . 12 (Base‘𝑆) = (Base‘𝑆)
10 eqid 2736 . . . . . . . . . . . 12 (Base‘𝑇) = (Base‘𝑇)
119, 10ghmf 19239 . . . . . . . . . . 11 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
128, 11syl 17 . . . . . . . . . 10 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (𝐹𝑉))) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
1312ffnd 6736 . . . . . . . . 9 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (𝐹𝑉))) → 𝐹 Fn (Base‘𝑆))
14 elpreima 7077 . . . . . . . . 9 (𝐹 Fn (Base‘𝑆) → (𝑦 ∈ (𝐹𝑉) ↔ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹𝑦) ∈ 𝑉)))
1513, 14syl 17 . . . . . . . 8 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (𝐹𝑉))) → (𝑦 ∈ (𝐹𝑉) ↔ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹𝑦) ∈ 𝑉)))
167, 15mpbid 232 . . . . . . 7 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (𝐹𝑉))) → (𝑦 ∈ (Base‘𝑆) ∧ (𝐹𝑦) ∈ 𝑉))
1716simpld 494 . . . . . 6 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (𝐹𝑉))) → 𝑦 ∈ (Base‘𝑆))
18 eqid 2736 . . . . . . 7 (+g𝑆) = (+g𝑆)
199, 18grpcl 18960 . . . . . 6 ((𝑆 ∈ Grp ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝑥(+g𝑆)𝑦) ∈ (Base‘𝑆))
205, 6, 17, 19syl3anc 1372 . . . . 5 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (𝐹𝑉))) → (𝑥(+g𝑆)𝑦) ∈ (Base‘𝑆))
21 eqid 2736 . . . . . 6 (-g𝑆) = (-g𝑆)
229, 21grpsubcl 19039 . . . . 5 ((𝑆 ∈ Grp ∧ (𝑥(+g𝑆)𝑦) ∈ (Base‘𝑆) ∧ 𝑥 ∈ (Base‘𝑆)) → ((𝑥(+g𝑆)𝑦)(-g𝑆)𝑥) ∈ (Base‘𝑆))
235, 20, 6, 22syl3anc 1372 . . . 4 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (𝐹𝑉))) → ((𝑥(+g𝑆)𝑦)(-g𝑆)𝑥) ∈ (Base‘𝑆))
24 eqid 2736 . . . . . . . 8 (-g𝑇) = (-g𝑇)
259, 21, 24ghmsub 19243 . . . . . . 7 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (𝑥(+g𝑆)𝑦) ∈ (Base‘𝑆) ∧ 𝑥 ∈ (Base‘𝑆)) → (𝐹‘((𝑥(+g𝑆)𝑦)(-g𝑆)𝑥)) = ((𝐹‘(𝑥(+g𝑆)𝑦))(-g𝑇)(𝐹𝑥)))
268, 20, 6, 25syl3anc 1372 . . . . . 6 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (𝐹𝑉))) → (𝐹‘((𝑥(+g𝑆)𝑦)(-g𝑆)𝑥)) = ((𝐹‘(𝑥(+g𝑆)𝑦))(-g𝑇)(𝐹𝑥)))
27 eqid 2736 . . . . . . . . 9 (+g𝑇) = (+g𝑇)
289, 18, 27ghmlin 19240 . . . . . . . 8 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
298, 6, 17, 28syl3anc 1372 . . . . . . 7 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (𝐹𝑉))) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
3029oveq1d 7447 . . . . . 6 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (𝐹𝑉))) → ((𝐹‘(𝑥(+g𝑆)𝑦))(-g𝑇)(𝐹𝑥)) = (((𝐹𝑥)(+g𝑇)(𝐹𝑦))(-g𝑇)(𝐹𝑥)))
3126, 30eqtrd 2776 . . . . 5 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (𝐹𝑉))) → (𝐹‘((𝑥(+g𝑆)𝑦)(-g𝑆)𝑥)) = (((𝐹𝑥)(+g𝑇)(𝐹𝑦))(-g𝑇)(𝐹𝑥)))
32 simplr 768 . . . . . 6 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (𝐹𝑉))) → 𝑉 ∈ (NrmSGrp‘𝑇))
3312, 6ffvelcdmd 7104 . . . . . 6 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (𝐹𝑉))) → (𝐹𝑥) ∈ (Base‘𝑇))
3416simprd 495 . . . . . 6 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (𝐹𝑉))) → (𝐹𝑦) ∈ 𝑉)
3510, 27, 24nsgconj 19178 . . . . . 6 ((𝑉 ∈ (NrmSGrp‘𝑇) ∧ (𝐹𝑥) ∈ (Base‘𝑇) ∧ (𝐹𝑦) ∈ 𝑉) → (((𝐹𝑥)(+g𝑇)(𝐹𝑦))(-g𝑇)(𝐹𝑥)) ∈ 𝑉)
3632, 33, 34, 35syl3anc 1372 . . . . 5 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (𝐹𝑉))) → (((𝐹𝑥)(+g𝑇)(𝐹𝑦))(-g𝑇)(𝐹𝑥)) ∈ 𝑉)
3731, 36eqeltrd 2840 . . . 4 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (𝐹𝑉))) → (𝐹‘((𝑥(+g𝑆)𝑦)(-g𝑆)𝑥)) ∈ 𝑉)
38 elpreima 7077 . . . . 5 (𝐹 Fn (Base‘𝑆) → (((𝑥(+g𝑆)𝑦)(-g𝑆)𝑥) ∈ (𝐹𝑉) ↔ (((𝑥(+g𝑆)𝑦)(-g𝑆)𝑥) ∈ (Base‘𝑆) ∧ (𝐹‘((𝑥(+g𝑆)𝑦)(-g𝑆)𝑥)) ∈ 𝑉)))
3913, 38syl 17 . . . 4 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (𝐹𝑉))) → (((𝑥(+g𝑆)𝑦)(-g𝑆)𝑥) ∈ (𝐹𝑉) ↔ (((𝑥(+g𝑆)𝑦)(-g𝑆)𝑥) ∈ (Base‘𝑆) ∧ (𝐹‘((𝑥(+g𝑆)𝑦)(-g𝑆)𝑥)) ∈ 𝑉)))
4023, 37, 39mpbir2and 713 . . 3 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (𝐹𝑉))) → ((𝑥(+g𝑆)𝑦)(-g𝑆)𝑥) ∈ (𝐹𝑉))
4140ralrimivva 3201 . 2 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) → ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (𝐹𝑉)((𝑥(+g𝑆)𝑦)(-g𝑆)𝑥) ∈ (𝐹𝑉))
429, 18, 21isnsg3 19179 . 2 ((𝐹𝑉) ∈ (NrmSGrp‘𝑆) ↔ ((𝐹𝑉) ∈ (SubGrp‘𝑆) ∧ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (𝐹𝑉)((𝑥(+g𝑆)𝑦)(-g𝑆)𝑥) ∈ (𝐹𝑉)))
433, 41, 42sylanbrc 583 1 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑉 ∈ (NrmSGrp‘𝑇)) → (𝐹𝑉) ∈ (NrmSGrp‘𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1539  wcel 2107  wral 3060  ccnv 5683  cima 5687   Fn wfn 6555  wf 6556  cfv 6560  (class class class)co 7432  Basecbs 17248  +gcplusg 17298  Grpcgrp 18952  -gcsg 18954  SubGrpcsubg 19139  NrmSGrpcnsg 19140   GrpHom cghm 19231
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-sep 5295  ax-nul 5305  ax-pow 5364  ax-pr 5431  ax-un 7756  ax-cnex 11212  ax-resscn 11213  ax-1cn 11214  ax-icn 11215  ax-addcl 11216  ax-addrcl 11217  ax-mulcl 11218  ax-mulrcl 11219  ax-mulcom 11220  ax-addass 11221  ax-mulass 11222  ax-distr 11223  ax-i2m1 11224  ax-1ne0 11225  ax-1rid 11226  ax-rnegex 11227  ax-rrecex 11228  ax-cnre 11229  ax-pre-lttri 11230  ax-pre-lttrn 11231  ax-pre-ltadd 11232  ax-pre-mulgt0 11233
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-nel 3046  df-ral 3061  df-rex 3070  df-rmo 3379  df-reu 3380  df-rab 3436  df-v 3481  df-sbc 3788  df-csb 3899  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-pss 3970  df-nul 4333  df-if 4525  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-iun 4992  df-br 5143  df-opab 5205  df-mpt 5225  df-tr 5259  df-id 5577  df-eprel 5583  df-po 5591  df-so 5592  df-fr 5636  df-we 5638  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-res 5696  df-ima 5697  df-pred 6320  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-iota 6513  df-fun 6562  df-fn 6563  df-f 6564  df-f1 6565  df-fo 6566  df-f1o 6567  df-fv 6568  df-riota 7389  df-ov 7435  df-oprab 7436  df-mpo 7437  df-om 7889  df-1st 8015  df-2nd 8016  df-frecs 8307  df-wrecs 8338  df-recs 8412  df-rdg 8451  df-er 8746  df-map 8869  df-en 8987  df-dom 8988  df-sdom 8989  df-pnf 11298  df-mnf 11299  df-xr 11300  df-ltxr 11301  df-le 11302  df-sub 11495  df-neg 11496  df-nn 12268  df-2 12330  df-sets 17202  df-slot 17220  df-ndx 17232  df-base 17249  df-ress 17276  df-plusg 17311  df-0g 17487  df-mgm 18654  df-sgrp 18733  df-mnd 18749  df-grp 18955  df-minusg 18956  df-sbg 18957  df-subg 19142  df-nsg 19143  df-ghm 19232
This theorem is referenced by:  ghmker  19261
  Copyright terms: Public domain W3C validator