proposition: Lemma lt_funI f (ONE: forall x, x < f x) i j (LT: i < j) d : fexp f i d < fexp f j d.
proof: Proof. revert i LT; induction j; ins; try lia. destruct (eqP i j); desf; eauto. eapply lt_trans, ONE; apply IHj; lia. Qed.
imports: Arith micromega.Lia Setoid IndefiniteDescription ClassicalChoice HahnBase HahnList HahnEquational HahnRewrite HahnRelationsBasic HahnSets HahnNatExtra HahnListBefore HahnWf HahnSorted HahnTotalExt