proposition: Lemma Const_leq_trans : forall t n1 n2, n1 <= n2 -> Const_leq n1 t -> Const_leq n2 t.
proof: Proof. intros. induction t; try (constructor; simpl; lia); inversion H0; subst; solve [ constructor; simpl; lia | constructor; eauto ]. Qed.
imports: mathcomp(ssreflect ssrbool ssrnat eqtype) String QuickChick(QuickChick) Arith List Lia QuickChick.stlc(lambda) Wellfounded