Theorem omndmnd 20187

Description: A left-ordered monoid is a monoid. (Contributed by Thierry Arnoux, 13-Mar-2018.)

Assertion

Ref	Expression
omndmnd	⊢ (𝑀 ∈ oMnd → 𝑀 ∈ Mnd)

Proof of Theorem omndmnd

Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2765	. . 3 ⊢ (Base‘𝑀) = (Base‘𝑀)
2		eqid 2765	. . 3 ⊢ (+g‘𝑀) = (+g‘𝑀)
3		eqid 2765	. . 3 ⊢ (le‘𝑀) = (le‘𝑀)
4	1, 2, 3	isomnd 20184	. 2 ⊢ (𝑀 ∈ oMnd ↔ (𝑀 ∈ Mnd ∧ 𝑀 ∈ Toset ∧ ∀𝑎 ∈ (Base‘𝑀)∀𝑏 ∈ (Base‘𝑀)∀𝑐 ∈ (Base‘𝑀)(𝑎(le‘𝑀)𝑏 → (𝑎(+g‘𝑀)𝑐)(le‘𝑀)(𝑏(+g‘𝑀)𝑐))))
5	4	simp1bi 1161	1 ⊢ (𝑀 ∈ oMnd → 𝑀 ∈ Mnd)

Syntax hints:   → wi 4   ∈ wcel 2145  ∀wral 3079   class class class wbr 5105  ‘cfv 6525  (class class class)co 7400  Basecbs 17259  +_gcplusg 17300  lecple 17307  Tosetctos 18460  Mndcmnd 18782  oMndcomnd 20180

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737  ax-nul 5261

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-sbc 3748  df-dif 3910  df-un 3912  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-iota 6481  df-fv 6533  df-ov 7403  df-omnd 20182

This theorem is referenced by:  omndadd2d  20191  omndadd2rd  20192  omndmul2  20194  omndmul3  20195  omndmul  20196  ogrpinv0le  20197  gsumle  20206  archirng  33421