Theorem iscmn 20030

Description: The predicate "is a commutative monoid". (Contributed by Mario Carneiro, 6-Jan-2015.)

Hypotheses

Ref	Expression
iscmn.b	⊢ 𝐵 = (Base‘𝐺)
iscmn.p	⊢ + = (+g‘𝐺)

Assertion

Ref	Expression
iscmn	⊢ (𝐺 ∈ CMnd ↔ (𝐺 ∈ Mnd ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 + 𝑦) = (𝑦 + 𝑥)))

Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐺,𝑦

Allowed substitution hints:   + (𝑥, 𝑦)

Proof of Theorem iscmn

Dummy variable 𝑔 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6905	. . . . 5 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
2		iscmn.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐺)
3	1, 2	eqtr4di 2816	. . . 4 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵)
4		raleq 3320	. . . . 5 ⊢ ((Base‘𝑔) = 𝐵 → (∀𝑦 ∈ (Base‘𝑔)(𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥) ↔ ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥)))
5	4	raleqbi1dv 3333	. . . 4 ⊢ ((Base‘𝑔) = 𝐵 → (∀𝑥 ∈ (Base‘𝑔)∀𝑦 ∈ (Base‘𝑔)(𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥)))
6	3, 5	syl 18	. . 3 ⊢ (𝑔 = 𝐺 → (∀𝑥 ∈ (Base‘𝑔)∀𝑦 ∈ (Base‘𝑔)(𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥)))
7		fveq2 6905	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = (+g‘𝐺))
8		iscmn.p	. . . . . . 7 ⊢ + = (+g‘𝐺)
9	7, 8	eqtr4di 2816	. . . . . 6 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = + )
10	9	oveqd 7457	. . . . 5 ⊢ (𝑔 = 𝐺 → (𝑥(+g‘𝑔)𝑦) = (𝑥 + 𝑦))
11	9	oveqd 7457	. . . . 5 ⊢ (𝑔 = 𝐺 → (𝑦(+g‘𝑔)𝑥) = (𝑦 + 𝑥))
12	10, 11	eqeq12d 2779	. . . 4 ⊢ (𝑔 = 𝐺 → ((𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥) ↔ (𝑥 + 𝑦) = (𝑦 + 𝑥)))
13	12	2ralbidv 3230	. . 3 ⊢ (𝑔 = 𝐺 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 + 𝑦) = (𝑦 + 𝑥)))
14	6, 13	bitrd 282	. 2 ⊢ (𝑔 = 𝐺 → (∀𝑥 ∈ (Base‘𝑔)∀𝑦 ∈ (Base‘𝑔)(𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 + 𝑦) = (𝑦 + 𝑥)))
15		df-cmn 20023	. 2 ⊢ CMnd = {𝑔 ∈ Mnd ∣ ∀𝑥 ∈ (Base‘𝑔)∀𝑦 ∈ (Base‘𝑔)(𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥)}
16	14, 15	elrab2 3652	1 ⊢ (𝐺 ∈ CMnd ↔ (𝐺 ∈ Mnd ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 + 𝑦) = (𝑦 + 𝑥)))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ‘cfv 6555  (class class class)co 7440  Basecbs 17413  +_gcplusg 17454  Mndcmnd 18949  CMndccmn 20021

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-ext 2735

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-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-iota 6509  df-fv 6563  df-ov 7443  df-cmn 20023

This theorem is used by:  isabl2  20031  cmnpropd  20032  iscmnd  20035  cmnmnd  20038  cmncom  20039  ghmcmn  20072  submcmn2  20080  cycsubmcmn  20130  iscrng2  20506  xrs1cmn  21775  abliso  33663  gicabl  44292  pgrpgt2nabl  49681