Theorem omndtos 20056

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

Assertion

Ref	Expression
omndtos	⊢ (𝑀 ∈ oMnd → 𝑀 ∈ Toset)

Proof of Theorem omndtos

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

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

Syntax hints:   → wi 4   ∈ wcel 2113  ∀wral 3051   class class class wbr 5098  ‘cfv 6492  (class class class)co 7358  Basecbs 17136  +_gcplusg 17177  lecple 17184  Tosetctos 18337  Mndcmnd 18659  oMndcomnd 20048

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708  ax-nul 5251

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-sbc 3741  df-dif 3904  df-un 3906  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-iota 6448  df-fv 6500  df-ov 7361  df-omnd 20050

This theorem is referenced by:  omndadd2d  20059  omndadd2rd  20060  submomnd  20061  omndmul2  20062  omndmul  20064  gsumle  20074  orngsqr  20799  ofldtos  20806  isarchi3  33269  archirng  33270  archirngz  33271  archiabllem1a  33273  archiabllem1b  33274  archiabllem2a  33276  archiabllem2c  33277  archiabllem2b  33278  archiabl  33280