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

Theorem ghmcmn 18966
 Description: The image of a commutative monoid 𝐺 under a group homomorphism 𝐹 is a commutative monoid. (Contributed by Thierry Arnoux, 26-Jan-2020.)
Hypotheses
Ref Expression
ghmabl.x 𝑋 = (Base‘𝐺)
ghmabl.y 𝑌 = (Base‘𝐻)
ghmabl.p + = (+g𝐺)
ghmabl.q = (+g𝐻)
ghmabl.f ((𝜑𝑥𝑋𝑦𝑋) → (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)))
ghmabl.1 (𝜑𝐹:𝑋onto𝑌)
ghmcmn.3 (𝜑𝐺 ∈ CMnd)
Assertion
Ref Expression
ghmcmn (𝜑𝐻 ∈ CMnd)
Distinct variable groups:   𝑥, + ,𝑦   𝑥, ,𝑦   𝑥,𝐹,𝑦   𝑥,𝐺,𝑦   𝑥,𝐻,𝑦   𝑥,𝑋,𝑦   𝑥,𝑌,𝑦   𝜑,𝑥,𝑦

Proof of Theorem ghmcmn
Dummy variables 𝑎 𝑏 𝑖 𝑗 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ghmabl.f . . 3 ((𝜑𝑥𝑋𝑦𝑋) → (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)))
2 ghmabl.x . . 3 𝑋 = (Base‘𝐺)
3 ghmabl.y . . 3 𝑌 = (Base‘𝐻)
4 ghmabl.p . . 3 + = (+g𝐺)
5 ghmabl.q . . 3 = (+g𝐻)
6 ghmabl.1 . . 3 (𝜑𝐹:𝑋onto𝑌)
7 ghmcmn.3 . . . 4 (𝜑𝐺 ∈ CMnd)
8 cmnmnd 18935 . . . 4 (𝐺 ∈ CMnd → 𝐺 ∈ Mnd)
97, 8syl 17 . . 3 (𝜑𝐺 ∈ Mnd)
101, 2, 3, 4, 5, 6, 9mhmmnd 18234 . 2 (𝜑𝐻 ∈ Mnd)
11 simp-6l 786 . . . . . . . . . . 11 (((((((𝜑𝑖𝑌) ∧ 𝑗𝑌) ∧ 𝑎𝑋) ∧ (𝐹𝑎) = 𝑖) ∧ 𝑏𝑋) ∧ (𝐹𝑏) = 𝑗) → 𝜑)
1211, 7syl 17 . . . . . . . . . 10 (((((((𝜑𝑖𝑌) ∧ 𝑗𝑌) ∧ 𝑎𝑋) ∧ (𝐹𝑎) = 𝑖) ∧ 𝑏𝑋) ∧ (𝐹𝑏) = 𝑗) → 𝐺 ∈ CMnd)
13 simp-4r 783 . . . . . . . . . 10 (((((((𝜑𝑖𝑌) ∧ 𝑗𝑌) ∧ 𝑎𝑋) ∧ (𝐹𝑎) = 𝑖) ∧ 𝑏𝑋) ∧ (𝐹𝑏) = 𝑗) → 𝑎𝑋)
14 simplr 768 . . . . . . . . . 10 (((((((𝜑𝑖𝑌) ∧ 𝑗𝑌) ∧ 𝑎𝑋) ∧ (𝐹𝑎) = 𝑖) ∧ 𝑏𝑋) ∧ (𝐹𝑏) = 𝑗) → 𝑏𝑋)
152, 4cmncom 18936 . . . . . . . . . 10 ((𝐺 ∈ CMnd ∧ 𝑎𝑋𝑏𝑋) → (𝑎 + 𝑏) = (𝑏 + 𝑎))
1612, 13, 14, 15syl3anc 1368 . . . . . . . . 9 (((((((𝜑𝑖𝑌) ∧ 𝑗𝑌) ∧ 𝑎𝑋) ∧ (𝐹𝑎) = 𝑖) ∧ 𝑏𝑋) ∧ (𝐹𝑏) = 𝑗) → (𝑎 + 𝑏) = (𝑏 + 𝑎))
1716fveq2d 6659 . . . . . . . 8 (((((((𝜑𝑖𝑌) ∧ 𝑗𝑌) ∧ 𝑎𝑋) ∧ (𝐹𝑎) = 𝑖) ∧ 𝑏𝑋) ∧ (𝐹𝑏) = 𝑗) → (𝐹‘(𝑎 + 𝑏)) = (𝐹‘(𝑏 + 𝑎)))
1811, 1syl3an1 1160 . . . . . . . . 9 ((((((((𝜑𝑖𝑌) ∧ 𝑗𝑌) ∧ 𝑎𝑋) ∧ (𝐹𝑎) = 𝑖) ∧ 𝑏𝑋) ∧ (𝐹𝑏) = 𝑗) ∧ 𝑥𝑋𝑦𝑋) → (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)))
1918, 13, 14mhmlem 18232 . . . . . . . 8 (((((((𝜑𝑖𝑌) ∧ 𝑗𝑌) ∧ 𝑎𝑋) ∧ (𝐹𝑎) = 𝑖) ∧ 𝑏𝑋) ∧ (𝐹𝑏) = 𝑗) → (𝐹‘(𝑎 + 𝑏)) = ((𝐹𝑎) (𝐹𝑏)))
2018, 14, 13mhmlem 18232 . . . . . . . 8 (((((((𝜑𝑖𝑌) ∧ 𝑗𝑌) ∧ 𝑎𝑋) ∧ (𝐹𝑎) = 𝑖) ∧ 𝑏𝑋) ∧ (𝐹𝑏) = 𝑗) → (𝐹‘(𝑏 + 𝑎)) = ((𝐹𝑏) (𝐹𝑎)))
2117, 19, 203eqtr3d 2841 . . . . . . 7 (((((((𝜑𝑖𝑌) ∧ 𝑗𝑌) ∧ 𝑎𝑋) ∧ (𝐹𝑎) = 𝑖) ∧ 𝑏𝑋) ∧ (𝐹𝑏) = 𝑗) → ((𝐹𝑎) (𝐹𝑏)) = ((𝐹𝑏) (𝐹𝑎)))
22 simpllr 775 . . . . . . . 8 (((((((𝜑𝑖𝑌) ∧ 𝑗𝑌) ∧ 𝑎𝑋) ∧ (𝐹𝑎) = 𝑖) ∧ 𝑏𝑋) ∧ (𝐹𝑏) = 𝑗) → (𝐹𝑎) = 𝑖)
23 simpr 488 . . . . . . . 8 (((((((𝜑𝑖𝑌) ∧ 𝑗𝑌) ∧ 𝑎𝑋) ∧ (𝐹𝑎) = 𝑖) ∧ 𝑏𝑋) ∧ (𝐹𝑏) = 𝑗) → (𝐹𝑏) = 𝑗)
2422, 23oveq12d 7163 . . . . . . 7 (((((((𝜑𝑖𝑌) ∧ 𝑗𝑌) ∧ 𝑎𝑋) ∧ (𝐹𝑎) = 𝑖) ∧ 𝑏𝑋) ∧ (𝐹𝑏) = 𝑗) → ((𝐹𝑎) (𝐹𝑏)) = (𝑖 𝑗))
2523, 22oveq12d 7163 . . . . . . 7 (((((((𝜑𝑖𝑌) ∧ 𝑗𝑌) ∧ 𝑎𝑋) ∧ (𝐹𝑎) = 𝑖) ∧ 𝑏𝑋) ∧ (𝐹𝑏) = 𝑗) → ((𝐹𝑏) (𝐹𝑎)) = (𝑗 𝑖))
2621, 24, 253eqtr3d 2841 . . . . . 6 (((((((𝜑𝑖𝑌) ∧ 𝑗𝑌) ∧ 𝑎𝑋) ∧ (𝐹𝑎) = 𝑖) ∧ 𝑏𝑋) ∧ (𝐹𝑏) = 𝑗) → (𝑖 𝑗) = (𝑗 𝑖))
27 foelrni 6712 . . . . . . . 8 ((𝐹:𝑋onto𝑌𝑗𝑌) → ∃𝑏𝑋 (𝐹𝑏) = 𝑗)
286, 27sylan 583 . . . . . . 7 ((𝜑𝑗𝑌) → ∃𝑏𝑋 (𝐹𝑏) = 𝑗)
2928ad5ant13 756 . . . . . 6 (((((𝜑𝑖𝑌) ∧ 𝑗𝑌) ∧ 𝑎𝑋) ∧ (𝐹𝑎) = 𝑖) → ∃𝑏𝑋 (𝐹𝑏) = 𝑗)
3026, 29r19.29a 3249 . . . . 5 (((((𝜑𝑖𝑌) ∧ 𝑗𝑌) ∧ 𝑎𝑋) ∧ (𝐹𝑎) = 𝑖) → (𝑖 𝑗) = (𝑗 𝑖))
31 foelrni 6712 . . . . . . 7 ((𝐹:𝑋onto𝑌𝑖𝑌) → ∃𝑎𝑋 (𝐹𝑎) = 𝑖)
326, 31sylan 583 . . . . . 6 ((𝜑𝑖𝑌) → ∃𝑎𝑋 (𝐹𝑎) = 𝑖)
3332adantr 484 . . . . 5 (((𝜑𝑖𝑌) ∧ 𝑗𝑌) → ∃𝑎𝑋 (𝐹𝑎) = 𝑖)
3430, 33r19.29a 3249 . . . 4 (((𝜑𝑖𝑌) ∧ 𝑗𝑌) → (𝑖 𝑗) = (𝑗 𝑖))
3534anasss 470 . . 3 ((𝜑 ∧ (𝑖𝑌𝑗𝑌)) → (𝑖 𝑗) = (𝑗 𝑖))
3635ralrimivva 3156 . 2 (𝜑 → ∀𝑖𝑌𝑗𝑌 (𝑖 𝑗) = (𝑗 𝑖))
373, 5iscmn 18927 . 2 (𝐻 ∈ CMnd ↔ (𝐻 ∈ Mnd ∧ ∀𝑖𝑌𝑗𝑌 (𝑖 𝑗) = (𝑗 𝑖)))
3810, 36, 37sylanbrc 586 1 (𝜑𝐻 ∈ CMnd)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111  ∀wral 3106  ∃wrex 3107  –onto→wfo 6330  ‘cfv 6332  (class class class)co 7145  Basecbs 16495  +gcplusg 16577  Mndcmnd 17923  CMndccmn 18919 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 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5171  ax-nul 5178  ax-pr 5299 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 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3444  df-sbc 3723  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4247  df-if 4429  df-sn 4529  df-pr 4531  df-op 4535  df-uni 4805  df-br 5035  df-opab 5097  df-mpt 5115  df-id 5429  df-xp 5529  df-rel 5530  df-cnv 5531  df-co 5532  df-dm 5533  df-rn 5534  df-iota 6291  df-fun 6334  df-fn 6335  df-f 6336  df-fo 6338  df-fv 6340  df-riota 7103  df-ov 7148  df-0g 16727  df-mgm 17864  df-sgrp 17913  df-mnd 17924  df-cmn 18921 This theorem is referenced by:  ghmabl  18967
 Copyright terms: Public domain W3C validator