proposition: Theorem rZltAntiSym : forall a b : rZ, rZlt a b -> ~ rZlt b a.
proof: Proof. intros a b H'; red in |- *; intros H'0; absurd (rZlt a a); auto with stalmarck. apply rZltTrans with (y := b); auto with stalmarck. Qed.
imports: Stalmarck(sTactic) Coq(Relation_Definitions) Coq(ZArith) Coq(Inverse_Image) Coq(Inclusion) Coq(Wf_nat) Coq(List)