Theorem iscmn 19950

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 6874	. . . . 5 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
2		iscmn.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐺)
3	1, 2	eqtr4di 2813	. . . 4 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵)
4		raleq 3316	. . . . 5 ⊢ ((Base‘𝑔) = 𝐵 → (∀𝑦 ∈ (Base‘𝑔)(𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥) ↔ ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥)))
5	4	raleqbi1dv 3329	. . . 4 ⊢ ((Base‘𝑔) = 𝐵 → (∀𝑥 ∈ (Base‘𝑔)∀𝑦 ∈ (Base‘𝑔)(𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥)))
6	3, 5	syl 18	. . 3 ⊢ (𝑔 = 𝐺 → (∀𝑥 ∈ (Base‘𝑔)∀𝑦 ∈ (Base‘𝑔)(𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥)))
7		fveq2 6874	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = (+g‘𝐺))
8		iscmn.p	. . . . . . 7 ⊢ + = (+g‘𝐺)
9	7, 8	eqtr4di 2813	. . . . . 6 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = + )
10	9	oveqd 7426	. . . . 5 ⊢ (𝑔 = 𝐺 → (𝑥(+g‘𝑔)𝑦) = (𝑥 + 𝑦))
11	9	oveqd 7426	. . . . 5 ⊢ (𝑔 = 𝐺 → (𝑦(+g‘𝑔)𝑥) = (𝑦 + 𝑥))
12	10, 11	eqeq12d 2776	. . . 4 ⊢ (𝑔 = 𝐺 → ((𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥) ↔ (𝑥 + 𝑦) = (𝑦 + 𝑥)))
13	12	2ralbidv 3226	. . 3 ⊢ (𝑔 = 𝐺 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 + 𝑦) = (𝑦 + 𝑥)))
14	6, 13	bitrd 282	. 2 ⊢ (𝑔 = 𝐺 → (∀𝑥 ∈ (Base‘𝑔)∀𝑦 ∈ (Base‘𝑔)(𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 + 𝑦) = (𝑦 + 𝑥)))
15		df-cmn 19943	. 2 ⊢ CMnd = {𝑔 ∈ Mnd ∣ ∀𝑥 ∈ (Base‘𝑔)∀𝑦 ∈ (Base‘𝑔)(𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥)}
16	14, 15	elrab2 3649	1 ⊢ (𝐺 ∈ CMnd ↔ (𝐺 ∈ Mnd ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 + 𝑦) = (𝑦 + 𝑥)))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076  ‘cfv 6528  (class class class)co 7409  Basecbs 17334  +_gcplusg 17375  Mndcmnd 18870  CMndccmn 19941

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732

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 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-iota 6484  df-fv 6536  df-ov 7412  df-cmn 19943

This theorem is used by:  isabl2  19951  cmnpropd  19952  iscmnd  19955  cmnmnd  19958  cmncom  19959  ghmcmn  19992  submcmn2  20000  cycsubmcmn  20050  iscrng2  20426  xrs1cmn  21695  abliso  33515  gicabl  44038  pgrpgt2nabl  49394