ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ghmgrp GIF version

Theorem ghmgrp 13707
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)
87grpmndd 13598 . . 3 (𝜑𝐺 ∈ Mnd)
91, 2, 3, 4, 5, 6, 8mhmmnd 13705 . 2 (𝜑𝐻 ∈ Mnd)
10 fof 5559 . . . . . . . 8 (𝐹:𝑋onto𝑌𝐹:𝑋𝑌)
116, 10syl 14 . . . . . . 7 (𝜑𝐹:𝑋𝑌)
1211ad3antrrr 492 . . . . . 6 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → 𝐹:𝑋𝑌)
137ad3antrrr 492 . . . . . . 7 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → 𝐺 ∈ Grp)
14 simplr 529 . . . . . . 7 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → 𝑖𝑋)
15 eqid 2231 . . . . . . . 8 (invg𝐺) = (invg𝐺)
162, 15grpinvcl 13633 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑖𝑋) → ((invg𝐺)‘𝑖) ∈ 𝑋)
1713, 14, 16syl2anc 411 . . . . . 6 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → ((invg𝐺)‘𝑖) ∈ 𝑋)
1812, 17ffvelcdmd 5783 . . . . 5 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → (𝐹‘((invg𝐺)‘𝑖)) ∈ 𝑌)
1913adant1r 1257 . . . . . . . 8 (((𝜑𝑖𝑋) ∧ 𝑥𝑋𝑦𝑋) → (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)))
207, 16sylan 283 . . . . . . . 8 ((𝜑𝑖𝑋) → ((invg𝐺)‘𝑖) ∈ 𝑋)
21 simpr 110 . . . . . . . 8 ((𝜑𝑖𝑋) → 𝑖𝑋)
2219, 20, 21mhmlem 13703 . . . . . . 7 ((𝜑𝑖𝑋) → (𝐹‘(((invg𝐺)‘𝑖) + 𝑖)) = ((𝐹‘((invg𝐺)‘𝑖)) (𝐹𝑖)))
2322ad4ant13 513 . . . . . 6 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → (𝐹‘(((invg𝐺)‘𝑖) + 𝑖)) = ((𝐹‘((invg𝐺)‘𝑖)) (𝐹𝑖)))
24 eqid 2231 . . . . . . . . . 10 (0g𝐺) = (0g𝐺)
252, 4, 24, 15grplinv 13635 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ 𝑖𝑋) → (((invg𝐺)‘𝑖) + 𝑖) = (0g𝐺))
2625fveq2d 5643 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝑖𝑋) → (𝐹‘(((invg𝐺)‘𝑖) + 𝑖)) = (𝐹‘(0g𝐺)))
2713, 14, 26syl2anc 411 . . . . . . 7 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → (𝐹‘(((invg𝐺)‘𝑖) + 𝑖)) = (𝐹‘(0g𝐺)))
281, 2, 3, 4, 5, 6, 8, 24mhmid 13704 . . . . . . . 8 (𝜑 → (𝐹‘(0g𝐺)) = (0g𝐻))
2928ad3antrrr 492 . . . . . . 7 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → (𝐹‘(0g𝐺)) = (0g𝐻))
3027, 29eqtrd 2264 . . . . . 6 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → (𝐹‘(((invg𝐺)‘𝑖) + 𝑖)) = (0g𝐻))
31 simpr 110 . . . . . . 7 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → (𝐹𝑖) = 𝑎)
3231oveq2d 6034 . . . . . 6 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → ((𝐹‘((invg𝐺)‘𝑖)) (𝐹𝑖)) = ((𝐹‘((invg𝐺)‘𝑖)) 𝑎))
3323, 30, 323eqtr3rd 2273 . . . . 5 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → ((𝐹‘((invg𝐺)‘𝑖)) 𝑎) = (0g𝐻))
34 oveq1 6025 . . . . . . 7 (𝑓 = (𝐹‘((invg𝐺)‘𝑖)) → (𝑓 𝑎) = ((𝐹‘((invg𝐺)‘𝑖)) 𝑎))
3534eqeq1d 2240 . . . . . 6 (𝑓 = (𝐹‘((invg𝐺)‘𝑖)) → ((𝑓 𝑎) = (0g𝐻) ↔ ((𝐹‘((invg𝐺)‘𝑖)) 𝑎) = (0g𝐻)))
3635rspcev 2910 . . . . 5 (((𝐹‘((invg𝐺)‘𝑖)) ∈ 𝑌 ∧ ((𝐹‘((invg𝐺)‘𝑖)) 𝑎) = (0g𝐻)) → ∃𝑓𝑌 (𝑓 𝑎) = (0g𝐻))
3718, 33, 36syl2anc 411 . . . 4 ((((𝜑𝑎𝑌) ∧ 𝑖𝑋) ∧ (𝐹𝑖) = 𝑎) → ∃𝑓𝑌 (𝑓 𝑎) = (0g𝐻))
38 foelcdmi 5698 . . . . 5 ((𝐹:𝑋onto𝑌𝑎𝑌) → ∃𝑖𝑋 (𝐹𝑖) = 𝑎)
396, 38sylan 283 . . . 4 ((𝜑𝑎𝑌) → ∃𝑖𝑋 (𝐹𝑖) = 𝑎)
4037, 39r19.29a 2676 . . 3 ((𝜑𝑎𝑌) → ∃𝑓𝑌 (𝑓 𝑎) = (0g𝐻))
4140ralrimiva 2605 . 2 (𝜑 → ∀𝑎𝑌𝑓𝑌 (𝑓 𝑎) = (0g𝐻))
42 eqid 2231 . . 3 (0g𝐻) = (0g𝐻)
433, 5, 42isgrp 13591 . 2 (𝐻 ∈ Grp ↔ (𝐻 ∈ Mnd ∧ ∀𝑎𝑌𝑓𝑌 (𝑓 𝑎) = (0g𝐻)))
449, 41, 43sylanbrc 417 1 (𝜑𝐻 ∈ Grp)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 1004   = wceq 1397  wcel 2202  wral 2510  wrex 2511  wf 5322  ontowfo 5324  cfv 5326  (class class class)co 6018  Basecbs 13084  +gcplusg 13162  0gc0g 13341  Mndcmnd 13501  Grpcgrp 13585  invgcminusg 13586
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-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-cnex 8123  ax-resscn 8124  ax-1re 8126  ax-addrcl 8129
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5971  df-ov 6021  df-inn 9144  df-2 9202  df-ndx 13087  df-slot 13088  df-base 13090  df-plusg 13175  df-0g 13343  df-mgm 13441  df-sgrp 13487  df-mnd 13502  df-grp 13588  df-minusg 13589
This theorem is referenced by:  ghmfghm  13915  ghmabl  13917
  Copyright terms: Public domain W3C validator