Theorem weso

Description: A well-ordering is a strict ordering. (Contributed by NM, 16-Mar-1997)

	Ref	Expression
Assertion	weso	$$⊢R\mathrm{We}A\to R\mathrm{Or}A$$

Proof

Step	Hyp	Ref	Expression
1		df-we	$$⊢R\mathrm{We}A\leftrightarrow \left(R\mathrm{Fr}A\wedge R\mathrm{Or}A\right)$$
2	1	simprbi	$$⊢R\mathrm{We}A\to R\mathrm{Or}A$$