Safe Haskell	None
Language	Haskell2010

Data.Type.Nat.LT

Contents

Synopsis

Documentation

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

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

Instances

LE (S n) m => LT n m Source #
Instance details Defined in Data.Type.Nat.LT Methods ltProof :: LTProof n m Source #

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

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

Lemmas

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

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

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