Theorem iscmnd 20008

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 3204	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 + 𝑦) = (𝑦 + 𝑥))
5		iscmnd.b	. . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐺))
6		iscmnd.p	. . . . . . . 8 ⊢ (𝜑 → + = (+g‘𝐺))
7	6	oveqd 7437	. . . . . . 7 ⊢ (𝜑 → (𝑥 + 𝑦) = (𝑥(+g‘𝐺)𝑦))
8	6	oveqd 7437	. . . . . . 7 ⊢ (𝜑 → (𝑦 + 𝑥) = (𝑦(+g‘𝐺)𝑥))
9	7, 8	eqeq12d 2777	. . . . . 6 ⊢ (𝜑 → ((𝑥 + 𝑦) = (𝑦 + 𝑥) ↔ (𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥)))
10	5, 9	raleqbidv 3335	. . . . 5 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 (𝑥 + 𝑦) = (𝑦 + 𝑥) ↔ ∀𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥)))
11	5, 10	raleqbidv 3335	. . . 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 2761	. . 3 ⊢ (Base‘𝐺) = (Base‘𝐺)
15		eqid 2761	. . 3 ⊢ (+g‘𝐺) = (+g‘𝐺)
16	14, 15	iscmn 20003	. 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 2145  ∀wral 3077  ‘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 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733

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 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  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 6494  df-fv 6546  df-ov 7423  df-cmn 19996

This theorem is used by:  isabld  20009  subcmn  20051  cntrcmnd  20056  prdscmnd  20075  iscrngd  20523  xrsmcmn  21701  psrcrng  22279  0ringcring  33813  idlsrgcmnd  34047  primrootsunit1  43147  2zrngacmnd  49344