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

Theorem ghmgrp 18214
Description: The image of a group 𝐺 under a group homomorphism 𝐹 is a group. This is a stronger result than that usually found in the literature, since the target of the homomorphism (operator 𝑂 in our model) need not have any of the properties of a group as a prerequisite. (Contributed by Paul Chapman, 25-Apr-2008.) (Revised by Mario Carneiro, 12-May-2014.) (Revised by Thierry Arnoux, 25-Jan-2020.)
Hypotheses
Ref Expression
ghmgrp.f ((𝜑𝑥𝑋𝑦𝑋) → (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)))
ghmgrp.x 𝑋 = (Base‘𝐺)
ghmgrp.y 𝑌 = (Base‘𝐻)
ghmgrp.p + = (+g𝐺)
ghmgrp.q = (+g𝐻)
ghmgrp.1 (𝜑𝐹:𝑋onto𝑌)
ghmgrp.3 (𝜑𝐺 ∈ Grp)
Assertion
Ref Expression
ghmgrp (𝜑𝐻 ∈ Grp)
Distinct variable groups:   𝑥,𝐹,𝑦   𝑥,𝐺,𝑦   𝑥, + ,𝑦   𝑥,𝐻,𝑦   𝑥,𝑋,𝑦   𝑥,𝑌,𝑦   𝑥, ,𝑦   𝜑,𝑥,𝑦

