Strict ordering of Cedar terms

This file contains proofs that the less-than (<) relation on Cedar terms is strict.

instance Cedar.Thm.ExtOp.strictLT : Data.StrictLT SymCC.ExtOp

instance Cedar.Thm.TermPrimType.strictLT : Data.StrictLT SymCC.TermPrimType

instance Cedar.Thm.TermType.strictLT : Data.StrictLT SymCC.TermType

instance Cedar.Thm.UUF.strictLT : Data.StrictLT SymCC.UUF

instance Cedar.Thm.PatElem.strictLT : Data.StrictLT Spec.PatElem

instance Cedar.Thm.Op.strictLT : Data.StrictLT SymCC.Op

instance Cedar.Thm.TermVar.strictLT : Data.StrictLT SymCC.TermVar

instance Cedar.Thm.TermPrim.strictLT : Data.StrictLT SymCC.TermPrim

instance Cedar.Thm.Term.strictLT : Data.StrictLT SymCC.Term