proposition: Lemma mint_eval_mon_succ : forall (val : valuation I) k (mi mi' : mint k), mint_gt mi mi' -> succ_vec (mint_eval val mi) (mint_eval val mi').
proof: Proof. intros. destruct H. split. apply mint_eval_mon_succeq. hyp. unfold mint_eval, add_vectors. simpl. apply vec_plus_gt_compat_l. unfold MBI.vec_at0. apply Vforall2_elim_nth. exact (mint_eval_mon_succeq_args _ H). hyp. Qed.
imports: Coq(Setoid) CoLoR(LogicUtil Matrix OrdSemiRing VecUtil AMonAlg SN RelUtil AWFMInterpretation NatUtil AMatrixBasedInt)