Documentation

Mathlib.Tactic.Order.Preprocessing

Facts preprocessing for the order tactic #

In this file we implement the preprocessing procedure for the order tactic. See Mathlib/Tactic/Order.lean for details of preprocessing.

theorem Mathlib.Tactic.Order.not_lt_of_not_le {α : Type u} [Preorder α] {x y : α} (h : ¬x y) :
¬x < y
theorem Mathlib.Tactic.Order.le_of_not_lt_le {α : Type u} [Preorder α] {x y : α} (h1 : ¬x < y) (h2 : x y) :
y x

Supported order types: linear, partial, and preorder.

Instances For

    Find the "best" instance of an order on a given type. A linear order is preferred over a partial order, and a partial order is preferred over a preorder.

    Equations
      Instances For

        Replaces facts of the form x = ⊤ with y ≤ x for all y, and similarly for x = ⊥.

        Equations
          Instances For

            Preprocesses facts for preorders. Replaces x < y with two equivalent facts: x ≤ y and ¬ (y ≤ x). Replaces x = y with x ≤ y, y ≤ x and removes x ≠ y.

            Equations
              Instances For

                Preprocesses facts for partial orders. Replaces x < y, ¬ (x ≤ y), and x = y with equivalent facts involving only , , and . For each fact x = y ⊔ z adds y ≤ x and z ≤ x facts, and similarly for .

                Equations
                  Instances For

                    Preprocesses facts for linear orders. Replaces x < y, ¬ (x ≤ y), ¬ (x < y), and x = y with equivalent facts involving only and . For each fact x = y ⊔ z adds y ≤ x and z ≤ x facts, and similarly for .

                    Equations
                      Instances For

                        Preprocesses facts for order of orderType using either preprocessFactsPreorder or preprocessFactsPartial or preprocessFactsLinear.

                        Equations
                          Instances For