Dual_Ordering_is_Ordering_v2
Provedorder-theoryproofwiki
Let (S, ≤) be an ordered set. The dual ordering ≥ is also an ordering on S: a ≤ b iff b ≥ a.
Preamble
import Mathlib.Order.Synonym
Formal statement
theorem Dual_Ordering_is_Ordering_v2 {α : Type _} [PartialOrder α] (a b : α) : a ≤ b ↔ @LE.le αᵒᵈ _ b a := by sorrySource