proposition: Lemma ge_gtx_compat : forall x y z, x >>= y -> y >_0 z -> x >_0 z.
proof: Proof. unfold gtx. intuition. left. apply ge_gt_compat with y; hyp. rewrite H2. rewrite H0 in H. destruct (ge_gt_eq H); intuition. Qed.
imports: CoLoR(AMonAlg Matrix OrdSemiRing VecUtil SN RelUtil LogicUtil AMatrixBasedInt) Coq(Setoid Morphisms)