Theorem omndmnd 20149

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 2761	. . 3 ⊢ (Base‘𝑀) = (Base‘𝑀)
2		eqid 2761	. . 3 ⊢ (+g‘𝑀) = (+g‘𝑀)
3		eqid 2761	. . 3 ⊢ (le‘𝑀) = (le‘𝑀)
4	1, 2, 3	isomnd 20146	. 2 ⊢ (𝑀 ∈ oMnd ↔ (𝑀 ∈ Mnd ∧ 𝑀 ∈ Toset ∧ ∀𝑎 ∈ (Base‘𝑀)∀𝑏 ∈ (Base‘𝑀)∀𝑐 ∈ (Base‘𝑀)(𝑎(le‘𝑀)𝑏 → (𝑎(+g‘𝑀)𝑐)(le‘𝑀)(𝑏(+g‘𝑀)𝑐))))
5	4	simp1bi 1157	1 ⊢ (𝑀 ∈ oMnd → 𝑀 ∈ Mnd)

Syntax hints:   → wi 4   ∈ wcel 2141  ∀wral 3075   class class class wbr 5099  ‘cfv 6517  (class class class)co 7392  Basecbs 17228  +_gcplusg 17269  lecple 17276  Tosetctos 18429  Mndcmnd 18751  oMndcomnd 20142

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733  ax-nul 5255

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-sbc 3745  df-dif 3907  df-un 3909  df-ss 3921  df-nul 4286  df-if 4480  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-iota 6473  df-fv 6525  df-ov 7395  df-omnd 20144

This theorem is referenced by:  omndadd2d  20153  omndadd2rd  20154  omndmul2  20156  omndmul3  20157  omndmul  20158  ogrpinv0le  20159  gsumle  20168  archirng  33329