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

Theorem ofldtos 20902
Description: An ordered field is a totally ordered set. (Contributed by Thierry Arnoux, 20-Jan-2018.)
Assertion
Ref Expression
ofldtos (𝐹 ∈ oField → 𝐹 ∈ Toset)

Proof of Theorem ofldtos
StepHypRef Expression
1 isofld 20893 . . 3 (𝐹 ∈ oField ↔ (𝐹 ∈ Field ∧ 𝐹 ∈ oRing))
21simprbi 501 . 2 (𝐹 ∈ oField → 𝐹 ∈ oRing)
3 orngogrp 20892 . 2 (𝐹 ∈ oRing → 𝐹 ∈ oGrp)
4 isogrp 20147 . . 3 (𝐹 ∈ oGrp ↔ (𝐹 ∈ Grp ∧ 𝐹 ∈ oMnd))
54simprbi 501 . 2 (𝐹 ∈ oGrp → 𝐹 ∈ oMnd)
6 omndtos 20150 . 2 (𝐹 ∈ oMnd → 𝐹 ∈ Toset)
72, 3, 5, 64syl 19 1 (𝐹 ∈ oField → 𝐹 ∈ Toset)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2141  Tosetctos 18429  Grpcgrp 18958  oMndcomnd 20142  oGrpcogrp 20143  Fieldcfield 20759  oRingcorng 20886  oFieldcofld 20887
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-in 3911  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  df-ogrp 20145  df-orng 20888  df-ofld 20889
This theorem is referenced by:  ofldchr  21608
  Copyright terms: Public domain W3C validator