1
1
(************************************************************************)
2
2
(* v * The Coq Proof Assistant / The Coq Development Team *)
4
4
(* \VV/ **************************************************************)
5
5
(* // * This file is distributed under the terms of the *)
6
6
(* * GNU Lesser General Public License Version 2.1 *)
7
7
(************************************************************************)
11
11
(** We prove that there is only one proof of [x=x], i.e [refl_equal x].
12
12
This holds if the equality upon the set of [x] is decidable.