Documentation

ToCslib.Order.DiscreteOmegaCompletePartialOrder

Discrete value domains #

An equality-ordered type is an omega-CPO: every increasing sequence is constant. The wrapper avoids changing the ordinary arithmetic order on numbers or the Boolean order when using them as runtime values.

structure DiscreteOrder (α : Type u_1) :
Type u_1

A type equipped with the equality order.

  • value : α

    The underlying value.

Instances For
    theorem DiscreteOrder.ext {α : Type u_1} {x y : DiscreteOrder α} (value : x.value = y.value) :
    x = y
    theorem DiscreteOrder.ext_iff {α : Type u_1} {x y : DiscreteOrder α} :
    x = y ↔ x.value = y.value
    def instDecidableEqDiscreteOrder.decEq {α✝ : Type u_1} [DecidableEq α✝] (x✝ x✝¹ : DiscreteOrder α✝) :
    Decidable (x✝ = x✝¹)
    Equations
    Instances For
      @[instance_reducible]
      instance instReprDiscreteOrder {α✝ : Type u_1} [Repr α✝] :
      Equations
      def instReprDiscreteOrder.repr {α✝ : Type u_1} [Repr α✝] :
      Equations
      Instances For
        @[instance_reducible]
        Equations
        @[simp]
        theorem DiscreteOrder.le_iff_eq {α : Type u_1} (a b : DiscreteOrder α) :
        a ≤ b ↔ a = b
        @[instance_reducible]
        Equations
        • One or more equations did not get rendered due to their size.
        def DiscreteOrder.continuousMap {α : Type u_1} {β : Type u_2} [OmegaCompletePartialOrder β] (f : α → β) :

        Every map from a discrete domain is continuous.

        Equations
        Instances For

          Constructing a continuous map from a discrete domain is itself continuous.