Theorem ghmgrp 19305

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.

Step	Hyp	Ref	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	7	grpmndd 19186	. . 3 ⊢ (𝜑 → 𝐺 ∈ Mnd)
9	1, 2, 3, 4, 5, 6, 8	mhmmnd 19303	. 2 ⊢ (𝜑 → 𝐻 ∈ Mnd)
10		fof 6818	. . . . . . . 8 ⊢ (𝐹:𝑋⟶onto𝑌 → 𝐹:𝑋⟶𝑌)
11	6, 10	syl 18	. . . . . . 7 ⊢ (𝜑 → 𝐹:𝑋⟶𝑌)
12	11	ad3antrrr 743	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑌) ∧ 𝑖 ∈ 𝑋) ∧ (𝐹‘𝑖) = 𝑎) → 𝐹:𝑋⟶𝑌)
13	7	ad3antrrr 743	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑌) ∧ 𝑖 ∈ 𝑋) ∧ (𝐹‘𝑖) = 𝑎) → 𝐺 ∈ Grp)
14		simplr 781	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑌) ∧ 𝑖 ∈ 𝑋) ∧ (𝐹‘𝑖) = 𝑎) → 𝑖 ∈ 𝑋)
15		eqid 2763	. . . . . . . 8 ⊢ (invg‘𝐺) = (invg‘𝐺)
16	2, 15	grpinvcl 19227	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑖 ∈ 𝑋) → ((invg‘𝐺)‘𝑖) ∈ 𝑋)
17	13, 14, 16	syl2anc 596	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑌) ∧ 𝑖 ∈ 𝑋) ∧ (𝐹‘𝑖) = 𝑎) → ((invg‘𝐺)‘𝑖) ∈ 𝑋)
18	12, 17	ffvelcdmd 7109	. . . . 5 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑌) ∧ 𝑖 ∈ 𝑋) ∧ (𝐹‘𝑖) = 𝑎) → (𝐹‘((invg‘𝐺)‘𝑖)) ∈ 𝑌)
19	1	3adant1r 1196	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑖 ∈ 𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)))
20	7, 16	sylan 592	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑋) → ((invg‘𝐺)‘𝑖) ∈ 𝑋)
21		simpr 490	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑋) → 𝑖 ∈ 𝑋)
22	19, 20, 21	mhmlem 19301	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑋) → (𝐹‘(((invg‘𝐺)‘𝑖) + 𝑖)) = ((𝐹‘((invg‘𝐺)‘𝑖)) ⨣ (𝐹‘𝑖)))
23	22	ad4ant13 764	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑌) ∧ 𝑖 ∈ 𝑋) ∧ (𝐹‘𝑖) = 𝑎) → (𝐹‘(((invg‘𝐺)‘𝑖) + 𝑖)) = ((𝐹‘((invg‘𝐺)‘𝑖)) ⨣ (𝐹‘𝑖)))
24		eqid 2763	. . . . . . . . . 10 ⊢ (0g‘𝐺) = (0g‘𝐺)
25	2, 4, 24, 15	grplinv 19229	. . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ 𝑖 ∈ 𝑋) → (((invg‘𝐺)‘𝑖) + 𝑖) = (0g‘𝐺))
26	25	fveq2d 6912	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑖 ∈ 𝑋) → (𝐹‘(((invg‘𝐺)‘𝑖) + 𝑖)) = (𝐹‘(0g‘𝐺)))
27	13, 14, 26	syl2anc 596	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑌) ∧ 𝑖 ∈ 𝑋) ∧ (𝐹‘𝑖) = 𝑎) → (𝐹‘(((invg‘𝐺)‘𝑖) + 𝑖)) = (𝐹‘(0g‘𝐺)))
28	1, 2, 3, 4, 5, 6, 8, 24	mhmid 19302	. . . . . . . 8 ⊢ (𝜑 → (𝐹‘(0g‘𝐺)) = (0g‘𝐻))
29	28	ad3antrrr 743	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑌) ∧ 𝑖 ∈ 𝑋) ∧ (𝐹‘𝑖) = 𝑎) → (𝐹‘(0g‘𝐺)) = (0g‘𝐻))
30	27, 29	eqtrd 2798	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑌) ∧ 𝑖 ∈ 𝑋) ∧ (𝐹‘𝑖) = 𝑎) → (𝐹‘(((invg‘𝐺)‘𝑖) + 𝑖)) = (0g‘𝐻))
31		simpr 490	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑌) ∧ 𝑖 ∈ 𝑋) ∧ (𝐹‘𝑖) = 𝑎) → (𝐹‘𝑖) = 𝑎)
32	31	oveq2d 7459	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑌) ∧ 𝑖 ∈ 𝑋) ∧ (𝐹‘𝑖) = 𝑎) → ((𝐹‘((invg‘𝐺)‘𝑖)) ⨣ (𝐹‘𝑖)) = ((𝐹‘((invg‘𝐺)‘𝑖)) ⨣ 𝑎))
33	23, 30, 32	3eqtr3rd 2807	. . . . 5 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑌) ∧ 𝑖 ∈ 𝑋) ∧ (𝐹‘𝑖) = 𝑎) → ((𝐹‘((invg‘𝐺)‘𝑖)) ⨣ 𝑎) = (0g‘𝐻))
34		oveq1 7450	. . . . . . 7 ⊢ (𝑓 = (𝐹‘((invg‘𝐺)‘𝑖)) → (𝑓 ⨣ 𝑎) = ((𝐹‘((invg‘𝐺)‘𝑖)) ⨣ 𝑎))
35	34	eqeq1d 2765	. . . . . 6 ⊢ (𝑓 = (𝐹‘((invg‘𝐺)‘𝑖)) → ((𝑓 ⨣ 𝑎) = (0g‘𝐻) ↔ ((𝐹‘((invg‘𝐺)‘𝑖)) ⨣ 𝑎) = (0g‘𝐻)))
36	35	rspcev 3580	. . . . 5 ⊢ (((𝐹‘((invg‘𝐺)‘𝑖)) ∈ 𝑌 ∧ ((𝐹‘((invg‘𝐺)‘𝑖)) ⨣ 𝑎) = (0g‘𝐻)) → ∃𝑓 ∈ 𝑌 (𝑓 ⨣ 𝑎) = (0g‘𝐻))
37	18, 33, 36	syl2anc 596	. . . 4 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑌) ∧ 𝑖 ∈ 𝑋) ∧ (𝐹‘𝑖) = 𝑎) → ∃𝑓 ∈ 𝑌 (𝑓 ⨣ 𝑎) = (0g‘𝐻))
38		foelcdmi 6969	. . . . 5 ⊢ ((𝐹:𝑋⟶onto𝑌 ∧ 𝑎 ∈ 𝑌) → ∃𝑖 ∈ 𝑋 (𝐹‘𝑖) = 𝑎)
39	6, 38	sylan 592	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑌) → ∃𝑖 ∈ 𝑋 (𝐹‘𝑖) = 𝑎)
40	37, 39	r19.29a 3174	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑌) → ∃𝑓 ∈ 𝑌 (𝑓 ⨣ 𝑎) = (0g‘𝐻))
41	40	ralrimiva 3158	. 2 ⊢ (𝜑 → ∀𝑎 ∈ 𝑌 ∃𝑓 ∈ 𝑌 (𝑓 ⨣ 𝑎) = (0g‘𝐻))
42		eqid 2763	. . 3 ⊢ (0g‘𝐻) = (0g‘𝐻)
43	3, 5, 42	isgrp 19179	. 2 ⊢ (𝐻 ∈ Grp ↔ (𝐻 ∈ Mnd ∧ ∀𝑎 ∈ 𝑌 ∃𝑓 ∈ 𝑌 (𝑓 ⨣ 𝑎) = (0g‘𝐻)))
44	9, 41, 43	sylanbrc 595	1 ⊢ (𝜑 → 𝐻 ∈ Grp)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  ⟶wf 6554  ⟶ontowfo 6556  ‘cfv 6558  (class class class)co 7443  Basecbs 17416  +_gcplusg 17457  0_gc0g 17639  Mndcmnd 18952  Grpcgrp 19173  inv_gcminusg 19174

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-fo 6564  df-fv 6566  df-riota 7400  df-ov 7446  df-0g 17641  df-mgm 18845  df-sgrp 18937  df-mnd 18953  df-grp 19176  df-minusg 19177

This theorem is used by:  ghmfghm  20074  ghmabl  20076