Proof of Theorem ghmgrp
Dummy variables 𝑎 𝑓 𝑖 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ghmgrp.f . . 3 ((𝜑𝑥𝑋𝑦𝑋) → (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)))
2 ghmgrp.x . . 3 𝑋 = (Base‘𝐺)
3 ghmgrp.y . . 3 𝑌 = (Base‘𝐻)
4 ghmgrp.p . . 3 + = (+g𝐺)
5 ghmgrp.q . . 3 = (+g𝐻)
6 ghmgrp.1 . . 3 (𝜑𝐹:𝑋onto𝑌)
7 ghmgrp.3 . . . 4 (𝜑𝐺 ∈ Grp)
8 grpmnd 18101 . . . 4 (𝐺 ∈ Grp → 𝐺 ∈ Mnd)
97, 8syl 17 . . 3 (𝜑𝐺 ∈ Mnd)
101, 2, 3, 4, 5, 6, 9mhmmnd 18212 . 2 (𝜑𝐻 ∈ Mnd)
11 fof 6572 . . . . . . . 8 (𝐹:𝑋onto𝑌𝐹:𝑋𝑌)
126, 11syl 17 . . . . . . 7 (𝜑𝐹:𝑋𝑌)
1312ad3antrrr 729 . . . . . 6 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → 𝐹:𝑋𝑌)
147ad3antrrr 729 . . . . . . 7 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → 𝐺 ∈ Grp)
15 simplr 768 . . . . . . 7 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → 𝑖𝑋)
16 eqid 2822 . . . . . . . 8 (invg𝐺) = (invg𝐺)
172, 16grpinvcl 18142 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑖𝑋) → ((invg𝐺)‘𝑖) ∈ 𝑋)
1814, 15, 17syl2anc 587 . . . . . 6 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → ((invg𝐺)‘𝑖) ∈ 𝑋)
1913, 18ffvelrnd 6834 . . . . 5 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → (𝐹‘((invg𝐺)‘𝑖)) ∈ 𝑌)
2013adant1r 1174 . . . . . . . 8 (((𝜑𝑖𝑋) ∧ 𝑥𝑋𝑦𝑋) → (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)))
217, 17sylan 583 . . . . . . . 8 ((𝜑𝑖𝑋) → ((invg𝐺)‘𝑖) ∈ 𝑋)
22 simpr 488 . . . . . . . 8 ((𝜑𝑖𝑋) → 𝑖𝑋)
2320, 21, 22mhmlem 18210 . . . . . . 7 ((𝜑𝑖𝑋) → (𝐹‘(((invg𝐺)‘𝑖) + 𝑖)) = ((𝐹‘((invg𝐺)‘𝑖)) (𝐹𝑖)))
2423ad4ant13 750 . . . . . 6 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → (𝐹‘(((invg𝐺)‘𝑖) + 𝑖)) = ((𝐹‘((invg𝐺)‘𝑖)) (𝐹𝑖)))
25 eqid 2822 . . . . . . . . . 10 (0g𝐺) = (0g𝐺)
262, 4, 25, 16grplinv 18143 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ 𝑖𝑋) → (((invg𝐺)‘𝑖) + 𝑖) = (0g𝐺))
2726fveq2d 6656 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝑖𝑋) → (𝐹‘(((invg𝐺)‘𝑖) + 𝑖)) = (𝐹‘(0g𝐺)))
2814, 15, 27syl2anc 587 . . . . . . 7 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → (𝐹‘(((invg𝐺)‘𝑖) + 𝑖)) = (𝐹‘(0g𝐺)))
291, 2, 3, 4, 5, 6, 9, 25mhmid 18211 . . . . . . . 8 (𝜑 → (𝐹‘(0g𝐺)) = (0g𝐻))
3029ad3antrrr 729 . . . . . . 7 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → (𝐹‘(0g𝐺)) = (0g𝐻))
3128, 30eqtrd 2857 . . . . . 6 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → (𝐹‘(((invg𝐺)‘𝑖) + 𝑖)) = (0g𝐻))
32 simpr 488 . . . . . . 7 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → (𝐹𝑖) = 𝑎)
3332oveq2d 7156 . . . . . 6 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → ((𝐹‘((invg𝐺)‘𝑖)) (𝐹𝑖)) = ((𝐹‘((invg𝐺)‘𝑖)) 𝑎))
3424, 31, 333eqtr3rd 2866 . . . . 5 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → ((𝐹‘((invg𝐺)‘𝑖)) 𝑎) = (0g𝐻))
35 oveq1 7147 . . . . . . 7 (𝑓 = (𝐹‘((invg𝐺)‘𝑖)) → (𝑓 𝑎) = ((𝐹‘((invg𝐺)‘𝑖)) 𝑎))
3635eqeq1d 2824 . . . . . 6 (𝑓 = (𝐹‘((invg𝐺)‘𝑖)) → ((𝑓 𝑎) = (0g𝐻) ↔ ((𝐹‘((invg𝐺)‘𝑖)) 𝑎) = (0g𝐻)))
3736rspcev 3598 . . . . 5 (((𝐹‘((invg𝐺)‘𝑖)) ∈ 𝑌 ∧ ((𝐹‘((invg𝐺)‘𝑖)) 𝑎) = (0g𝐻)) → ∃𝑓𝑌 (𝑓 𝑎) = (0g𝐻))
3819, 34, 37syl2anc 587 . . . 4 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → ∃𝑓𝑌 (𝑓 𝑎) = (0g𝐻))
39 foelrni 6709 . . . . 5 ((𝐹:𝑋onto𝑌𝑎𝑌) → ∃𝑖𝑋 (𝐹𝑖) = 𝑎)
406, 39sylan 583 . . . 4 ((𝜑𝑎𝑌) → ∃𝑖𝑋 (𝐹𝑖) = 𝑎)
4138, 40r19.29a 3275 . . 3 ((𝜑𝑎𝑌) → ∃𝑓𝑌 (𝑓 𝑎) = (0g𝐻))
4241ralrimiva 3174 . 2 (𝜑 → ∀𝑎𝑌𝑓𝑌 (𝑓 𝑎) = (0g𝐻))
43 eqid 2822 . . 3 (0g𝐻) = (0g𝐻)
443, 5, 43isgrp 18100 . 2 (𝐻 ∈ Grp ↔ (𝐻 ∈ Mnd ∧ ∀𝑎𝑌𝑓𝑌 (𝑓 𝑎) = (0g𝐻)))
4510, 42, 44sylanbrc 586 1 (𝜑𝐻 ∈ Grp)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  w3a 1084   = wceq 1538  wcel 2114  wral 3130  wrex 3131  wf 6330  ontowfo 6332  cfv 6334  (class class class)co 7140  Basecbs 16474  +gcplusg 16556  0gc0g 16704  Mndcmnd 17902  Grpcgrp 18094  invgcminusg 18095
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-sep 5179  ax-nul 5186  ax-pow 5243  ax-pr 5307  ax-un 7446
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  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-ral 3135  df-rex 3136  df-reu 3137  df-rmo 3138  df-rab 3139  df-v 3471  df-sbc 3748  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4266  df-if 4440  df-pw 4513  df-sn 4540  df-pr 4542  df-op 4546  df-uni 4814  df-br 5043  df-opab 5105  df-mpt 5123  df-id 5437  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-iota 6293  df-fun 6336  df-fn 6337  df-f 6338  df-fo 6340  df-fv 6342  df-riota 7098  df-ov 7143  df-0g 16706  df-mgm 17843  df-sgrp 17892  df-mnd 17903  df-grp 18097  df-minusg 18098
This theorem is referenced by:  ghmfghm  18942  ghmabl  18944
  Copyright terms: Public domain W3C validator