Documentation

Cedar.Data.LT

This file contains utilities for working with strict and decidable LT relations.

class Cedar.Data.StrictLT (α : Type u_1) [LT α] :
  • asymmetric (a b : α) : a < b¬b < a
  • transitive (a b c : α) : a < bb < ca < c
  • connected (a b : α) : a ba < b b < a
Instances
    theorem Cedar.Data.StrictLT.irreflexive {α : Type u_1} [LT α] [StrictLT α] (x : α) :
    ¬x < x
    theorem Cedar.Data.StrictLT.if_not_lt_gt_then_eq {α : Type u_1} [LT α] [StrictLT α] (x y : α) :
    ¬x < y¬y < xx = y
    theorem Cedar.Data.StrictLT.if_not_lt_eq_then_gt {α : Type u_1} [LT α] [StrictLT α] (x y : α) :
    ¬x < y¬x = yx > y
    theorem Cedar.Data.StrictLT.not_eq {α : Type u_1} [LT α] [StrictLT α] (x y : α) :
    x < y¬x = y
    theorem List.cons_lt_cons {α : Type u_1} [LT α] [Cedar.Data.StrictLT α] (x : α) (xs ys : List α) :
    xs < ysx :: xs < x :: ys
    theorem List.slt_irrefl {α : Type u_1} [LT α] [Cedar.Data.StrictLT α] [DecidableLT α] (xs : List α) :
    ¬xs < xs
    theorem List.slt_trans {α : Type u_1} [LT α] [Cedar.Data.StrictLT α] {xs ys zs : List α} :
    xs < ysys < zsxs < zs
    theorem List.slt_asymm {α : Type u_1} [LT α] [Cedar.Data.StrictLT α] [DecidableLT α] {xs ys : List α} :
    xs < ys¬ys < xs
    theorem List.lt_conn {α : Type u_1} [LT α] [Cedar.Data.StrictLT α] {xs ys : List α} :
    xs ysxs < ys ys < xs
    def Bool.lt (a b : Bool) :
    Equations
    Instances For
      Equations
      instance Bool.decLt (a b : Bool) :
      Decidable (a < b)
      Equations