This is an inofficial mirror of http://metamath.tirix.org for personal testing of a visualizer extension only.

Metamath Proof Explorer

Theorem socnv

Description: The converse of a strict ordering is still a strict ordering. (Contributed by Scott Fenton, 13-Jun-2018)

		Ref	Expression
	Assertion	socnv	$⊢ R Or A \to R^{-1} Or A$

Step	Hyp	Ref	Expression
1		cnvso	$⊢ R Or A \leftrightarrow R^{-1} Or A$
2	1	biimpi	$⊢ R Or A \to R^{-1} Or A$