Data.Type.Nat.LT

Documentation

class LT (n :: Nat) (m :: Nat) where

Less-Than-or. \(<\). Well-founded relation on Nat.

GHC can solve this for us!

>>> ltProof :: LTProof Nat0 Nat4
LESucc LEZero

>>> ltProof :: LTProof Nat2 Nat4
LESucc (LESucc (LESucc LEZero))

>>> ltProof :: LTProof Nat3 Nat3
...
...error...
...

Methods

ltProof :: LTProof n m

Instances

LE (S n) m => LT n m

Defined in Data.Type.Nat.LT

Methods

ltProof :: LTProof n m

type LTProof n m = LEProof (S n) m

An evidence \(n < m\) which is the same as (1 + n le m).

withLTProof :: LTProof n m -> (LT n m => r) -> r

Lemmas

ltReflAbsurd :: LTProof n n -> a

\(\forall n : \mathbb{N}, n < n \to \bot \)

ltSymAbsurd :: LTProof n m -> LTProof m n -> a

\(\forall n\, m : \mathbb{N}, n < m \to m < n \to \bot \)

ltTrans :: LTProof n m -> LTProof m p -> LTProof n p

\(\forall n\, m\, p : \mathbb{N}, n < m \to m < p \to n < p \)