Theorem ofldtos 21013

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

Step	Hyp	Ref	Expression
1		isofld 21004	. . 3 ⊢ (𝐹 ∈ oField ↔ (𝐹 ∈ Field ∧ 𝐹 ∈ oRing))
2	1	simprbi 503	. 2 ⊢ (𝐹 ∈ oField → 𝐹 ∈ oRing)
3		orngogrp 21003	. 2 ⊢ (𝐹 ∈ oRing → 𝐹 ∈ oGrp)
4		isogrp 20225	. . 3 ⊢ (𝐹 ∈ oGrp ↔ (𝐹 ∈ Grp ∧ 𝐹 ∈ oMnd))
5	4	simprbi 503	. 2 ⊢ (𝐹 ∈ oGrp → 𝐹 ∈ oMnd)
6		omndtos 20228	. 2 ⊢ (𝐹 ∈ oMnd → 𝐹 ∈ Toset)
7	2, 3, 5, 6	4syl 20	1 ⊢ (𝐹 ∈ oField → 𝐹 ∈ Toset)

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2146  Tosetctos 18495  Grpcgrp 19031  oMndcomnd 20220  oGrpcogrp 20221  Fieldcfield 20865  oRingcorng 20997  oFieldcofld 20998

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738  ax-nul 5274

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-iota 6499  df-fv 6551  df-ov 7426  df-omnd 20222  df-ogrp 20223  df-orng 20999  df-ofld 21000

This theorem is used by:  ofldchr  21763