Theorem ghmcmn 20045

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.

Step	Hyp	Ref	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 20011	. . . 4 ⊢ (𝐺 ∈ CMnd → 𝐺 ∈ Mnd)
9	7, 8	syl 18	. . 3 ⊢ (𝜑 → 𝐺 ∈ Mnd)
10	1, 2, 3, 4, 5, 6, 9	mhmmnd 19274	. 2 ⊢ (𝜑 → 𝐻 ∈ Mnd)
11		simp-6l 799	. . . . . . . . . . 11 ⊢ (((((((𝜑 ∧ 𝑖 ∈ 𝑌) ∧ 𝑗 ∈ 𝑌) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = 𝑖) ∧ 𝑏 ∈ 𝑋) ∧ (𝐹‘𝑏) = 𝑗) → 𝜑)
12	11, 7	syl 18	. . . . . . . . . 10 ⊢ (((((((𝜑 ∧ 𝑖 ∈ 𝑌) ∧ 𝑗 ∈ 𝑌) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = 𝑖) ∧ 𝑏 ∈ 𝑋) ∧ (𝐹‘𝑏) = 𝑗) → 𝐺 ∈ CMnd)
13		simp-4r 796	. . . . . . . . . 10 ⊢ (((((((𝜑 ∧ 𝑖 ∈ 𝑌) ∧ 𝑗 ∈ 𝑌) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = 𝑖) ∧ 𝑏 ∈ 𝑋) ∧ (𝐹‘𝑏) = 𝑗) → 𝑎 ∈ 𝑋)
14		simplr 781	. . . . . . . . . 10 ⊢ (((((((𝜑 ∧ 𝑖 ∈ 𝑌) ∧ 𝑗 ∈ 𝑌) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = 𝑖) ∧ 𝑏 ∈ 𝑋) ∧ (𝐹‘𝑏) = 𝑗) → 𝑏 ∈ 𝑋)
15	2, 4	cmncom 20012	. . . . . . . . . 10 ⊢ ((𝐺 ∈ CMnd ∧ 𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) → (𝑎 + 𝑏) = (𝑏 + 𝑎))
16	12, 13, 14, 15	syl3anc 1398	. . . . . . . . 9 ⊢ (((((((𝜑 ∧ 𝑖 ∈ 𝑌) ∧ 𝑗 ∈ 𝑌) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = 𝑖) ∧ 𝑏 ∈ 𝑋) ∧ (𝐹‘𝑏) = 𝑗) → (𝑎 + 𝑏) = (𝑏 + 𝑎))
17	16	fveq2d 6889	. . . . . . . 8 ⊢ (((((((𝜑 ∧ 𝑖 ∈ 𝑌) ∧ 𝑗 ∈ 𝑌) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = 𝑖) ∧ 𝑏 ∈ 𝑋) ∧ (𝐹‘𝑏) = 𝑗) → (𝐹‘(𝑎 + 𝑏)) = (𝐹‘(𝑏 + 𝑎)))
18	11, 1	syl3an1 1181	. . . . . . . . 9 ⊢ ((((((((𝜑 ∧ 𝑖 ∈ 𝑌) ∧ 𝑗 ∈ 𝑌) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = 𝑖) ∧ 𝑏 ∈ 𝑋) ∧ (𝐹‘𝑏) = 𝑗) ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)))
19	18, 13, 14	mhmlem 19272	. . . . . . . 8 ⊢ (((((((𝜑 ∧ 𝑖 ∈ 𝑌) ∧ 𝑗 ∈ 𝑌) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = 𝑖) ∧ 𝑏 ∈ 𝑋) ∧ (𝐹‘𝑏) = 𝑗) → (𝐹‘(𝑎 + 𝑏)) = ((𝐹‘𝑎) ⨣ (𝐹‘𝑏)))
20	18, 14, 13	mhmlem 19272	. . . . . . . 8 ⊢ (((((((𝜑 ∧ 𝑖 ∈ 𝑌) ∧ 𝑗 ∈ 𝑌) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = 𝑖) ∧ 𝑏 ∈ 𝑋) ∧ (𝐹‘𝑏) = 𝑗) → (𝐹‘(𝑏 + 𝑎)) = ((𝐹‘𝑏) ⨣ (𝐹‘𝑎)))
21	17, 19, 20	3eqtr3d 2803	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑖 ∈ 𝑌) ∧ 𝑗 ∈ 𝑌) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = 𝑖) ∧ 𝑏 ∈ 𝑋) ∧ (𝐹‘𝑏) = 𝑗) → ((𝐹‘𝑎) ⨣ (𝐹‘𝑏)) = ((𝐹‘𝑏) ⨣ (𝐹‘𝑎)))
22		simpllr 788	. . . . . . . 8 ⊢ (((((((𝜑 ∧ 𝑖 ∈ 𝑌) ∧ 𝑗 ∈ 𝑌) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = 𝑖) ∧ 𝑏 ∈ 𝑋) ∧ (𝐹‘𝑏) = 𝑗) → (𝐹‘𝑎) = 𝑖)
23		simpr 490	. . . . . . . 8 ⊢ (((((((𝜑 ∧ 𝑖 ∈ 𝑌) ∧ 𝑗 ∈ 𝑌) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = 𝑖) ∧ 𝑏 ∈ 𝑋) ∧ (𝐹‘𝑏) = 𝑗) → (𝐹‘𝑏) = 𝑗)
24	22, 23	oveq12d 7438	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑖 ∈ 𝑌) ∧ 𝑗 ∈ 𝑌) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = 𝑖) ∧ 𝑏 ∈ 𝑋) ∧ (𝐹‘𝑏) = 𝑗) → ((𝐹‘𝑎) ⨣ (𝐹‘𝑏)) = (𝑖 ⨣ 𝑗))
25	23, 22	oveq12d 7438	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑖 ∈ 𝑌) ∧ 𝑗 ∈ 𝑌) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = 𝑖) ∧ 𝑏 ∈ 𝑋) ∧ (𝐹‘𝑏) = 𝑗) → ((𝐹‘𝑏) ⨣ (𝐹‘𝑎)) = (𝑗 ⨣ 𝑖))
26	21, 24, 25	3eqtr3d 2803	. . . . . 6 ⊢ (((((((𝜑 ∧ 𝑖 ∈ 𝑌) ∧ 𝑗 ∈ 𝑌) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = 𝑖) ∧ 𝑏 ∈ 𝑋) ∧ (𝐹‘𝑏) = 𝑗) → (𝑖 ⨣ 𝑗) = (𝑗 ⨣ 𝑖))
27		foelcdmi 6946	. . . . . . . 8 ⊢ ((𝐹:𝑋–onto→𝑌 ∧ 𝑗 ∈ 𝑌) → ∃𝑏 ∈ 𝑋 (𝐹‘𝑏) = 𝑗)
28	6, 27	sylan 592	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑌) → ∃𝑏 ∈ 𝑋 (𝐹‘𝑏) = 𝑗)
29	28	ad5ant13 769	. . . . . 6 ⊢ (((((𝜑 ∧ 𝑖 ∈ 𝑌) ∧ 𝑗 ∈ 𝑌) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = 𝑖) → ∃𝑏 ∈ 𝑋 (𝐹‘𝑏) = 𝑗)
30	26, 29	r19.29a 3170	. . . . 5 ⊢ (((((𝜑 ∧ 𝑖 ∈ 𝑌) ∧ 𝑗 ∈ 𝑌) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = 𝑖) → (𝑖 ⨣ 𝑗) = (𝑗 ⨣ 𝑖))
31		foelcdmi 6946	. . . . . . 7 ⊢ ((𝐹:𝑋–onto→𝑌 ∧ 𝑖 ∈ 𝑌) → ∃𝑎 ∈ 𝑋 (𝐹‘𝑎) = 𝑖)
32	6, 31	sylan 592	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑌) → ∃𝑎 ∈ 𝑋 (𝐹‘𝑎) = 𝑖)
33	32	adantr 486	. . . . 5 ⊢ (((𝜑 ∧ 𝑖 ∈ 𝑌) ∧ 𝑗 ∈ 𝑌) → ∃𝑎 ∈ 𝑋 (𝐹‘𝑎) = 𝑖)
34	30, 33	r19.29a 3170	. . . 4 ⊢ (((𝜑 ∧ 𝑖 ∈ 𝑌) ∧ 𝑗 ∈ 𝑌) → (𝑖 ⨣ 𝑗) = (𝑗 ⨣ 𝑖))
35	34	anasss 472	. . 3 ⊢ ((𝜑 ∧ (𝑖 ∈ 𝑌 ∧ 𝑗 ∈ 𝑌)) → (𝑖 ⨣ 𝑗) = (𝑗 ⨣ 𝑖))
36	35	ralrimivva 3205	. 2 ⊢ (𝜑 → ∀𝑖 ∈ 𝑌 ∀𝑗 ∈ 𝑌 (𝑖 ⨣ 𝑗) = (𝑗 ⨣ 𝑖))
37	3, 5	iscmn 20003	. 2 ⊢ (𝐻 ∈ CMnd ↔ (𝐻 ∈ Mnd ∧ ∀𝑖 ∈ 𝑌 ∀𝑗 ∈ 𝑌 (𝑖 ⨣ 𝑗) = (𝑗 ⨣ 𝑖)))
38	10, 36, 37	sylanbrc 595	1 ⊢ (𝜑 → 𝐻 ∈ CMnd)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086  –onto→wfo 6536  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  +_gcplusg 17428  Mndcmnd 18923  CMndccmn 19994

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fo 6544  df-fv 6546  df-riota 7377  df-ov 7423  df-0g 17612  df-mgm 18816  df-sgrp 18908  df-mnd 18924  df-cmn 19996

This theorem is used by:  ghmabl  20046