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

Theorem ofldtos 20818
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 20809 . . 3 (𝐹 ∈ oField ↔ (𝐹 ∈ Field ∧ 𝐹 ∈ oRing))
21simprbi 497 . 2 (𝐹 ∈ oField → 𝐹 ∈ oRing)
3 orngogrp 20808 . 2 (𝐹 ∈ oRing → 𝐹 ∈ oGrp)
4 isogrp 20065 . . 3 (𝐹 ∈ oGrp ↔ (𝐹 ∈ Grp ∧ 𝐹 ∈ oMnd))
54simprbi 497 . 2 (𝐹 ∈ oGrp → 𝐹 ∈ oMnd)
6 omndtos 20068 . 2 (𝐹 ∈ oMnd → 𝐹 ∈ Toset)
72, 3, 5, 64syl 19 1 (𝐹 ∈ oField → 𝐹 ∈ Toset)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2114  Tosetctos 18349  Grpcgrp 18875  oMndcomnd 20060  oGrpcogrp 20061  Fieldcfield 20675  oRingcorng 20802  oFieldcofld 20803
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-nul 5253
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-iota 6456  df-fv 6508  df-ov 7371  df-omnd 20062  df-ogrp 20063  df-orng 20804  df-ofld 20805
This theorem is referenced by:  ofldchr  21543
  Copyright terms: Public domain W3C validator