proposition: Lemma eq_refl : forall m : t, eq m m.
proof: Proof. intros (m,Hm); induction m; unfold eq; simpl; auto. destruct a. destruct (X.compare t0 t0) as [Hlt|Heq|Hlt]; auto. - apply (MapS.Raw.MX.lt_antirefl Hlt); auto. - split. + apply D.eq_refl. + inversion_clear Hm. apply (IHm H). - apply (MapS.Raw.MX.lt_antirefl Hlt); auto. Qed.
imports: FMapInterface