Theorem iscmnd 19910

Description: Properties that determine a commutative monoid. (Contributed by Mario Carneiro, 7-Jan-2015.)

Hypotheses

Ref	Expression
iscmnd.b	⊢ (𝜑 → 𝐵 = (Base‘𝐺))
iscmnd.p	⊢ (𝜑 → + = (+g‘𝐺))
iscmnd.g	⊢ (𝜑 → 𝐺 ∈ Mnd)
iscmnd.c	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) = (𝑦 + 𝑥))

Assertion

Ref	Expression
iscmnd	⊢ (𝜑 → 𝐺 ∈ CMnd)

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

Allowed substitution hints:   + (𝑥, 𝑦)

Proof of Theorem iscmnd

Step	Hyp	Ref	Expression
1		iscmnd.g	. . 3 ⊢ (𝜑 → 𝐺 ∈ Mnd)
2		iscmnd.c	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
3	2	3expib 1140	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) = (𝑦 + 𝑥)))
4	3	ralrimivv 3208	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 + 𝑦) = (𝑦 + 𝑥))
5		iscmnd.b	. . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐺))
6		iscmnd.p	. . . . . . . 8 ⊢ (𝜑 → + = (+g‘𝐺))
7	6	oveqd 7436	. . . . . . 7 ⊢ (𝜑 → (𝑥 + 𝑦) = (𝑥(+g‘𝐺)𝑦))
8	6	oveqd 7436	. . . . . . 7 ⊢ (𝜑 → (𝑦 + 𝑥) = (𝑦(+g‘𝐺)𝑥))
9	7, 8	eqeq12d 2781	. . . . . 6 ⊢ (𝜑 → ((𝑥 + 𝑦) = (𝑦 + 𝑥) ↔ (𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥)))
10	5, 9	raleqbidv 3340	. . . . 5 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 (𝑥 + 𝑦) = (𝑦 + 𝑥) ↔ ∀𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥)))
11	5, 10	raleqbidv 3340	. . . 4 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 + 𝑦) = (𝑦 + 𝑥) ↔ ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥)))
12	11	anbi2d 642	. . 3 ⊢ (𝜑 → ((𝐺 ∈ Mnd ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 + 𝑦) = (𝑦 + 𝑥)) ↔ (𝐺 ∈ Mnd ∧ ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥))))
13	1, 4, 12	mpbi2and 725	. 2 ⊢ (𝜑 → (𝐺 ∈ Mnd ∧ ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥)))
14		eqid 2765	. . 3 ⊢ (Base‘𝐺) = (Base‘𝐺)
15		eqid 2765	. . 3 ⊢ (+g‘𝐺) = (+g‘𝐺)
16	14, 15	iscmn 19905	. 2 ⊢ (𝐺 ∈ CMnd ↔ (𝐺 ∈ Mnd ∧ ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥)))
17	13, 16	sylibr 237	1 ⊢ (𝜑 → 𝐺 ∈ CMnd)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ∀wral 3081  ‘cfv 6540  (class class class)co 7419  Basecbs 17293  +_gcplusg 17334  Mndcmnd 18826  CMndccmn 19896

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 2148  ax-9 2156  ax-ext 2737

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 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-iota 6496  df-fv 6548  df-ov 7422  df-cmn 19898

This theorem is used by:  isabld  19911  subcmn  19953  cntrcmnd  19958  prdscmnd  19977  iscrngd  20423  xrsmcmn  21597  psrcrng  22173  0ringcring  33638  idlsrgcmnd  33871  primrootsunit1  42924  2zrngacmnd  49072