proposition: Lemma rmaxRltRight : forall n m p : rNat, rlt (rmax m p) n -> rlt p n.
proof: Proof. intros n m p; unfold rmax in |- *; case (rltDec m p); auto with stalmarck; intros Rlt0. Casec Rlt0; intros Rlt0; auto with stalmarck. intros Rlt1; apply rltTrans with (y := m); auto with stalmarck. rewrite <- Rlt0; auto with stalmarck. Qed.
imports: Stalmarck(sTactic) Coq(Relation_Definitions) Coq(ZArith) Coq(Inverse_Image) Coq(Inclusion) Coq(Wf_nat) Coq(List)