Theorem ofldtos 21045

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 21036	. . 3 ⊢ (𝐹 ∈ oField ↔ (𝐹 ∈ Field ∧ 𝐹 ∈ oRing))
2	1	simprbi 503	. 2 ⊢ (𝐹 ∈ oField → 𝐹 ∈ oRing)
3		orngogrp 21035	. 2 ⊢ (𝐹 ∈ oRing → 𝐹 ∈ oGrp)
4		isogrp 20257	. . 3 ⊢ (𝐹 ∈ oGrp ↔ (𝐹 ∈ Grp ∧ 𝐹 ∈ oMnd))
5	4	simprbi 503	. 2 ⊢ (𝐹 ∈ oGrp → 𝐹 ∈ oMnd)
6		omndtos 20260	. 2 ⊢ (𝐹 ∈ oMnd → 𝐹 ∈ Toset)
7	2, 3, 5, 6	4syl 20	1 ⊢ (𝐹 ∈ oField → 𝐹 ∈ Toset)

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2145  Tosetctos 18508  Grpcgrp 19063  oMndcomnd 20252  oGrpcogrp 20253  Fieldcfield 20897  oRingcorng 21029  oFieldcofld 21030

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 2147  ax-9 2155  ax-ext 2734  ax-nul 5267

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 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-iota 6493  df-fv 6545  df-ov 7420  df-omnd 20254  df-ogrp 20255  df-orng 21031  df-ofld 21032

This theorem is used by:  ofldchr  21795