proposition: Lemma bounded_incr: forall A, bounded A -> bounded (incr A).
proof: Proof. intros A [Hd He]. destruct A. split. intros i a j H. destruct (Hd i a j H) as (?&?&?). auto. intros i j H. destruct (He i j H) as (?&?). auto. Qed.
imports: ATBR(Common) ATBR(Classes) ATBR(Graph) ATBR(Monoid) ATBR(SemiLattice) ATBR(SemiRing) ATBR(KleeneAlgebra) ATBR(MxGraph) ATBR(MxSemiLattice) ATBR(MxSemiRing) ATBR(MxKleeneAlgebra) ATBR(DKA_Definitions) ATBR(DKA_CheckLabels) ATBR(StrictStarForm) ATBR(Utils_WF) Coq(Relations)