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

Theorem ofldtos 20852
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 20843 . . 3 (𝐹 ∈ oField ↔ (𝐹 ∈ Field ∧ 𝐹 ∈ oRing))
21simprbi 498 . 2 (𝐹 ∈ oField → 𝐹 ∈ oRing)
3 orngogrp 20842 . 2 (𝐹 ∈ oRing → 𝐹 ∈ oGrp)
4 isogrp 20097 . . 3 (𝐹 ∈ oGrp ↔ (𝐹 ∈ Grp ∧ 𝐹 ∈ oMnd))
54simprbi 498 . 2 (𝐹 ∈ oGrp → 𝐹 ∈ oMnd)
6 omndtos 20100 . 2 (𝐹 ∈ oMnd → 𝐹 ∈ Toset)
72, 3, 5, 64syl 19 1 (𝐹 ∈ oField → 𝐹 ∈ Toset)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2119  Tosetctos 18378  Grpcgrp 18907  oMndcomnd 20092  oGrpcogrp 20093  Fieldcfield 20709  oRingcorng 20836  oFieldcofld 20837
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2712  ax-nul 5235
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2719  df-cleq 2732  df-clel 2815  df-ne 2936  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-sbc 3731  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-br 5080  df-iota 6448  df-fv 6500  df-ov 7366  df-omnd 20094  df-ogrp 20095  df-orng 20838  df-ofld 20839
This theorem is referenced by:  ofldchr  21558
  Copyright terms: Public domain W3C validator