MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  iscmnd Structured version   Visualization version   GIF version

Theorem iscmnd 19691
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
StepHypRef Expression
1 iscmnd.g . . 3 (𝜑𝐺 ∈ Mnd)
2 iscmnd.c . . . . 5 ((𝜑𝑥𝐵𝑦𝐵) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
323expib 1122 . . . 4 (𝜑 → ((𝑥𝐵𝑦𝐵) → (𝑥 + 𝑦) = (𝑦 + 𝑥)))
43ralrimivv 3170 . . 3 (𝜑 → ∀𝑥𝐵𝑦𝐵 (𝑥 + 𝑦) = (𝑦 + 𝑥))
5 iscmnd.b . . . . 5 (𝜑𝐵 = (Base‘𝐺))
6 iscmnd.p . . . . . . . 8 (𝜑+ = (+g𝐺))
76oveqd 7370 . . . . . . 7 (𝜑 → (𝑥 + 𝑦) = (𝑥(+g𝐺)𝑦))
86oveqd 7370 . . . . . . 7 (𝜑 → (𝑦 + 𝑥) = (𝑦(+g𝐺)𝑥))
97, 8eqeq12d 2745 . . . . . 6 (𝜑 → ((𝑥 + 𝑦) = (𝑦 + 𝑥) ↔ (𝑥(+g𝐺)𝑦) = (𝑦(+g𝐺)𝑥)))
105, 9raleqbidv 3310 . . . . 5 (𝜑 → (∀𝑦𝐵 (𝑥 + 𝑦) = (𝑦 + 𝑥) ↔ ∀𝑦 ∈ (Base‘𝐺)(𝑥(+g𝐺)𝑦) = (𝑦(+g𝐺)𝑥)))
115, 10raleqbidv 3310 . . . 4 (𝜑 → (∀𝑥𝐵𝑦𝐵 (𝑥 + 𝑦) = (𝑦 + 𝑥) ↔ ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)(𝑥(+g𝐺)𝑦) = (𝑦(+g𝐺)𝑥)))
1211anbi2d 630 . . 3 (𝜑 → ((𝐺 ∈ Mnd ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 + 𝑦) = (𝑦 + 𝑥)) ↔ (𝐺 ∈ Mnd ∧ ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)(𝑥(+g𝐺)𝑦) = (𝑦(+g𝐺)𝑥))))
131, 4, 12mpbi2and 712 . 2 (𝜑 → (𝐺 ∈ Mnd ∧ ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)(𝑥(+g𝐺)𝑦) = (𝑦(+g𝐺)𝑥)))
14 eqid 2729 . . 3 (Base‘𝐺) = (Base‘𝐺)
15 eqid 2729 . . 3 (+g𝐺) = (+g𝐺)
1614, 15iscmn 19686 . 2 (𝐺 ∈ CMnd ↔ (𝐺 ∈ Mnd ∧ ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)(𝑥(+g𝐺)𝑦) = (𝑦(+g𝐺)𝑥)))
1713, 16sylibr 234 1 (𝜑𝐺 ∈ CMnd)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1540  wcel 2109  wral 3044  cfv 6486  (class class class)co 7353  Basecbs 17138  +gcplusg 17179  Mndcmnd 18626  CMndccmn 19677
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rex 3054  df-rab 3397  df-v 3440  df-dif 3908  df-un 3910  df-ss 3922  df-nul 4287  df-if 4479  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-br 5096  df-iota 6442  df-fv 6494  df-ov 7356  df-cmn 19679
This theorem is referenced by:  isabld  19692  subcmn  19734  cntrcmnd  19739  prdscmnd  19758  iscrngd  20195  xrsmcmn  21316  psrcrng  21897  0ringcring  33205  idlsrgcmnd  33465  primrootsunit1  42073  2zrngacmnd  48236
  Copyright terms: Public domain W3C validator